Method and apparatus for document clustering and document sketching

• US 7,433,869 B2
• Filed: 06/29/2006
• Issued: 10/07/2008
• Est. Priority Date: 07/01/2005
• Status: Active Grant

• Current Assignee: Ebrary
• Original Assignee: Ebrary
• Inventors: Gollapudi, Sreenivas
• Primary Examiner(s): Alam; Shahid Al
• Assistant Examiner(s): Alvesteffer; Jason L
• Application Number:
  US11/427,781
• Publication Number:
  US 20070005589A1
• Time in Patent Office: 831 Days
• Field of Search: 707/5, 707/3, 707/6, 707/101, 707/102, 707/103, 707/104.1
• US Class Current: 1/1
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/355 Class or cluster creation or modification
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

A first embodiment of the invention provides a system that automatically classifies documents in a collection into clusters based on the similarities between documents, that automatically classifies new documents into the right clusters, and that may change the number or parameters of clusters under various circumstances. A second embodiment of the invention provides a technique for comparing two documents, in which a fingerprint or sketch of each document is computed. In particular, this embodiment of the invention uses a specific algorithm to compute the document'"'"'s fingerprint, One embodiment uses a sentence in the document as a logical delimiter or window from which significant words are extracted and, thereafter, a hash is computed of all pair-wise permutations. Words are extracted based on their weight in the document, which can be computed using measures such as term frequency and the inverse document frequency.

Claims

1. A method for computing the sketch for a document, comprising the steps of:

using a sentence in a document as a logical delimiter or window from which significant words are extracted based upon semantics of each word in the sentence and each word'"'"'s relationship to other words in the sentence;

computing a weight for said extracted words;

extracting the top-k of said words based on their weight in the document, wherein k represents a numerical value;

lexicographically sorting words in a phrase to capture content of the sentence before computing a sketch;

computing a hash of all pair-wise permutations for said significant words;

sorting said computed hashes; and

choosing the top-m hashes to represent the document, wherein m represents a numerical value.

2. The method of claim 1, wherein values of m are 256 to 512 for large documents (>

1M).

3. The method of claim 1, wherein weight is computed using measures comprising any of term frequency and inverse document frequency.

4. The method of claim 1, further comprising the step of:

transporting sketches using Bloom filters.

5. The method of claim 1, further comprising the step of:

computing a sketch of a hierarchy or a taxonomy given the sketches of the documents in the taxonomy.

6. The method of claim 1, further comprising the step of:

performing a selection based associative search of documents by allowing an end user to select a portion of a document and then identifying documents containing similar information.

7. The method of claim 1, further comprising the step of:

performing automatic taxonomy generation and clustering of documents using a tree metric approach to maintain original distances between documents while at the same time organizing said documents in a hierarchy.

8. The method of claim 7, further comprising the step of:

performing efficient extraction of taxonomies from said tree metric.

9. The method of claim 1, further comprising the step of:

performing on-line classification, wherein documents arrive at different times and are indexed in an existing taxonomy.

10. The method of claim 1, further comprising the steps of:

providing a compact representation of a sketch; and

computing similarities for associative search.

11. The method of claim 1, further comprising the step of:

in a distributed environment for collaboratively shared documents, using a sketch for efficient inter-repository distribution, communication, and retrieval of information across networks, wherein a whole document or a collection need not be transported or queried against, wherein said sketch substitutes for a document in all supported computations.

12. The method of claim 11, wherein an efficient associative search offers similar documents when a requested document is not available.