US20170262526A1 - Computer-Implemented System And Method For Forming Document Clusters For Display - Google Patents

Computer-Implemented System And Method For Forming Document Clusters For Display Download PDF

Info

Publication number
US20170262526A1
US20170262526A1 US15/420,012 US201715420012A US2017262526A1 US 20170262526 A1 US20170262526 A1 US 20170262526A1 US 201715420012 A US201715420012 A US 201715420012A US 2017262526 A1 US2017262526 A1 US 2017262526A1
Authority
US
United States
Prior art keywords
cluster
clusters
document
documents
difference
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US15/420,012
Inventor
Dan Gallivan
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nuix North America Inc
Original Assignee
FTI Consulting Technology LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by FTI Consulting Technology LLC filed Critical FTI Consulting Technology LLC
Priority to US15/420,012 priority Critical patent/US20170262526A1/en
Publication of US20170262526A1 publication Critical patent/US20170262526A1/en
Assigned to FTI CONSULTING TECHNOLOGY LLC reassignment FTI CONSULTING TECHNOLOGY LLC CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: FTI TECHNOLOGY LLC
Assigned to NUIX NORTH AMERICA INC. reassignment NUIX NORTH AMERICA INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: FTI CONSULTING TECHNOLOGY LLC
Assigned to ATTENEX CORPORATION reassignment ATTENEX CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: GALLIVAN, DAN
Assigned to FTI TECHNOLOGY LLC reassignment FTI TECHNOLOGY LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ATTENEX CORPORATION
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/284Relational databases
    • G06F16/285Clustering or classification
    • G06F16/287Visualization; Browsing
    • G06F17/30601
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/283Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/35Clustering; Classification
    • G06F16/355Class or cluster creation or modification
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/93Document management systems
    • G06F17/30011
    • G06F17/30592
    • G06F17/3071
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/951Indexing; Web crawling techniques
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9535Search customisation based on user profiles and personalisation
    • G06F17/30864
    • G06F17/30867
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99943Generating database or data structure, e.g. via user interface

Definitions

  • the present invention relates in general to text mining and, in particular, to a computer-implemented system and method for forming document clusters for display.
  • Document warehousing extends data warehousing to content mining and retrieval. Document warehousing attempts to extract semantic information from collections of unstructured documents to provide conceptual information with a high degree of precision and recall. Documents in a document warehouse share several properties. First, the documents lack a common structure or shared type. Second, semantically-related documents are integrated through text mining. Third, essential document features are extracted and explicitly stored as part of the document warehouse. Finally, documents are often retrieved from multiple and disparate sources, such as over the Internet or as electronic messages.
  • Document warehouses are built in stages to deal with a wide range of information sources.
  • document sources are identified and documents are retrieved into a repository.
  • the document sources could be electronic messaging folders or Web content retrieved over the Internet.
  • the documents are pre-processed to format and regularize the information into a consistent manner.
  • text mining is performed to extract semantic content, including identifying dominant themes, extracting key features and summarizing the content.
  • metadata is compiled from the semantic context to explicate essential attributes.
  • the metadata is provided in a format amenable to normalized queries, such as database management tools.
  • Document warehousing is described in D. Sullivan, “Document Warehousing and Text Mining, Techniques for Improving Business Operations, Marketing, and Sales,” Chs. 1-3, Wiley Computer Publishing (2001), the disclosure of which is incorporated by reference.
  • Text mining is at the core of the data warehousing process. Text mining involves the compiling, organizing and analyzing of document collections to support the delivery of targeted types of information and to discover relationships between relevant facts.
  • identifying relevant content can be difficult.
  • Second, analyzing an unstructured document collection without the benefit of a priori knowledge in the form of keywords and indices can present a potentially intractable problem space.
  • synonymy and polysemy can cloud and confuse extracted content. Synonymy refers to multiple words having the same meaning and polysemy refers to a single word with multiple meanings. Fine-grained text mining must reconcile synonymy and polysemy to yield meaningful results.
  • Data clustering allows the concepts and themes to be developed more fully based on the extracted syntactic information.
  • a balanced set of clusters reflects terms and phrases from every document in a document set. Each document may be included in one or more clusters. Conversely, concepts and themes are preferably distributed over a meaningful range of clusters.
  • Creating an initial set of clusters from a document set is crucial to properly visualizing the semantic content.
  • a priori knowledge of semantic content is unavailable when forming clusters from unstructured documents.
  • the difficulty of creating an initial clusters set is compounded when evaluating different types of documents, such as electronic mail (email) and word processing documents, particularly when included in the same document set.
  • a related prior art clustering technique performs gap analysis in lieu of exhaustive matching. Gaps in the fit of points of data between successive passes are merged if necessary to form groups of documents into clusters.
  • gap analysis is computational inefficient, as multiple passes through a data set are necessary to effectively find a settled set of clusters.
  • the present invention provides a system and method for generating logical clusters of documents in a multi-dimensional concept space for modeling semantic meaning.
  • Each document in a set of unstructured documents is first analyzed for syntactic content by extracting literal terms and phrases.
  • the semantic content is then determined by modeling the extracted terms and phrases in multiple dimensions. Histograms of the frequency of occurrences of the terms and phrases in each document and over the entire document set are generated.
  • Related documents are identified by finding highly correlated term and phrase pairings. These pairings are then used to calculate Euclidean distances between individual documents. Those documents corresponding to concepts separated by a Euclidean distance falling within a predetermined variance are grouped into clusters by k-means clustering. The remaining documents are grouped into new clusters. The clusters can be used to visualize the semantic content.
  • An embodiment provides a computer-implemented system and method for forming document clusters for display.
  • Concepts are identified from a set of documents and a subset of the documents that include those concepts with frequencies of occurrence that occur within a range of concept frequencies are selected from the set.
  • the documents in the subset are assigned to clusters.
  • Each cluster includes a center and a radius, and is placed into a display with the center of that cluster at a fixed distance from the common origin. A portion of the placed clusters are further placed along a common vector.
  • FIG. 1 is a block diagram showing a system for efficiently generating cluster groupings in a multi-dimensional concept space, in accordance with the present invention.
  • FIG. 2 is a block diagram showing the software modules implementing the document analyzer of FIG. 1 .
  • FIG. 3 is a process flow diagram showing the stages of text analysis performed by the document analyzer of FIG. 1 .
  • FIG. 4 is a flow diagram showing a method for efficiently generating cluster groupings in a multi-dimensional concept space, in accordance with the present invention.
  • FIG. 5 is a flow diagram showing the routine for performing text analysis for use in the method of FIG. 4 .
  • FIG. 6 is a flow diagram showing the routine for creating a histogram for use in the routine of FIG. 5 .
  • FIG. 7 is a data structure diagram showing a database record for a concept stored in the database 30 of FIG. 1 .
  • FIG. 8 is a data structure diagram showing, by way of example, a database table containing a lexicon of extracted concepts stored in the database 30 of FIG. 1 .
  • FIG. 9 is a graph showing, by way of example, a histogram of the frequencies of concept occurrences generated by the routine of FIG. 6 .
  • FIG. 10 is a table showing, by way of example, concept occurrence frequencies generated by the routine of FIG. 6 .
  • FIG. 11 is a graph showing, by way of example, a corpus graph of the frequency of concept occurrences generated by the routine of FIG. 5 .
  • FIG. 12 is a flow diagram showing the routine for creating clusters for use in the routine of FIG. 5 .
  • FIG. 13 is a table showing, by way of example, the concept clusters created by the routine for FIG. 12 .
  • FIG. 14 is a data representation diagram showing, by way of example, a view of overlapping cluster generated by the system of FIG. 1 .
  • Keyword A literal search term which is either present or absent from a document. Keywords are not used in the evaluation of documents as described herein.
  • Term A root stem of a single word appearing in the body of at least one document.
  • Phrase Two or more words co-occurring in the body of a document.
  • a phrase can include stop words.
  • Theme Two or more concepts with a common semantic meaning.
  • Cluster All documents for a given concept or theme.
  • FIG. 1 is a block diagram showing a system 11 for efficiently generating cluster groupings in a multi-dimensional concept space, in accordance with the present invention.
  • the system 11 operates in a distributed computing environment 10 , which includes a plurality of heterogeneous systems and document sources.
  • the system 11 implements a document analyzer 12 , as further described below beginning with reference to FIG. 2 , for evaluating latent concepts in unstructured documents.
  • the system 11 is coupled to a storage device 13 , which stores a document warehouse 14 for maintaining a repository of documents and a database 30 for maintaining document information.
  • the document analyzer 12 analyzes documents retrieved from a plurality of local sources.
  • the local sources include documents 17 maintained in a storage device 16 coupled to a local server 15 and documents 20 maintained in a storage device 19 coupled to a local client 18 .
  • the local server 15 and local client 18 are interconnected to the system 11 over an intranetwork 21 .
  • the document analyzer 12 can identify and retrieve documents from remote sources over an internetwork 22 , including the Internet, through a gateway 23 interfaced to the intranetwork 21 .
  • the remote sources include documents 26 maintained in a storage device 25 coupled to a remote server 24 and documents 29 maintained in a storage device 28 coupled to a remote client 27 .
  • the individual documents 17 , 20 , 26 , 29 include all forms and types of unstructured data, including electronic message stores, such as electronic mail (email) folders, word processing documents or Hypertext documents, and could also include graphical or multimedia data. Notwithstanding, the documents could be in the form of structured data, such as stored in a spreadsheet or database. Content mined from these types of documents does not require preprocessing, as described below.
  • the individual documents 17 , 20 , 26 , 29 include electronic message folders, such as maintained by the Outlook and Outlook Express products, licensed by Microsoft Corporation, Redmond, Wash.
  • the database is an SQL-based relational database, such as the Oracle database management system, release 8 , licensed by Oracle Corporation, Redwood Shores, Calif.
  • the individual computer systems including system 11 , server 15 , client 18 , remote server 24 and remote client 27 , are general purpose, programmed digital computing devices consisting of a central processing unit (CPU), random access memory (RAM), non-volatile secondary storage, such as a hard drive or CD ROM drive, network interfaces, and peripheral devices, including user interfacing means, such as a keyboard and display.
  • Program code including software programs, and data are loaded into the RAM for execution and processing by the CPU and results are generated for display, output, transmittal, or storage.
  • FIG. 2 is a block diagram showing the software modules 40 implementing the document analyzer 12 of FIG. 1 .
  • the document analyzer 12 includes three modules: storage and retrieval manager 41 , text analyzer 42 , and display and visualization 44 .
  • the storage and retrieval manager 41 identifies and retrieves documents 45 into the document warehouse 14 (shown in FIG. 1 ).
  • the documents 45 are retrieved from various sources, including both local and remote clients and server stores.
  • the text analyzer 42 performs the bulk of the text mining processing.
  • the cluster 43 generates clusters 49 of highly correlated documents, as further described below with reference to FIG. 12 .
  • the display and visualization 44 complements the operations performed by the text analyzer 42 by presenting visual representations of the information extracted from the documents 45 .
  • the display and visualization 44 can also generate a graphical representation which preserves independent variable relationships, such as described in common-assigned U.S. Pat. No. 6,888,548, issued May 3, 2005, the disclosure of which is incorporated by reference.
  • the text analyzer 42 identifies terms and phrases and extracts concepts in the form of noun phrases that are stored in a lexicon 18 maintained in the database 30 . After normalizing the extracted concepts, the text analyzer 42 generates a frequency table 47 of concept occurrences, as further described below with reference to FIG. 6 , and a matrix 48 of summations of the products of pair-wise terms, as further described below with reference to FIG. 10 .
  • the cluster 43 generates logical clusters 49 of documents in a multi-dimensional concept space for modeling semantic meaning.
  • the display and visualization 44 generates a histogram 50 of concept occurrences per document, as further described below with reference to FIG. 6 , and a corpus graph 51 of concept occurrences over all documents, as further described below with reference to FIG. 8 .
  • Each module is a computer program, procedure or module written as source code in a conventional programming language, such as the C++ programming language, and is presented for execution by the CPU as object or byte code, as is known in the art.
  • the various implementations of the source code and object and byte codes can be held on a computer-readable storage medium or embodied on a transmission medium in a carrier wave.
  • the document analyzer 12 operates in accordance with a sequence of process steps, as further described below with reference to FIG. 5 .
  • FIG. 3 is a process flow diagram showing the stages 60 of text analysis performed by the document analyzer 12 of FIG. 1 .
  • the individual documents 45 are preprocessed and noun phrases are extracted as concepts (transition 61 ) into a lexicon 46 .
  • the noun phrases are normalized and queried (transition 62 ) to generate a frequency table 47 .
  • the frequency table 47 identifies individual concepts and their respective frequency of occurrence within each document 45 .
  • the frequencies of concept occurrences are visualized (transition 63 ) into a frequency of concepts histogram 50 .
  • the histogram 50 graphically displays the frequencies of occurrence of each concept on a per-document basis.
  • FIG. 4 is a flow diagram showing a method 70 for efficiently generating cluster groupings in a multi-dimensional concept space 44 (shown in FIG. 2 ), in accordance with the present invention.
  • the set of documents 45 to be analyzed is identified (block 71 ) and retrieved into the document warehouse 14 (shown in FIG. 1 ) (block 72 ).
  • the documents 45 are unstructured data and lack a common format or shared type.
  • the documents 45 include electronic messages stored in messaging folders, word processing documents, hypertext documents, and the like.
  • the set of documents 45 is analyzed (block 73 ), as further described below with reference to FIG. 5 .
  • a matrix 48 shown in FIG. 2 ) of term-document association data is constructed to summarize the semantic content inherent in the structure of the documents 45 .
  • the semantic content is represented by groups of clusters of highly correlated documents generated through k-means clustering.
  • the frequency of individual terms or phrases extracted from the documents 45 are displayed and the results, including the clusters 43 , are optionally visualized (block 74 ), as further described below with reference to FIG. 14 .
  • the routine then terminates.
  • FIG. 5 is a flow diagram showing the routine 80 for performing text analysis for use in the method 70 of FIG. 4 .
  • the purpose of this routine is to extract and index terms or phrases for the set of documents 45 (shown in FIG. 2 ).
  • each document in the documents set 44 is preprocessed (block 81 ) to remove stop words.
  • stop words include commonly occurring words, such as indefinite articles (“a” and “an”), definite articles (“the”), pronouns (“I”, “he” and “she”), connectors (“and” and “or”), and similar non-substantive words.
  • a histogram 50 of the frequency of terms (shown in FIG. 2 ) is logically created for each document 45 (block 82 ), as further described below with reference to FIG. 6 .
  • Each histogram 50 maps the relative frequency of occurrence of each extracted term on a per-document basis.
  • a document reference frequency (corpus) graph 51 is created for all documents 45 (block 83 ).
  • the corpus graph 51 graphically maps the semantically-related concepts for the entire documents set 44 based on terms and phrases.
  • a subset of the corpus is selected by removing those terms and phrases falling outside either edge of predefined thresholds (block 84 ). For shorter documents, such as email, having less semantically-rich content, the thresholds are set from about 1% to about 15%, inclusive. Larger documents may require tighter threshold values.
  • the selected set of terms and phrases falling within the thresholds are used to generate themes (and concepts) (block 85 ) based on correlations between normalized terms and phrases in the documents set.
  • themes are primarily used, rather than individual concepts, as a single co-occurrence of terms or phrases carries less semantic meaning than multiple co-occurrences.
  • any reference to a “theme” or “concept” will be understood to include the other term, except as specifically indicated otherwise.
  • clusters of concepts and themes are created (block 86 ) from groups of highly-correlated terms and phrases, as further described below with reference to FIG. 12 .
  • the routine then returns.
  • FIG. 6 is a flow diagram showing the routine 90 for creating a histogram 50 (shown in FIG. 2 ) for use in the routine of FIG. 5 .
  • the purpose of this routine is to extract noun phrases representing individual concepts and to create a normalized representation of the occurrences of the concepts on a per-document basis.
  • the histogram represents the logical union of the terms and phrases extracted from each document.
  • the histogram 48 need not be expressly visualized, but is generated internally as part of the text analysis process.
  • noun phrases are extracted (block 91 ) from each document 45 .
  • concepts are defined on the basis of the extracted noun phrases, although individual nouns or tri-grams (word triples) could be used in lieu of noun phrases.
  • the noun phrases are extracted using the LinguistX product licensed by Inxight Software, Inc., Santa Clara, Calif.
  • the individual terms or phrases are loaded into records stored in the database 30 (shown in FIG. 1 ) (block 92 ).
  • the terms stored in the database 30 are normalized (block 93 ) such that each concept appears as a record only once.
  • the records are normalized into third normal form, although other normalization schemas could be used.
  • FIG. 7 is a data structure diagram showing a database record 100 for a concept stored in the database 30 of FIG. 1 .
  • Each database record 100 includes fields for storing an identifier 101 , string 102 and frequency 103 .
  • the identifier 101 is a monotonically increasing integer value that uniquely identifies each term or phrase stored as the string 102 in each record 100 .
  • the frequency of occurrence of each term or phrase is tallied in the frequency 103 .
  • FIG. 8 is a data structure diagram showing, by way of example, a database table 110 containing a lexicon 111 of extracted concepts stored in the database 30 of FIG. 1 .
  • the lexicon 111 maps out the individual occurrences of identified terms 113 extracted for any given document 112 .
  • the document 112 includes three terms numbered 1 , 3 and 5 .
  • Concept 1 occurs once in document 112
  • concept 3 occurs twice
  • concept 5 occurs once.
  • the lexicon tallies and represents the occurrences of frequency of the concepts 1 , 3 and 5 across all documents 45 .
  • a frequency table is created from the lexicon 111 for each given document 45 (block 94 ).
  • the frequency table is sorted in order of decreasing frequencies of occurrence for each concept 113 found in a given document 45 . In the described embodiment, all terms and phrases occurring just once in a given document are removed as not relevant to semantic content.
  • the frequency table is then used to generate a histogram 50 (shown in FIG. 2 ) (block 95 ) which visualizes the frequencies of occurrence of extracted concepts in each document. The routine then returns.
  • FIG. 9 is a graph showing, by way of example, a histogram 50 of the frequencies of concept occurrences generated by the routine of FIG. 6 .
  • the x-axis defines the individual concepts 121 for each document and the y-axis defines the frequencies of occurrence of each concept 122 .
  • the concepts are mapped in order of decreasing frequency 123 to generate a curve 124 representing the semantic content of the document 45 . Accordingly, terms or phrases appearing on the increasing end of the curve 124 have a high frequency of occurrence while concepts appearing on the descending end of the curve 124 have a low frequency of occurrence.
  • FIG. 10 is a table 130 showing, by way of example, concept occurrence frequencies generated by the routine of FIG. 6 .
  • Each concept 131 is mapped against the total frequency occurrence 132 for the entire set of documents 45 .
  • a cumulative frequency 134 is tallied.
  • the corpus table 130 is used to generate the document concept frequency reference (corpus) graph 51 .
  • FIG. 11 is a graph 140 showing, by way of example, a corpus graph of the frequency of concept occurrences generated by the routine of FIG. 5 .
  • the graph 140 visualizes the extracted concepts as tallied in the corpus table 130 (shown in FIG. 10 ).
  • the x-axis defines the individual concepts 141 for all documents and the y-axis defines the number of documents 45 referencing each concept 142 .
  • the individual concepts are mapped in order of descending frequency of occurrence 143 to generate a curve 144 representing the latent semantics of the set of documents 45 .
  • a median value 145 is selected and edge conditions 146 a - b are established to discriminate between concepts which occur too frequently versus concepts which occur too infrequently. Those documents falling within the edge conditions 146 a - b form a subset of documents containing latent concepts.
  • the median value 145 is document-type dependent.
  • the upper edge condition 146 b is set to 70% and the 64 concepts immediately preceding the upper edge condition 146 b are selected, although other forms of threshold discrimination could also be used.
  • FIG. 12 is a flow diagram 150 showing the routine for creating clusters for use in the routine of FIG. 5 .
  • the purpose of this routine is to build a concept space over a document collection consisting of clusters 49 (shown in FIG. 2 ) of individual documents having semantically similar content. Initially, a single cluster is created and additional clusters are added using a k-mean clustering technique, as required by the document set. Those clusters falling outside a pre-determined variance are grouped into new clusters, such that every document in the document set appears in at least one cluster and the concepts and themes contained therein are distributed over a meaningful range of clusters. The clusters are then visualized as a data representation, as further described below with reference to FIG. 14 .
  • Each cluster consists of a set of documents that share related terms and phrases as mapped in a multi-dimensional concept space. Those documents having identical terms and phrases mapped to a single cluster located along a vector at a distance (magnitude) d measured at an angle ⁇ from a common origin relative to the multi-dimensional concept space. Accordingly, a Euclidean distance between the individual concepts can be determined and clusters created.
  • a variance specifying an upper bound on Euclidean distances in the multi-dimensional concept space is determined (block 151 ).
  • a variance of five percent is specified, although other variance values, either greater or lesser than five percent, could be used as appropriate to the data profile.
  • an internal counter num_clusters is set to the initial value of 1 (block 152 ).
  • the documents and clusters are iteratively processed in a pair of nested processing loops (blocks 153 - 164 and 156 - 161 ).
  • each document i is processed (block 153 ) for every document in the document set.
  • Each document i is first selected (block 154 ) and the angle ⁇ relative to a common origin is computed (block 155 ).
  • the selected document i is compared to the existing set of clusters.
  • a cluster j is selected (block 157 ) and the angle ⁇ relative to the common origin is computed (block 158 ). Note the angle ⁇ must be recomputed regularly for each cluster j as documents are added or removed.
  • the difference between the angle ⁇ for the document i and the angle ⁇ for the cluster j is compared to the predetermined variance (block 159 ). If the difference is less than the predetermined variance (block 159 ), the document i is put into the cluster j (block 160 ) and the iterative processing loop (block 156 - 161 ) is terminated. If the difference is greater than or equal to the variance (block 159 ), the next cluster j is processed (block 161 ) and processing continues for each of the current clusters (blocks 156 - 161 ).
  • a new cluster is created (block 162 ) and the counter num_clusters is incremented (block 163 ). Processing continues with the next document i (block 164 ) until all documents have been processed (blocks 153 - 164 ).
  • the categorization of clusters is repeated (block 165 ) if necessary. In the described embodiment, the cluster categorization (blocks 153 - 164 ) is repeated at least once until the set of clusters settles. Finally, the clusters can be finalized (block 165 ) as an optional step. Finalization includes merging two or more clusters into a single cluster, splitting a single cluster into two or more clusters, removing minimal or outlier clusters, and similar operations, as would be recognized by one skilled in the art. The routine then returns.
  • FIG. 13 is a table 180 showing, by way of example, the concept clusters created by the routine 150 of FIG. 12 .
  • Each of the concepts 181 should appear in at least one of the clusters 182 , thereby insuring that each document appears in some cluster.
  • the Euclidean distances 183 a - d between the documents for a given concept are determined. Those Euclidean distances 183 a - d falling within a predetermined variance are assigned to each individual cluster 184 - 186 .
  • the table 180 can be used to visualize the clusters in a multi-dimensional concept space.
  • FIG. 14 is a data representation diagram 14 showing, by way of example, a view 191 of overlapping clusters 193 - 196 generated by the system of FIG. 1 .
  • Each cluster 193 - 196 has a center c 197 - 200 and radius r 201 - 204 , respectively, and is oriented around a common origin 192 .
  • the center c of each cluster 193 - 196 is located at a fixed distance d 205 - 208 from the common origin 192 .
  • Cluster 194 overlays cluster 193 and clusters 193 , 195 and 196 overlap.
  • Each cluster 193 - 196 represents multi-dimensional data modeled in a three-dimensional display space.
  • the data could be visualized data for a virtual semantic concept space, including semantic content extracted from a collection of documents represented by weighted clusters of concepts, such as described in commonly-assigned U.S. Pat. No. 6,978,274, issued Dec. 20, 2005, the disclosure of which is incorporated by reference.
  • each cluster 193 - 196 represents a grouping of points corresponding to documents sharing a common set of related terms and phrases.
  • the radii 201 - 204 of each cluster 193 - 196 reflect the relative number of documents contained in each cluster.
  • Those clusters 193 - 197 located along the same vector are similar in theme as are those clusters located on vectors having a small cosign rotation from each other.
  • each cluster 193 - 196 could be non-circular. At a minimum, however, each cluster 193 - 196 must have a center of mass and be oriented around the common origin 192 and must define a convex volume. Accordingly, other shapes defining each cluster 193 - 196 are feasible.

Abstract

A computer-implemented system and method for forming document clusters for display is provided. Concepts are identified from a set of documents and a subset of the documents that include those concepts with frequencies of occurrence that occur within a range of concept frequencies are selected from the set. The documents in the subset are assigned to clusters. Each cluster includes a center and a radius, and is placed into a display with the center of that cluster at a fixed distance from the common origin. A portion of the placed clusters are further placed along a common vector.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • This non-provisional patent application is a continuation of U.S. patent application Ser. No. 14/961,845, filed Dec. 7, 2015, pending, which is a continuation of U.S. Pat. No. 9,208,221, issued Dec. 8, 2015, which is a continuation of U.S. Pat. No. 8,650,190, issued Feb. 11, 2014, which is a continuation of U.S. Pat. No. 8,402,026, issued Mar. 19, 2013, which is a continuation of U.S. Pat. No. 6,778,995, issued Aug. 17, 2004, the priority dates of which are claimed and the disclosures of which are incorporated by reference.
  • FIELD OF THE INVENTION
  • The present invention relates in general to text mining and, in particular, to a computer-implemented system and method for forming document clusters for display.
  • BACKGROUND OF THE INVENTION
  • Document warehousing extends data warehousing to content mining and retrieval. Document warehousing attempts to extract semantic information from collections of unstructured documents to provide conceptual information with a high degree of precision and recall. Documents in a document warehouse share several properties. First, the documents lack a common structure or shared type. Second, semantically-related documents are integrated through text mining. Third, essential document features are extracted and explicitly stored as part of the document warehouse. Finally, documents are often retrieved from multiple and disparate sources, such as over the Internet or as electronic messages.
  • Document warehouses are built in stages to deal with a wide range of information sources. First, document sources are identified and documents are retrieved into a repository. For example, the document sources could be electronic messaging folders or Web content retrieved over the Internet. Once retrieved, the documents are pre-processed to format and regularize the information into a consistent manner. Next, during text analysis, text mining is performed to extract semantic content, including identifying dominant themes, extracting key features and summarizing the content. Finally, metadata is compiled from the semantic context to explicate essential attributes. Preferably, the metadata is provided in a format amenable to normalized queries, such as database management tools. Document warehousing is described in D. Sullivan, “Document Warehousing and Text Mining, Techniques for Improving Business Operations, Marketing, and Sales,” Chs. 1-3, Wiley Computer Publishing (2001), the disclosure of which is incorporated by reference.
  • Text mining is at the core of the data warehousing process. Text mining involves the compiling, organizing and analyzing of document collections to support the delivery of targeted types of information and to discover relationships between relevant facts. However, identifying relevant content can be difficult. First, extracting relevant content requires a high degree of precision and recall. Precision is the measure of how well the documents returned in response to a query actually address the query criteria. Recall is the measure of what should have been returned by the query. Typically, the broader and less structured the documents, the lower the degree of precision and recall. Second, analyzing an unstructured document collection without the benefit of a priori knowledge in the form of keywords and indices can present a potentially intractable problem space. Finally, synonymy and polysemy can cloud and confuse extracted content. Synonymy refers to multiple words having the same meaning and polysemy refers to a single word with multiple meanings. Fine-grained text mining must reconcile synonymy and polysemy to yield meaningful results.
  • In particular, the transition from syntactic to semantic content analysis requires a shift in focus from the grammatical level to the meta level. At a syntactic level, documents are viewed structurally as sentences comprising individual terms and phrases. In contrast, at a semantic level, documents are viewed in terms of meaning. Terms and phrases are grouped into clusters representing individual concepts and themes.
  • Data clustering allows the concepts and themes to be developed more fully based on the extracted syntactic information. A balanced set of clusters reflects terms and phrases from every document in a document set. Each document may be included in one or more clusters. Conversely, concepts and themes are preferably distributed over a meaningful range of clusters.
  • Creating an initial set of clusters from a document set is crucial to properly visualizing the semantic content. Generally, a priori knowledge of semantic content is unavailable when forming clusters from unstructured documents. The difficulty of creating an initial clusters set is compounded when evaluating different types of documents, such as electronic mail (email) and word processing documents, particularly when included in the same document set.
  • In the prior art, several data clustering techniques are known. Exhaustive matching techniques fit each document into one of a pre-defined and fixed number of clusters using a closest-fit approach. However, this approach forces an arbitrary number of clusters onto a document set and can skew the meaning of the semantic content mined from the document set.
  • A related prior art clustering technique performs gap analysis in lieu of exhaustive matching. Gaps in the fit of points of data between successive passes are merged if necessary to form groups of documents into clusters. However, gap analysis is computational inefficient, as multiple passes through a data set are necessary to effectively find a settled set of clusters.
  • Therefore, there is a need for an approach to forming clusters of concepts and themes into groupings of classes with shared semantic meanings. Such an approach would preferably categorize concepts mined from a document set into clusters defined within a pre-specified range of variance. Moreover, such an approach would not require a priori knowledge of the data content.
  • SUMMARY OF THE INVENTION
  • The present invention provides a system and method for generating logical clusters of documents in a multi-dimensional concept space for modeling semantic meaning. Each document in a set of unstructured documents is first analyzed for syntactic content by extracting literal terms and phrases. The semantic content is then determined by modeling the extracted terms and phrases in multiple dimensions. Histograms of the frequency of occurrences of the terms and phrases in each document and over the entire document set are generated. Related documents are identified by finding highly correlated term and phrase pairings. These pairings are then used to calculate Euclidean distances between individual documents. Those documents corresponding to concepts separated by a Euclidean distance falling within a predetermined variance are grouped into clusters by k-means clustering. The remaining documents are grouped into new clusters. The clusters can be used to visualize the semantic content.
  • An embodiment provides a computer-implemented system and method for forming document clusters for display. Concepts are identified from a set of documents and a subset of the documents that include those concepts with frequencies of occurrence that occur within a range of concept frequencies are selected from the set. The documents in the subset are assigned to clusters. Each cluster includes a center and a radius, and is placed into a display with the center of that cluster at a fixed distance from the common origin. A portion of the placed clusters are further placed along a common vector.
  • Still other embodiments of the present invention will become readily apparent to those skilled in the art from the following detailed description, wherein is described embodiments of the invention by way of illustrating the best mode contemplated for carrying out the invention. As will be realized, the invention is capable of other and different embodiments and its several details are capable of modifications in various obvious respects, all without departing from the spirit and the scope of the present invention. Accordingly, the drawings and detailed description are to be regarded as illustrative in nature and not as restrictive.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a block diagram showing a system for efficiently generating cluster groupings in a multi-dimensional concept space, in accordance with the present invention.
  • FIG. 2 is a block diagram showing the software modules implementing the document analyzer of FIG. 1.
  • FIG. 3 is a process flow diagram showing the stages of text analysis performed by the document analyzer of FIG. 1.
  • FIG. 4 is a flow diagram showing a method for efficiently generating cluster groupings in a multi-dimensional concept space, in accordance with the present invention.
  • FIG. 5 is a flow diagram showing the routine for performing text analysis for use in the method of FIG. 4.
  • FIG. 6 is a flow diagram showing the routine for creating a histogram for use in the routine of FIG. 5.
  • FIG. 7 is a data structure diagram showing a database record for a concept stored in the database 30 of FIG. 1.
  • FIG. 8 is a data structure diagram showing, by way of example, a database table containing a lexicon of extracted concepts stored in the database 30 of FIG. 1.
  • FIG. 9 is a graph showing, by way of example, a histogram of the frequencies of concept occurrences generated by the routine of FIG. 6.
  • FIG. 10 is a table showing, by way of example, concept occurrence frequencies generated by the routine of FIG. 6.
  • FIG. 11 is a graph showing, by way of example, a corpus graph of the frequency of concept occurrences generated by the routine of FIG. 5.
  • FIG. 12 is a flow diagram showing the routine for creating clusters for use in the routine of FIG. 5.
  • FIG. 13 is a table showing, by way of example, the concept clusters created by the routine for FIG. 12.
  • FIG. 14 is a data representation diagram showing, by way of example, a view of overlapping cluster generated by the system of FIG. 1.
  • DETAILED DESCRIPTION Glossary
  • Keyword: A literal search term which is either present or absent from a document. Keywords are not used in the evaluation of documents as described herein.
  • Term: A root stem of a single word appearing in the body of at least one document.
  • Phrase: Two or more words co-occurring in the body of a document.
  • A phrase can include stop words.
  • Concept: A collection of terms or phrases with common semantic meanings.
  • Theme: Two or more concepts with a common semantic meaning.
  • Cluster: All documents for a given concept or theme.
  • The foregoing terms are used throughout this document and, unless indicated otherwise, are assigned the meanings presented above.
  • FIG. 1 is a block diagram showing a system 11 for efficiently generating cluster groupings in a multi-dimensional concept space, in accordance with the present invention. By way of illustration, the system 11 operates in a distributed computing environment 10, which includes a plurality of heterogeneous systems and document sources. The system 11 implements a document analyzer 12, as further described below beginning with reference to FIG. 2, for evaluating latent concepts in unstructured documents. The system 11 is coupled to a storage device 13, which stores a document warehouse 14 for maintaining a repository of documents and a database 30 for maintaining document information.
  • The document analyzer 12 analyzes documents retrieved from a plurality of local sources. The local sources include documents 17 maintained in a storage device 16 coupled to a local server 15 and documents 20 maintained in a storage device 19 coupled to a local client 18. The local server 15 and local client 18 are interconnected to the system 11 over an intranetwork 21. In addition, the document analyzer 12 can identify and retrieve documents from remote sources over an internetwork 22, including the Internet, through a gateway 23 interfaced to the intranetwork 21. The remote sources include documents 26 maintained in a storage device 25 coupled to a remote server 24 and documents 29 maintained in a storage device 28 coupled to a remote client 27.
  • The individual documents 17, 20, 26, 29 include all forms and types of unstructured data, including electronic message stores, such as electronic mail (email) folders, word processing documents or Hypertext documents, and could also include graphical or multimedia data. Notwithstanding, the documents could be in the form of structured data, such as stored in a spreadsheet or database. Content mined from these types of documents does not require preprocessing, as described below.
  • In the described embodiment, the individual documents 17, 20, 26, 29 include electronic message folders, such as maintained by the Outlook and Outlook Express products, licensed by Microsoft Corporation, Redmond, Wash. The database is an SQL-based relational database, such as the Oracle database management system, release 8, licensed by Oracle Corporation, Redwood Shores, Calif.
  • The individual computer systems, including system 11, server 15, client 18, remote server 24 and remote client 27, are general purpose, programmed digital computing devices consisting of a central processing unit (CPU), random access memory (RAM), non-volatile secondary storage, such as a hard drive or CD ROM drive, network interfaces, and peripheral devices, including user interfacing means, such as a keyboard and display. Program code, including software programs, and data are loaded into the RAM for execution and processing by the CPU and results are generated for display, output, transmittal, or storage.
  • FIG. 2 is a block diagram showing the software modules 40 implementing the document analyzer 12 of FIG. 1. The document analyzer 12 includes three modules: storage and retrieval manager 41, text analyzer 42, and display and visualization 44. The storage and retrieval manager 41 identifies and retrieves documents 45 into the document warehouse 14 (shown in FIG. 1). The documents 45 are retrieved from various sources, including both local and remote clients and server stores. The text analyzer 42 performs the bulk of the text mining processing. The cluster 43 generates clusters 49 of highly correlated documents, as further described below with reference to FIG. 12. The display and visualization 44 complements the operations performed by the text analyzer 42 by presenting visual representations of the information extracted from the documents 45. The display and visualization 44 can also generate a graphical representation which preserves independent variable relationships, such as described in common-assigned U.S. Pat. No. 6,888,548, issued May 3, 2005, the disclosure of which is incorporated by reference.
  • During text analysis, the text analyzer 42 identifies terms and phrases and extracts concepts in the form of noun phrases that are stored in a lexicon 18 maintained in the database 30. After normalizing the extracted concepts, the text analyzer 42 generates a frequency table 47 of concept occurrences, as further described below with reference to FIG. 6, and a matrix 48 of summations of the products of pair-wise terms, as further described below with reference to FIG. 10. The cluster 43 generates logical clusters 49 of documents in a multi-dimensional concept space for modeling semantic meaning. Similarly, the display and visualization 44 generates a histogram 50 of concept occurrences per document, as further described below with reference to FIG. 6, and a corpus graph 51 of concept occurrences over all documents, as further described below with reference to FIG. 8.
  • Each module is a computer program, procedure or module written as source code in a conventional programming language, such as the C++ programming language, and is presented for execution by the CPU as object or byte code, as is known in the art. The various implementations of the source code and object and byte codes can be held on a computer-readable storage medium or embodied on a transmission medium in a carrier wave. The document analyzer 12 operates in accordance with a sequence of process steps, as further described below with reference to FIG. 5.
  • FIG. 3 is a process flow diagram showing the stages 60 of text analysis performed by the document analyzer 12 of FIG. 1. The individual documents 45 are preprocessed and noun phrases are extracted as concepts (transition 61) into a lexicon 46. The noun phrases are normalized and queried (transition 62) to generate a frequency table 47. The frequency table 47 identifies individual concepts and their respective frequency of occurrence within each document 45. The frequencies of concept occurrences are visualized (transition 63) into a frequency of concepts histogram 50. The histogram 50 graphically displays the frequencies of occurrence of each concept on a per-document basis. Next, the frequencies of concept occurrences for all the documents 45 are assimilated (transition 64) into a corpus graph 51 that displays the overall counts of documents containing each of the extracted concepts. Finally, the most highly correlated terms and phrases from the extracted concepts are categorized (transition 65) into clusters 49.
  • FIG. 4 is a flow diagram showing a method 70 for efficiently generating cluster groupings in a multi-dimensional concept space 44 (shown in FIG. 2), in accordance with the present invention. As a preliminary step, the set of documents 45 to be analyzed is identified (block 71) and retrieved into the document warehouse 14 (shown in FIG. 1) (block 72). The documents 45 are unstructured data and lack a common format or shared type. The documents 45 include electronic messages stored in messaging folders, word processing documents, hypertext documents, and the like.
  • Once identified and retrieved, the set of documents 45 is analyzed (block 73), as further described below with reference to FIG. 5. During text analysis, a matrix 48 (shown in FIG. 2) of term-document association data is constructed to summarize the semantic content inherent in the structure of the documents 45. The semantic content is represented by groups of clusters of highly correlated documents generated through k-means clustering. As well, the frequency of individual terms or phrases extracted from the documents 45 are displayed and the results, including the clusters 43, are optionally visualized (block 74), as further described below with reference to FIG. 14. The routine then terminates.
  • FIG. 5 is a flow diagram showing the routine 80 for performing text analysis for use in the method 70 of FIG. 4. The purpose of this routine is to extract and index terms or phrases for the set of documents 45 (shown in FIG. 2). Preliminarily, each document in the documents set 44 is preprocessed (block 81) to remove stop words. These include commonly occurring words, such as indefinite articles (“a” and “an”), definite articles (“the”), pronouns (“I”, “he” and “she”), connectors (“and” and “or”), and similar non-substantive words.
  • Following preprocessing, a histogram 50 of the frequency of terms (shown in FIG. 2) is logically created for each document 45 (block 82), as further described below with reference to FIG. 6. Each histogram 50, as further described below with reference to FIG. 9, maps the relative frequency of occurrence of each extracted term on a per-document basis.
  • Next, a document reference frequency (corpus) graph 51, as further described below with reference to FIG. 10, is created for all documents 45 (block 83). The corpus graph 51 graphically maps the semantically-related concepts for the entire documents set 44 based on terms and phrases. A subset of the corpus is selected by removing those terms and phrases falling outside either edge of predefined thresholds (block 84). For shorter documents, such as email, having less semantically-rich content, the thresholds are set from about 1% to about 15%, inclusive. Larger documents may require tighter threshold values.
  • The selected set of terms and phrases falling within the thresholds are used to generate themes (and concepts) (block 85) based on correlations between normalized terms and phrases in the documents set. In the described embodiment, themes are primarily used, rather than individual concepts, as a single co-occurrence of terms or phrases carries less semantic meaning than multiple co-occurrences. As used herein, any reference to a “theme” or “concept” will be understood to include the other term, except as specifically indicated otherwise.
  • Next, clusters of concepts and themes are created (block 86) from groups of highly-correlated terms and phrases, as further described below with reference to FIG. 12. The routine then returns.
  • FIG. 6 is a flow diagram showing the routine 90 for creating a histogram 50 (shown in FIG. 2) for use in the routine of FIG. 5. The purpose of this routine is to extract noun phrases representing individual concepts and to create a normalized representation of the occurrences of the concepts on a per-document basis. The histogram represents the logical union of the terms and phrases extracted from each document. In the described embodiment, the histogram 48 need not be expressly visualized, but is generated internally as part of the text analysis process.
  • Initially, noun phrases are extracted (block 91) from each document 45. In the described embodiment, concepts are defined on the basis of the extracted noun phrases, although individual nouns or tri-grams (word triples) could be used in lieu of noun phrases. In the described embodiment, the noun phrases are extracted using the LinguistX product licensed by Inxight Software, Inc., Santa Clara, Calif.
  • Once extracted, the individual terms or phrases are loaded into records stored in the database 30 (shown in FIG. 1) (block 92). The terms stored in the database 30 are normalized (block 93) such that each concept appears as a record only once. In the described embodiment, the records are normalized into third normal form, although other normalization schemas could be used.
  • FIG. 7 is a data structure diagram showing a database record 100 for a concept stored in the database 30 of FIG. 1. Each database record 100 includes fields for storing an identifier 101, string 102 and frequency 103. The identifier 101 is a monotonically increasing integer value that uniquely identifies each term or phrase stored as the string 102 in each record 100. The frequency of occurrence of each term or phrase is tallied in the frequency 103.
  • FIG. 8 is a data structure diagram showing, by way of example, a database table 110 containing a lexicon 111 of extracted concepts stored in the database 30 of FIG. 1. The lexicon 111 maps out the individual occurrences of identified terms 113 extracted for any given document 112. By way of example, the document 112 includes three terms numbered 1, 3 and 5. Concept 1 occurs once in document 112, concept 3 occurs twice, and concept 5 occurs once. The lexicon tallies and represents the occurrences of frequency of the concepts 1, 3 and 5 across all documents 45.
  • Referring back to FIG. 6, a frequency table is created from the lexicon 111 for each given document 45 (block 94). The frequency table is sorted in order of decreasing frequencies of occurrence for each concept 113 found in a given document 45. In the described embodiment, all terms and phrases occurring just once in a given document are removed as not relevant to semantic content. The frequency table is then used to generate a histogram 50 (shown in FIG. 2) (block 95) which visualizes the frequencies of occurrence of extracted concepts in each document. The routine then returns.
  • FIG. 9 is a graph showing, by way of example, a histogram 50 of the frequencies of concept occurrences generated by the routine of FIG. 6. The x-axis defines the individual concepts 121 for each document and the y-axis defines the frequencies of occurrence of each concept 122. The concepts are mapped in order of decreasing frequency 123 to generate a curve 124 representing the semantic content of the document 45. Accordingly, terms or phrases appearing on the increasing end of the curve 124 have a high frequency of occurrence while concepts appearing on the descending end of the curve 124 have a low frequency of occurrence.
  • FIG. 10 is a table 130 showing, by way of example, concept occurrence frequencies generated by the routine of FIG. 6. Each concept 131 is mapped against the total frequency occurrence 132 for the entire set of documents 45. Thus, for each of the concepts 133, a cumulative frequency 134 is tallied. The corpus table 130 is used to generate the document concept frequency reference (corpus) graph 51.
  • FIG. 11 is a graph 140 showing, by way of example, a corpus graph of the frequency of concept occurrences generated by the routine of FIG. 5. The graph 140 visualizes the extracted concepts as tallied in the corpus table 130 (shown in FIG. 10). The x-axis defines the individual concepts 141 for all documents and the y-axis defines the number of documents 45 referencing each concept 142. The individual concepts are mapped in order of descending frequency of occurrence 143 to generate a curve 144 representing the latent semantics of the set of documents 45.
  • A median value 145 is selected and edge conditions 146 a-b are established to discriminate between concepts which occur too frequently versus concepts which occur too infrequently. Those documents falling within the edge conditions 146 a-b form a subset of documents containing latent concepts. In the described embodiment, the median value 145 is document-type dependent. For efficiency, the upper edge condition 146 b is set to 70% and the 64 concepts immediately preceding the upper edge condition 146 b are selected, although other forms of threshold discrimination could also be used.
  • FIG. 12 is a flow diagram 150 showing the routine for creating clusters for use in the routine of FIG. 5. The purpose of this routine is to build a concept space over a document collection consisting of clusters 49 (shown in FIG. 2) of individual documents having semantically similar content. Initially, a single cluster is created and additional clusters are added using a k-mean clustering technique, as required by the document set. Those clusters falling outside a pre-determined variance are grouped into new clusters, such that every document in the document set appears in at least one cluster and the concepts and themes contained therein are distributed over a meaningful range of clusters. The clusters are then visualized as a data representation, as further described below with reference to FIG. 14.
  • Each cluster consists of a set of documents that share related terms and phrases as mapped in a multi-dimensional concept space. Those documents having identical terms and phrases mapped to a single cluster located along a vector at a distance (magnitude) d measured at an angle θ from a common origin relative to the multi-dimensional concept space. Accordingly, a Euclidean distance between the individual concepts can be determined and clusters created.
  • Initially, a variance specifying an upper bound on Euclidean distances in the multi-dimensional concept space is determined (block 151). In the described embodiment, a variance of five percent is specified, although other variance values, either greater or lesser than five percent, could be used as appropriate to the data profile. As well, an internal counter num_clusters is set to the initial value of 1 (block 152).
  • The documents and clusters are iteratively processed in a pair of nested processing loops (blocks 153-164 and 156-161). During each iteration of the outer processing loop (blocks 153-164), each document i is processed (block 153) for every document in the document set. Each document i is first selected (block 154) and the angle θ relative to a common origin is computed (block 155).
  • During each iterative loop of the inner processing loop (block 156-161), the selected document i is compared to the existing set of clusters. Thus, a cluster j is selected (block 157) and the angle σ relative to the common origin is computed (block 158). Note the angle σ must be recomputed regularly for each cluster j as documents are added or removed. The difference between the angle θ for the document i and the angle σ for the cluster j is compared to the predetermined variance (block 159). If the difference is less than the predetermined variance (block 159), the document i is put into the cluster j (block 160) and the iterative processing loop (block 156-161) is terminated. If the difference is greater than or equal to the variance (block 159), the next cluster j is processed (block 161) and processing continues for each of the current clusters (blocks 156-161).
  • If the difference between the angle θ for the document i and the angle σ for each of the clusters exceeds the variance, a new cluster is created (block 162) and the counter num_clusters is incremented (block 163). Processing continues with the next document i (block 164) until all documents have been processed (blocks 153-164). The categorization of clusters is repeated (block 165) if necessary. In the described embodiment, the cluster categorization (blocks 153-164) is repeated at least once until the set of clusters settles. Finally, the clusters can be finalized (block 165) as an optional step. Finalization includes merging two or more clusters into a single cluster, splitting a single cluster into two or more clusters, removing minimal or outlier clusters, and similar operations, as would be recognized by one skilled in the art. The routine then returns.
  • FIG. 13 is a table 180 showing, by way of example, the concept clusters created by the routine 150 of FIG. 12. Each of the concepts 181 should appear in at least one of the clusters 182, thereby insuring that each document appears in some cluster. The Euclidean distances 183 a-d between the documents for a given concept are determined. Those Euclidean distances 183 a-d falling within a predetermined variance are assigned to each individual cluster 184-186. The table 180 can be used to visualize the clusters in a multi-dimensional concept space.
  • FIG. 14 is a data representation diagram 14 showing, by way of example, a view 191 of overlapping clusters 193-196 generated by the system of FIG. 1. Each cluster 193-196 has a center c 197-200 and radius r 201-204, respectively, and is oriented around a common origin 192. The center c of each cluster 193-196 is located at a fixed distance d 205-208 from the common origin 192. Cluster 194 overlays cluster 193 and clusters 193, 195 and 196 overlap.
  • Each cluster 193-196 represents multi-dimensional data modeled in a three-dimensional display space. The data could be visualized data for a virtual semantic concept space, including semantic content extracted from a collection of documents represented by weighted clusters of concepts, such as described in commonly-assigned U.S. Pat. No. 6,978,274, issued Dec. 20, 2005, the disclosure of which is incorporated by reference.
  • For each cluster 193, the radii r 201-204 and distances d 197-200 are independent variables relative to the other clusters 194-196 and the radius r 201 is an independent variable relative to the common origin 192. In this example, each cluster 193-196 represents a grouping of points corresponding to documents sharing a common set of related terms and phrases. The radii 201-204 of each cluster 193-196 reflect the relative number of documents contained in each cluster. Those clusters 193-197 located along the same vector are similar in theme as are those clusters located on vectors having a small cosign rotation from each other. Thus, the angle θ relative to a common axis' distance from a common origin 192 is an independent variable within a correlation between the distance d and angle θ relative similarity of theme. Although shown with respect to a circular shape, each cluster 193-196 could be non-circular. At a minimum, however, each cluster 193-196 must have a center of mass and be oriented around the common origin 192 and must define a convex volume. Accordingly, other shapes defining each cluster 193-196 are feasible.
  • While the invention has been particularly shown and described as referenced to the embodiments thereof, those skilled in the art will understand that the foregoing and other changes in form and detail may be made therein without departing from the spirit and scope of the invention.

Claims (20)

What is claimed is:
1. A computer-implemented system for forming document clusters for display, comprising:
a set of documents comprising concepts;
a server comprising memory, a central processing unit, an input port to receive the document set, and an output port, wherein the central processing unit is configured to:
select a subset of the documents from the set that include those concepts with frequencies of occurrence that occur within a range of concept frequencies;
assign the documents in the subset to clusters, each cluster comprising a center and a radius; and
place each cluster into a display with the center of that cluster at a fixed distance from the common origin, wherein a portion of the placed clusters are further placed along a common vector.
2. A system according to claim 1, wherein the central processing unit is further configured to apply tighter ranges of concept frequencies to larger documents than to shorter documents.
3. A system according to claim 1, wherein the central processing unit is further configured to form the clusters by creating an initial cluster and adding additional clusters.
4. A system according to claim 1, wherein the central processing unit is further configured to:
select a document from the subset and determine a location of the document from the common origin;
determine a location of one of the clusters from the common origin;
calculate a difference between the location of the document and the location of the cluster; and
apply a predetermined threshold to the calculated difference.
5. A system according to claim 4, wherein the central processing unit is further configured to place the selected document in the cluster when the difference is below the predetermined threshold.
6. A system according to claim 4, wherein the central processing unit is further configured to select a further cluster for comparison with the document when the difference is above the predetermined threshold.
7. A system according to claim 6, wherein the central processing unit is further configured to create a new cluster when the difference between the document and each cluster is above the predetermined threshold.
8. A system according to claim 1, wherein the central processing unit is further configured to:
merge two or more of the clusters into a single cluster;
split one of the clusters into two or more clusters, and
remove outlier clusters.
9. A system according to claim 1, wherein the radius of each cluster reflects a relative number of the documents included in that cluster.
10. A system according to claim 1, wherein each cluster comprises a center of mass and defines a convex volume.
11. A computer-implemented method for forming document clusters for display, comprising:
identifying concepts from a set of documents;
selecting a subset of the documents from the set that include those concepts with frequencies of occurrence that occur within a range of concept frequencies;
assigning the documents in the subset to clusters, each cluster comprising a center and a radius; and
placing each cluster into a display with the center of that cluster at a fixed distance from the common origin, wherein a portion of the placed clusters are further placed along a common vector.
12. A method according to claim 11, further comprising:
applying tighter ranges of concept frequencies to larger documents than to shorter documents.
13. A method according to claim 11, further comprising:
forming the clusters, comprising:
creating an initial cluster; and
adding additional clusters.
14. A method according to claim 11, further comprising:
selecting a document from the subset and determining a location of the document from the common origin;
determining a location of one of the clusters from the common origin;
calculating a difference between the location of the document and the location of the cluster; and
applying a predetermined threshold to the calculated difference.
15. A method according to claim 14, further comprising:
when the difference is below the predetermined threshold, placing the selected document in the cluster.
16. A method according to claim 14, further comprising:
when the difference is above the predetermined threshold, selecting a further cluster for comparison with the document.
17. A method according to claim 16, further comprising:
when the difference between the document and each cluster is above the predetermined threshold, creating a new cluster.
18. A method according to claim 11, further comprising:
merging two or more of the clusters into a single cluster;
splitting one of the clusters into two or more clusters, and
removing outlier clusters.
19. A method according to claim 11, wherein the radius of each cluster reflects a relative number of the documents included in that cluster.
20. A method according to claim 11, wherein each cluster comprises a center of mass and defines a convex volume.
US15/420,012 2001-08-31 2017-01-30 Computer-Implemented System And Method For Forming Document Clusters For Display Abandoned US20170262526A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US15/420,012 US20170262526A1 (en) 2001-08-31 2017-01-30 Computer-Implemented System And Method For Forming Document Clusters For Display

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US09/943,918 US6778995B1 (en) 2001-08-31 2001-08-31 System and method for efficiently generating cluster groupings in a multi-dimensional concept space
US10/911,376 US8402026B2 (en) 2001-08-31 2004-08-03 System and method for efficiently generating cluster groupings in a multi-dimensional concept space
US13/831,565 US8650190B2 (en) 2001-08-31 2013-03-14 Computer-implemented system and method for generating a display of document clusters
US14/174,800 US9208221B2 (en) 2001-08-31 2014-02-06 Computer-implemented system and method for populating clusters of documents
US14/961,845 US9558259B2 (en) 2001-08-31 2015-12-07 Computer-implemented system and method for generating clusters for placement into a display
US15/420,012 US20170262526A1 (en) 2001-08-31 2017-01-30 Computer-Implemented System And Method For Forming Document Clusters For Display

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US14/961,845 Continuation US9558259B2 (en) 2001-08-31 2015-12-07 Computer-implemented system and method for generating clusters for placement into a display

Publications (1)

Publication Number Publication Date
US20170262526A1 true US20170262526A1 (en) 2017-09-14

Family

ID=32851381

Family Applications (6)

Application Number Title Priority Date Filing Date
US09/943,918 Expired - Lifetime US6778995B1 (en) 2001-08-31 2001-08-31 System and method for efficiently generating cluster groupings in a multi-dimensional concept space
US10/911,376 Active 2025-12-13 US8402026B2 (en) 2001-08-31 2004-08-03 System and method for efficiently generating cluster groupings in a multi-dimensional concept space
US13/831,565 Expired - Lifetime US8650190B2 (en) 2001-08-31 2013-03-14 Computer-implemented system and method for generating a display of document clusters
US14/174,800 Expired - Lifetime US9208221B2 (en) 2001-08-31 2014-02-06 Computer-implemented system and method for populating clusters of documents
US14/961,845 Expired - Fee Related US9558259B2 (en) 2001-08-31 2015-12-07 Computer-implemented system and method for generating clusters for placement into a display
US15/420,012 Abandoned US20170262526A1 (en) 2001-08-31 2017-01-30 Computer-Implemented System And Method For Forming Document Clusters For Display

Family Applications Before (5)

Application Number Title Priority Date Filing Date
US09/943,918 Expired - Lifetime US6778995B1 (en) 2001-08-31 2001-08-31 System and method for efficiently generating cluster groupings in a multi-dimensional concept space
US10/911,376 Active 2025-12-13 US8402026B2 (en) 2001-08-31 2004-08-03 System and method for efficiently generating cluster groupings in a multi-dimensional concept space
US13/831,565 Expired - Lifetime US8650190B2 (en) 2001-08-31 2013-03-14 Computer-implemented system and method for generating a display of document clusters
US14/174,800 Expired - Lifetime US9208221B2 (en) 2001-08-31 2014-02-06 Computer-implemented system and method for populating clusters of documents
US14/961,845 Expired - Fee Related US9558259B2 (en) 2001-08-31 2015-12-07 Computer-implemented system and method for generating clusters for placement into a display

Country Status (1)

Country Link
US (6) US6778995B1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111835917A (en) * 2020-07-14 2020-10-27 北京字节跳动网络技术有限公司 Method, device and equipment for showing activity range and computer readable medium
US11269812B2 (en) 2019-05-10 2022-03-08 International Business Machines Corporation Derived relationship for collaboration documents

Families Citing this family (146)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7617184B2 (en) * 2000-05-18 2009-11-10 Endeca Technologies, Inc. Scalable hierarchical data-driven navigation system and method for information retrieval
US7035864B1 (en) * 2000-05-18 2006-04-25 Endeca Technologies, Inc. Hierarchical data-driven navigation system and method for information retrieval
NZ522509A (en) * 2000-06-12 2004-09-24 Epredix Inc Computer-implemented system for human resources management
US7155668B2 (en) * 2001-04-19 2006-12-26 International Business Machines Corporation Method and system for identifying relationships between text documents and structured variables pertaining to the text documents
USRE46973E1 (en) * 2001-05-07 2018-07-31 Ureveal, Inc. Method, system, and computer program product for concept-based multi-dimensional analysis of unstructured information
US7308451B1 (en) 2001-09-04 2007-12-11 Stratify, Inc. Method and system for guided cluster based processing on prototypes
US7945600B1 (en) 2001-05-18 2011-05-17 Stratify, Inc. Techniques for organizing data to support efficient review and analysis
US7469246B1 (en) 2001-05-18 2008-12-23 Stratify, Inc. Method and system for classifying or clustering one item into multiple categories
US20030004996A1 (en) * 2001-06-29 2003-01-02 International Business Machines Corporation Method and system for spatial information retrieval for hyperlinked documents
US7487544B2 (en) * 2001-07-30 2009-02-03 The Trustees Of Columbia University In The City Of New York System and methods for detection of new malicious executables
US7657935B2 (en) * 2001-08-16 2010-02-02 The Trustees Of Columbia University In The City Of New York System and methods for detecting malicious email transmission
US6978274B1 (en) * 2001-08-31 2005-12-20 Attenex Corporation System and method for dynamically evaluating latent concepts in unstructured documents
US6778995B1 (en) * 2001-08-31 2004-08-17 Attenex Corporation System and method for efficiently generating cluster groupings in a multi-dimensional concept space
US7818797B1 (en) 2001-10-11 2010-10-19 The Trustees Of Columbia University In The City Of New York Methods for cost-sensitive modeling for intrusion detection and response
US8544087B1 (en) 2001-12-14 2013-09-24 The Trustess Of Columbia University In The City Of New York Methods of unsupervised anomaly detection using a geometric framework
US9306966B2 (en) 2001-12-14 2016-04-05 The Trustees Of Columbia University In The City Of New York Methods of unsupervised anomaly detection using a geometric framework
US20030120630A1 (en) * 2001-12-20 2003-06-26 Daniel Tunkelang Method and system for similarity search and clustering
US20030154181A1 (en) * 2002-01-25 2003-08-14 Nec Usa, Inc. Document clustering with cluster refinement and model selection capabilities
US7448084B1 (en) 2002-01-25 2008-11-04 The Trustees Of Columbia University In The City Of New York System and methods for detecting intrusions in a computer system by monitoring operating system registry accesses
US7225343B1 (en) * 2002-01-25 2007-05-29 The Trustees Of Columbia University In The City Of New York System and methods for adaptive model generation for detecting intrusions in computer systems
US7271804B2 (en) * 2002-02-25 2007-09-18 Attenex Corporation System and method for arranging concept clusters in thematic relationships in a two-dimensional visual display area
US20040049505A1 (en) * 2002-09-11 2004-03-11 Kelly Pennock Textual on-line analytical processing method and system
US7743061B2 (en) * 2002-11-12 2010-06-22 Proximate Technologies, Llc Document search method with interactively employed distance graphics display
US20040117366A1 (en) * 2002-12-12 2004-06-17 Ferrari Adam J. Method and system for interpreting multiple-term queries
US20050038781A1 (en) * 2002-12-12 2005-02-17 Endeca Technologies, Inc. Method and system for interpreting multiple-term queries
US6947933B2 (en) * 2003-01-23 2005-09-20 Verdasys, Inc. Identifying similarities within large collections of unstructured data
US6968256B2 (en) * 2003-08-15 2005-11-22 General Electric Company Method for processing manufactured parts
US7568109B2 (en) * 2003-09-11 2009-07-28 Ipx, Inc. System for software source code comparison
CA2484439A1 (en) * 2003-10-10 2005-04-10 Daniel Nicholas Crow Conceptualization of job candidate information
US7555441B2 (en) * 2003-10-10 2009-06-30 Kronos Talent Management Inc. Conceptualization of job candidate information
US7519565B2 (en) * 2003-11-03 2009-04-14 Cloudmark, Inc. Methods and apparatuses for classifying electronic documents
US20050149546A1 (en) * 2003-11-03 2005-07-07 Prakash Vipul V. Methods and apparatuses for determining and designating classifications of electronic documents
US7191175B2 (en) * 2004-02-13 2007-03-13 Attenex Corporation System and method for arranging concept clusters in thematic neighborhood relationships in a two-dimensional visual display space
US20060036451A1 (en) 2004-08-10 2006-02-16 Lundberg Steven W Patent mapping
US20060047722A1 (en) * 2004-09-01 2006-03-02 Walker Glenn A Metadata-based data storage in digital radio system
US9355651B2 (en) 2004-09-16 2016-05-31 Lena Foundation System and method for expressive language, developmental disorder, and emotion assessment
US9240188B2 (en) 2004-09-16 2016-01-19 Lena Foundation System and method for expressive language, developmental disorder, and emotion assessment
US10223934B2 (en) 2004-09-16 2019-03-05 Lena Foundation Systems and methods for expressive language, developmental disorder, and emotion assessment, and contextual feedback
US7716162B2 (en) * 2004-12-30 2010-05-11 Google Inc. Classification of ambiguous geographic references
US7606168B2 (en) * 2005-01-28 2009-10-20 Attenex Corporation Apparatus and method for message-centric analysis and multi-aspect viewing using social networks
US9092523B2 (en) * 2005-02-28 2015-07-28 Search Engine Technologies, Llc Methods of and systems for searching by incorporating user-entered information
US7739284B2 (en) * 2005-04-20 2010-06-15 International Business Machines Corporation Method and apparatus for processing data streams
CN100470544C (en) * 2005-05-24 2009-03-18 国际商业机器公司 Method, equipment and system for chaiming file
WO2006128183A2 (en) 2005-05-27 2006-11-30 Schwegman, Lundberg, Woessner & Kluth, P.A. Method and apparatus for cross-referencing important ip relationships
JP4815887B2 (en) * 2005-06-17 2011-11-16 日産自動車株式会社 Information processing apparatus and display apparatus for information processing
EP1913465A4 (en) 2005-07-27 2010-09-22 Schwegman Lundberg & Woessner Patent mapping
JP2007072528A (en) * 2005-09-02 2007-03-22 Internatl Business Mach Corp <Ibm> Method, program and device for analyzing document structure
US8312021B2 (en) * 2005-09-16 2012-11-13 Palo Alto Research Center Incorporated Generalized latent semantic analysis
US20070073625A1 (en) * 2005-09-27 2007-03-29 Shelton Robert H System and method of licensing intellectual property assets
US8019752B2 (en) * 2005-11-10 2011-09-13 Endeca Technologies, Inc. System and method for information retrieval from object collections with complex interrelationships
US7779007B2 (en) * 2006-06-08 2010-08-17 Ase Edge, Inc. Identifying content of interest
US8069032B2 (en) * 2006-07-27 2011-11-29 Microsoft Corporation Lightweight windowing method for screening harvested data for novelty
WO2008022289A2 (en) 2006-08-17 2008-02-21 Experian Information Services, Inc. System and method for providing a score for a used vehicle
US7904456B2 (en) * 2006-09-01 2011-03-08 Robert John Hennan Security monitoring tool for computer network
JP5011947B2 (en) * 2006-10-19 2012-08-29 オムロン株式会社 FMEA sheet creation method and FMEA sheet automatic creation apparatus
WO2008055034A2 (en) * 2006-10-30 2008-05-08 Noblis, Inc. Method and system for personal information extraction and modeling with fully generalized extraction contexts
US20080109454A1 (en) * 2006-11-03 2008-05-08 Willse Alan R Text analysis techniques
US8676802B2 (en) 2006-11-30 2014-03-18 Oracle Otc Subsidiary Llc Method and system for information retrieval with clustering
US8606666B1 (en) 2007-01-31 2013-12-10 Experian Information Solutions, Inc. System and method for providing an aggregation tool
US8280877B2 (en) * 2007-02-22 2012-10-02 Microsoft Corporation Diverse topic phrase extraction
US8285656B1 (en) 2007-03-30 2012-10-09 Consumerinfo.Com, Inc. Systems and methods for data verification
US8275681B2 (en) 2007-06-12 2012-09-25 Media Forum, Inc. Desktop extension for readily-sharable and accessible media playlist and media
US20090112533A1 (en) * 2007-10-31 2009-04-30 Caterpillar Inc. Method for simplifying a mathematical model by clustering data
US7856434B2 (en) 2007-11-12 2010-12-21 Endeca Technologies, Inc. System and method for filtering rules for manipulating search results in a hierarchical search and navigation system
US8069187B2 (en) * 2008-03-26 2011-11-29 The Go Daddy Group, Inc. Suggesting concept-based top-level domain names
US7962438B2 (en) * 2008-03-26 2011-06-14 The Go Daddy Group, Inc. Suggesting concept-based domain names
US20090248736A1 (en) * 2008-03-26 2009-10-01 The Go Daddy Group, Inc. Displaying concept-based targeted advertising
US7904445B2 (en) * 2008-03-26 2011-03-08 The Go Daddy Group, Inc. Displaying concept-based search results
US20090313363A1 (en) * 2008-06-17 2009-12-17 The Go Daddy Group, Inc. Hosting a remote computer in a hosting data center
US8312033B1 (en) 2008-06-26 2012-11-13 Experian Marketing Solutions, Inc. Systems and methods for providing an integrated identifier
US20100042589A1 (en) * 2008-08-15 2010-02-18 Smyros Athena A Systems and methods for topical searching
US20100131513A1 (en) 2008-10-23 2010-05-27 Lundberg Steven W Patent mapping
US8560161B1 (en) 2008-10-23 2013-10-15 Experian Information Solutions, Inc. System and method for monitoring and predicting vehicle attributes
US8639920B2 (en) 2009-05-11 2014-01-28 Experian Marketing Solutions, Inc. Systems and methods for providing anonymized user profile data
US8375032B2 (en) * 2009-06-25 2013-02-12 University Of Tennessee Research Foundation Method and apparatus for predicting object properties and events using similarity-based information retrieval and modeling
US8396870B2 (en) * 2009-06-25 2013-03-12 University Of Tennessee Research Foundation Method and apparatus for predicting object properties and events using similarity-based information retrieval and modeling
US8515957B2 (en) 2009-07-28 2013-08-20 Fti Consulting, Inc. System and method for displaying relationships between electronically stored information to provide classification suggestions via injection
CA3026879A1 (en) 2009-08-24 2011-03-10 Nuix North America, Inc. Generating a reference set for use during document review
EP2306339A1 (en) * 2009-09-23 2011-04-06 Adobe Systems Incorporated Algorith and implementation for fast computation of content recommendation
WO2011042889A1 (en) * 2009-10-09 2011-04-14 Mizrahi, Moshe A method, computer product program and system for analysis of data
CA2777506C (en) * 2009-10-15 2016-10-18 Rogers Communications Inc. System and method for grouping multiple streams of data
AU2010202901B2 (en) * 2010-07-08 2016-04-14 Patent Analytics Holding Pty Ltd A system, method and computer program for preparing data for analysis
US9152727B1 (en) 2010-08-23 2015-10-06 Experian Marketing Solutions, Inc. Systems and methods for processing consumer information for targeted marketing applications
US8892490B2 (en) * 2010-09-22 2014-11-18 Hewlett-Packard Development Company, L.P. Determining whether a point in a data stream is an outlier using hierarchical trees
US8484186B1 (en) 2010-11-12 2013-07-09 Consumerinfo.Com, Inc. Personalized people finder
US10977727B1 (en) 2010-11-18 2021-04-13 AUTO I.D., Inc. Web-based system and method for providing comprehensive vehicle build information
US11301922B2 (en) 2010-11-18 2022-04-12 AUTO I.D., Inc. System and method for providing comprehensive vehicle information
US9147042B1 (en) 2010-11-22 2015-09-29 Experian Information Solutions, Inc. Systems and methods for data verification
US9904726B2 (en) * 2011-05-04 2018-02-27 Black Hills IP Holdings, LLC. Apparatus and method for automated and assisted patent claim mapping and expense planning
CA2741212C (en) 2011-05-27 2020-12-08 Ibm Canada Limited - Ibm Canada Limitee Automated self-service user support based on ontology analysis
US9495352B1 (en) 2011-09-24 2016-11-15 Athena Ann Smyros Natural language determiner to identify functions of a device equal to a user manual
US8903712B1 (en) * 2011-09-27 2014-12-02 Nuance Communications, Inc. Call steering data tagging interface with automatic semantic clustering
US9940363B2 (en) 2011-10-03 2018-04-10 Black Hills Ip Holdings, Llc Systems, methods and user interfaces in a patent management system
US8738516B1 (en) 2011-10-13 2014-05-27 Consumerinfo.Com, Inc. Debt services candidate locator
EP2595065B1 (en) 2011-11-15 2019-08-14 Kairos Future Group AB Categorizing data sets
US9020947B2 (en) * 2011-11-30 2015-04-28 Microsoft Technology Licensing, Llc Web knowledge extraction for search task simplification
US9015160B2 (en) * 2011-12-14 2015-04-21 Brainspace Corporation Multi-concept latent semantic analysis queries
CA2767676C (en) * 2012-02-08 2022-03-01 Ibm Canada Limited - Ibm Canada Limitee Attribution using semantic analysis
CA2865184C (en) * 2012-05-15 2018-01-02 Whyz Technologies Limited Method and system relating to re-labelling multi-document clusters
US20140025687A1 (en) * 2012-07-17 2014-01-23 Koninklijke Philips N.V Analyzing a report
US9202298B2 (en) 2012-07-27 2015-12-01 Semantic Compaction Systems, Inc. System and method for effectively navigating polysemous symbols across a plurality of linked electronic screen overlays
US9654541B1 (en) 2012-11-12 2017-05-16 Consumerinfo.Com, Inc. Aggregating user web browsing data
US9697263B1 (en) 2013-03-04 2017-07-04 Experian Information Solutions, Inc. Consumer data request fulfillment system
US9122681B2 (en) 2013-03-15 2015-09-01 Gordon Villy Cormack Systems and methods for classifying electronic information using advanced active learning techniques
US9477777B2 (en) * 2013-03-15 2016-10-25 Rakuten, Inc. Method for analyzing and categorizing semi-structured data
US9424337B2 (en) 2013-07-09 2016-08-23 Sas Institute Inc. Number of clusters estimation
US9454602B2 (en) * 2013-08-29 2016-09-27 Accenture Global Services Limited Grouping semantically related natural language specifications of system requirements into clusters
US10102536B1 (en) 2013-11-15 2018-10-16 Experian Information Solutions, Inc. Micro-geographic aggregation system
US10019716B1 (en) * 2013-11-21 2018-07-10 Google Llc Method for feedback submission resolution
US9529851B1 (en) 2013-12-02 2016-12-27 Experian Information Solutions, Inc. Server architecture for electronic data quality processing
US10262362B1 (en) 2014-02-14 2019-04-16 Experian Information Solutions, Inc. Automatic generation of code for attributes
US9202178B2 (en) 2014-03-11 2015-12-01 Sas Institute Inc. Computerized cluster analysis framework for decorrelated cluster identification in datasets
US9501211B2 (en) 2014-04-17 2016-11-22 GoDaddy Operating Company, LLC User input processing for allocation of hosting server resources
US9660933B2 (en) 2014-04-17 2017-05-23 Go Daddy Operating Company, LLC Allocating and accessing hosting server resources via continuous resource availability updates
US20150309989A1 (en) * 2014-04-28 2015-10-29 Elwha LLC, a limited liability company of the State of Delaware Methods, systems, and devices for lexical classification, grouping, and analysis of documents and/or document corpora
CN105335368B (en) * 2014-06-06 2018-11-16 阿里巴巴集团控股有限公司 A kind of product clustering method and device
US10614100B2 (en) 2014-06-19 2020-04-07 International Business Machines Corporation Semantic merge of arguments
US10296616B2 (en) * 2014-07-31 2019-05-21 Splunk Inc. Generation of a search query to approximate replication of a cluster of events
US10824958B2 (en) * 2014-08-26 2020-11-03 Google Llc Localized learning from a global model
US10558719B2 (en) * 2014-10-30 2020-02-11 Quantifind, Inc. Apparatuses, methods and systems for insight discovery and presentation from structured and unstructured data
US10580054B2 (en) 2014-12-18 2020-03-03 Experian Information Solutions, Inc. System, method, apparatus and medium for simultaneously generating vehicle history reports and preapproved financing options
US10445374B2 (en) 2015-06-19 2019-10-15 Gordon V. Cormack Systems and methods for conducting and terminating a technology-assisted review
US10474672B2 (en) * 2015-08-25 2019-11-12 Schlafender Hase GmbH Software & Communications Method for comparing text files with differently arranged text sections in documents
US10083161B2 (en) 2015-10-15 2018-09-25 International Business Machines Corporation Criteria modification to improve analysis
US20170286868A1 (en) * 2016-03-31 2017-10-05 Ebay Inc. Preference clustering using distance and angular measurement
US10409867B1 (en) 2016-06-16 2019-09-10 Experian Information Solutions, Inc. Systems and methods of managing a database of alphanumeric values
US11321372B2 (en) * 2017-01-03 2022-05-03 The Johns Hopkins University Method and system for a natural language processing using data streaming
US11227001B2 (en) 2017-01-31 2022-01-18 Experian Information Solutions, Inc. Massive scale heterogeneous data ingestion and user resolution
US10733224B2 (en) 2017-02-07 2020-08-04 International Business Machines Corporation Automatic corpus selection and halting condition detection for semantic asset expansion
US9911211B1 (en) * 2017-04-13 2018-03-06 Quid, Inc. Lens-based user-interface for visualizations of graphs
US10789229B2 (en) 2017-06-13 2020-09-29 Microsoft Technology Licensing, Llc Determining a hierarchical concept tree using a large corpus of table values
US11210276B1 (en) 2017-07-14 2021-12-28 Experian Information Solutions, Inc. Database system for automated event analysis and detection
CN107463705A (en) * 2017-08-17 2017-12-12 陕西优百信息技术有限公司 A kind of data cleaning method
US10740398B2 (en) 2017-11-27 2020-08-11 International Business Machines Corporation Structuring incoherent nodes by superimposing on a base knowledge graph
US10592738B2 (en) 2017-12-01 2020-03-17 International Business Machines Corporation Cognitive document image digitalization
US10529357B2 (en) 2017-12-07 2020-01-07 Lena Foundation Systems and methods for automatic determination of infant cry and discrimination of cry from fussiness
US10657145B2 (en) 2017-12-18 2020-05-19 International Business Machines Corporation Clustering facets on a two-dimensional facet cube for text mining
US10740404B1 (en) 2018-03-07 2020-08-11 Experian Information Solutions, Inc. Database system for dynamically generating customized models
US10565181B1 (en) 2018-03-07 2020-02-18 Experian Information Solutions, Inc. Database system for dynamically generating customized models
US10963434B1 (en) 2018-09-07 2021-03-30 Experian Information Solutions, Inc. Data architecture for supporting multiple search models
US11157835B1 (en) 2019-01-11 2021-10-26 Experian Information Solutions, Inc. Systems and methods for generating dynamic models based on trigger events
US11880377B1 (en) 2021-03-26 2024-01-23 Experian Information Solutions, Inc. Systems and methods for entity resolution
CN113163464B (en) * 2021-04-23 2022-09-13 西安邮电大学 Wireless sensor network clustering routing method and system based on maximum between-class variance
CN113869378B (en) * 2021-09-13 2023-04-07 四川大学 Software system module partitioning method based on clustering and label propagation
US11734331B1 (en) * 2022-02-18 2023-08-22 Peakspan Capital Management, Llc Systems and methods to optimize search for emerging concepts
US20240031244A1 (en) * 2022-07-22 2024-01-25 Vmware, Inc Graph-based visualizations of network flows using entity clustering

Family Cites Families (192)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3416150A (en) 1965-08-02 1968-12-10 Data Disc Inc Magnetic recording disc cartridge
US3426210A (en) 1965-12-22 1969-02-04 Rca Corp Control circuit for automatically quantizing signals at desired levels
BE757866A (en) 1969-12-22 1971-04-01 Ibm MAGNETIC DISC MEMORY ELEMENT AND RECORDING APPARATUS IN USE
JPS6283787A (en) 1985-10-09 1987-04-17 株式会社日立製作所 Output control system for display screen
US4930077A (en) 1987-04-06 1990-05-29 Fan David P Information processing expert system for text analysis and predicting public opinion based information available to the public
US4893253A (en) * 1988-03-10 1990-01-09 Indiana University Foundation Method for analyzing intact capsules and tablets by near-infrared reflectance spectrometry
US5121338A (en) * 1988-03-10 1992-06-09 Indiana University Foundation Method for detecting subpopulations in spectral analysis
US5056021A (en) 1989-06-08 1991-10-08 Carolyn Ausborn Method and apparatus for abstracting concepts from natural language
US5860136A (en) 1989-06-16 1999-01-12 Fenner; Peter R. Method and apparatus for use of associated memory with large key spaces
US6089742A (en) 1989-11-01 2000-07-18 Warmerdam; Thomas P. H. Method and apparatus for controlling robots and the like using a bubble data hierarchy placed along a medial axis
US5477451A (en) * 1991-07-25 1995-12-19 International Business Machines Corp. Method and system for natural language translation
US5278980A (en) 1991-08-16 1994-01-11 Xerox Corporation Iterative technique for phrase query formation and an information retrieval system employing same
US5488725A (en) 1991-10-08 1996-01-30 West Publishing Company System of document representation retrieval by successive iterated probability sampling
US5442778A (en) 1991-11-12 1995-08-15 Xerox Corporation Scatter-gather: a cluster-based method and apparatus for browsing large document collections
AU3969093A (en) 1992-04-30 1993-11-29 Apple Computer, Inc. Method and apparatus for organizing information in a computer system
JP3364242B2 (en) 1992-07-03 2003-01-08 株式会社東芝 Link learning device for artificial neural networks
EP0615201B1 (en) 1993-03-12 2001-01-10 Kabushiki Kaisha Toshiba Document detection system using detection result presentation for facilitating user's comprehension
US5528735A (en) 1993-03-23 1996-06-18 Silicon Graphics Inc. Method and apparatus for displaying data within a three-dimensional information landscape
JPH0756933A (en) 1993-06-24 1995-03-03 Xerox Corp Method for retrieval of document
US6173275B1 (en) 1993-09-20 2001-01-09 Hnc Software, Inc. Representation and retrieval of images using context vectors derived from image information elements
US5619709A (en) * 1993-09-20 1997-04-08 Hnc, Inc. System and method of context vector generation and retrieval
US7251637B1 (en) 1993-09-20 2007-07-31 Fair Isaac Corporation Context vector generation and retrieval
US5675819A (en) 1994-06-16 1997-10-07 Xerox Corporation Document information retrieval using global word co-occurrence patterns
US5959699A (en) 1994-06-28 1999-09-28 Samsung Electronics Co., Ltd. Reception mode control in radio receivers for receiving both VSB and QAM digital television signals
US5619632A (en) 1994-09-14 1997-04-08 Xerox Corporation Displaying node-link structure with region of greater spacings and peripheral branches
US5758257A (en) * 1994-11-29 1998-05-26 Herz; Frederick System and method for scheduling broadcast of and access to video programs and other data using customer profiles
US5635929A (en) 1995-02-13 1997-06-03 Hughes Aircraft Company Low bit rate video encoder and decoder
US5724571A (en) 1995-07-07 1998-03-03 Sun Microsystems, Inc. Method and apparatus for generating query responses in a computer-based document retrieval system
US5844991A (en) 1995-08-07 1998-12-01 The Regents Of The University Of California Script identification from images using cluster-based templates
WO1997008604A2 (en) 1995-08-16 1997-03-06 Syracuse University Multilingual document retrieval system and method using semantic vector matching
US5737734A (en) 1995-09-15 1998-04-07 Infonautics Corporation Query word relevance adjustment in a search of an information retrieval system
US5799276A (en) * 1995-11-07 1998-08-25 Accent Incorporated Knowledge-based speech recognition system and methods having frame length computed based upon estimated pitch period of vocalic intervals
US5842203A (en) 1995-12-01 1998-11-24 International Business Machines Corporation Method and system for performing non-boolean search queries in a graphical user interface
US5862325A (en) 1996-02-29 1999-01-19 Intermind Corporation Computer-based communication system and method using metadata defining a control structure
US5867799A (en) * 1996-04-04 1999-02-02 Lang; Andrew K. Information system and method for filtering a massive flow of information entities to meet user information classification needs
US6026397A (en) * 1996-05-22 2000-02-15 Electronic Data Systems Corporation Data analysis system and method
US5794236A (en) 1996-05-29 1998-08-11 Lexis-Nexis Computer-based system for classifying documents into a hierarchy and linking the classifications to the hierarchy
US5864871A (en) 1996-06-04 1999-01-26 Multex Systems Information delivery system and method including on-line entitlements
US6453327B1 (en) 1996-06-10 2002-09-17 Sun Microsystems, Inc. Method and apparatus for identifying and discarding junk electronic mail
JP3540511B2 (en) 1996-06-18 2004-07-07 株式会社東芝 Electronic signature verification device
US5909677A (en) 1996-06-18 1999-06-01 Digital Equipment Corporation Method for determining the resemblance of documents
US5864846A (en) 1996-06-28 1999-01-26 Siemens Corporate Research, Inc. Method for facilitating world wide web searches utilizing a document distribution fusion strategy
US5920854A (en) 1996-08-14 1999-07-06 Infoseek Corporation Real-time document collection search engine with phrase indexing
US5857179A (en) 1996-09-09 1999-01-05 Digital Equipment Corporation Computer method and apparatus for clustering documents and automatic generation of cluster keywords
US6484168B1 (en) 1996-09-13 2002-11-19 Battelle Memorial Institute System for information discovery
US5870740A (en) 1996-09-30 1999-02-09 Apple Computer, Inc. System and method for improving the ranking of information retrieval results for short queries
US5950146A (en) 1996-10-04 1999-09-07 At & T Corp. Support vector method for function estimation
US5987446A (en) 1996-11-12 1999-11-16 U.S. West, Inc. Searching large collections of text using multiple search engines concurrently
US5966126A (en) 1996-12-23 1999-10-12 Szabo; Andrew J. Graphic user interface for database system
US6092059A (en) 1996-12-27 2000-07-18 Cognex Corporation Automatic classifier for real time inspection and classification
US5950189A (en) * 1997-01-02 1999-09-07 At&T Corp Retrieval system and method
US5924105A (en) 1997-01-27 1999-07-13 Michigan State University Method and product for determining salient features for use in information searching
US6137499A (en) 1997-03-07 2000-10-24 Silicon Graphics, Inc. Method, system, and computer program product for visualizing data using partial hierarchies
US5819258A (en) * 1997-03-07 1998-10-06 Digital Equipment Corporation Method and apparatus for automatically generating hierarchical categories from large document collections
US5940821A (en) 1997-05-21 1999-08-17 Oracle Corporation Information presentation in a knowledge base search and retrieval system
US6460034B1 (en) 1997-05-21 2002-10-01 Oracle Corporation Document knowledge base research and retrieval system
US6148102A (en) * 1997-05-29 2000-11-14 Adobe Systems Incorporated Recognizing text in a multicolor image
US6137911A (en) * 1997-06-16 2000-10-24 The Dialog Corporation Plc Test classification system and method
JPH1115759A (en) 1997-06-16 1999-01-22 Digital Equip Corp <Dec> Full text index type mail preserving device
GB9713019D0 (en) 1997-06-20 1997-08-27 Xerox Corp Linguistic search system
US6012053A (en) 1997-06-23 2000-01-04 Lycos, Inc. Computer system with user-controlled relevance ranking of search results
US6470307B1 (en) 1997-06-23 2002-10-22 National Research Council Of Canada Method and apparatus for automatically identifying keywords within a document
US6070133A (en) 1997-07-21 2000-05-30 Battelle Memorial Institute Information retrieval system utilizing wavelet transform
US6122628A (en) 1997-10-31 2000-09-19 International Business Machines Corporation Multidimensional data clustering and dimension reduction for indexing and searching
US6134541A (en) * 1997-10-31 2000-10-17 International Business Machines Corporation Searching multidimensional indexes using associated clustering and dimension reduction information
US6154219A (en) 1997-12-01 2000-11-28 Microsoft Corporation System and method for optimally placing labels on a map
US6389436B1 (en) 1997-12-15 2002-05-14 International Business Machines Corporation Enhanced hypertext categorization using hyperlinks
AU1907899A (en) 1997-12-22 1999-07-12 Accepted Marketing, Inc. E-mail filter and method thereof
US6094649A (en) 1997-12-22 2000-07-25 Partnet, Inc. Keyword searches of structured databases
US6449612B1 (en) 1998-03-17 2002-09-10 Microsoft Corporation Varying cluster number in a scalable clustering system for use with large databases
US6038574A (en) * 1998-03-18 2000-03-14 Xerox Corporation Method and apparatus for clustering a collection of linked documents using co-citation analysis
US6484196B1 (en) 1998-03-20 2002-11-19 Advanced Web Solutions Internet messaging system and method for use in computer networks
US6119124A (en) 1998-03-26 2000-09-12 Digital Equipment Corporation Method for clustering closely resembling data objects
US6418431B1 (en) 1998-03-30 2002-07-09 Microsoft Corporation Information retrieval and speech recognition based on language models
JPH11316779A (en) 1998-04-30 1999-11-16 Fujitsu Ltd Witness system
US6345243B1 (en) 1998-05-27 2002-02-05 Lionbridge Technologies, Inc. System, method, and product for dynamically propagating translations in a translation-memory system
US7209949B2 (en) 1998-05-29 2007-04-24 Research In Motion Limited System and method for synchronizing information between a host system and a mobile data communication device
US7266365B2 (en) 1998-05-29 2007-09-04 Research In Motion Limited System and method for delayed transmission of bundled command messages
US6438564B1 (en) 1998-06-17 2002-08-20 Microsoft Corporation Method for associating a discussion with a document
US6100901A (en) 1998-06-22 2000-08-08 International Business Machines Corporation Method and apparatus for cluster exploration and visualization
US6216123B1 (en) 1998-06-24 2001-04-10 Novell, Inc. Method and system for rapid retrieval in a full text indexing system
JP2000019556A (en) 1998-06-29 2000-01-21 Hitachi Ltd Liquid crystal display device
US6446061B1 (en) 1998-07-31 2002-09-03 International Business Machines Corporation Taxonomy generation for document collections
US6167368A (en) 1998-08-14 2000-12-26 The Trustees Of Columbia University In The City Of New York Method and system for indentifying significant topics of a document
US6243713B1 (en) 1998-08-24 2001-06-05 Excalibur Technologies Corp. Multimedia document retrieval by application of multimedia queries to a unified index of multimedia data for a plurality of multimedia data types
JP4032649B2 (en) 1998-08-24 2008-01-16 株式会社日立製作所 How to display multimedia information
US6414677B1 (en) 1998-09-14 2002-07-02 Microsoft Corporation Methods, apparatus and data structures for providing a user interface, which exploits spatial memory in three-dimensions, to objects and which visually groups proximally located objects
WO2000016209A1 (en) 1998-09-15 2000-03-23 Local2Me.Com, Inc. Dynamic matchingtm of users for group communication
JP3903610B2 (en) 1998-09-28 2007-04-11 富士ゼロックス株式会社 Search device, search method, and computer-readable recording medium storing search program
US6415283B1 (en) 1998-10-13 2002-07-02 Orack Corporation Methods and apparatus for determining focal points of clusters in a tree structure
US6480843B2 (en) 1998-11-03 2002-11-12 Nec Usa, Inc. Supporting web-query expansion efficiently using multi-granularity indexing and query processing
US6678705B1 (en) 1998-11-16 2004-01-13 At&T Corp. System for archiving electronic documents using messaging groupware
US6628304B2 (en) 1998-12-09 2003-09-30 Cisco Technology, Inc. Method and apparatus providing a graphical user interface for representing and navigating hierarchical networks
US6442592B1 (en) 1998-12-11 2002-08-27 Micro Computer Systems, Inc. Message center system
US6816175B1 (en) 1998-12-19 2004-11-09 International Business Machines Corporation Orthogonal browsing in object hierarchies
US6549957B1 (en) 1998-12-22 2003-04-15 International Business Machines Corporation Apparatus for preventing automatic generation of a chain reaction of messages if a prior extracted message is similar to current processed message
JP2000187668A (en) 1998-12-22 2000-07-04 Hitachi Ltd Grouping method and overlap excluding method
US6349307B1 (en) 1998-12-28 2002-02-19 U.S. Philips Corporation Cooperative topical servers with automatic prefiltering and routing
EP2178007A3 (en) 1999-01-26 2010-08-25 Xerox Corporation Multi-modal information access
US6922699B2 (en) 1999-01-26 2005-07-26 Xerox Corporation System and method for quantitatively representing data objects in vector space
US6598054B2 (en) * 1999-01-26 2003-07-22 Xerox Corporation System and method for clustering data objects in a collection
US6360227B1 (en) 1999-01-29 2002-03-19 International Business Machines Corporation System and method for generating taxonomies with applications to content-based recommendations
US6941325B1 (en) 1999-02-01 2005-09-06 The Trustees Of Columbia University Multimedia archive description scheme
WO2000046701A1 (en) * 1999-02-08 2000-08-10 Huntsman Ici Chemicals Llc Method for retrieving semantically distant analogies
US7277919B1 (en) 1999-03-19 2007-10-02 Bigfix, Inc. Relevance clause for computed relevance messaging
US6510406B1 (en) 1999-03-23 2003-01-21 Mathsoft, Inc. Inverse inference engine for high performance web search
US6862710B1 (en) 1999-03-23 2005-03-01 Insightful Corporation Internet navigation using soft hyperlinks
US6408294B1 (en) 1999-03-31 2002-06-18 Verizon Laboratories Inc. Common term optimization
US6496822B2 (en) 1999-04-12 2002-12-17 Micron Technology, Inc. Methods of providing computer systems with bundled access to restricted-access databases
US6377287B1 (en) 1999-04-19 2002-04-23 Hewlett-Packard Company Technique for visualizing large web-based hierarchical hyperbolic space with multi-paths
EP1049030A1 (en) 1999-04-28 2000-11-02 SER Systeme AG Produkte und Anwendungen der Datenverarbeitung Classification method and apparatus
US6629097B1 (en) 1999-04-28 2003-09-30 Douglas K. Keith Displaying implicit associations among items in loosely-structured data sets
NZ515293A (en) 1999-05-05 2004-04-30 West Publishing Company D Document-classification system, method and software
US6493703B1 (en) 1999-05-11 2002-12-10 Prophet Financial Systems System and method for implementing intelligent online community message board
US6606625B1 (en) 1999-06-03 2003-08-12 University Of Southern California Wrapper induction by hierarchical data analysis
US6611825B1 (en) 1999-06-09 2003-08-26 The Boeing Company Method and system for text mining using multidimensional subspaces
US6701305B1 (en) 1999-06-09 2004-03-02 The Boeing Company Methods, apparatus and computer program products for information retrieval and document classification utilizing a multidimensional subspace
US6711585B1 (en) 1999-06-15 2004-03-23 Kanisa Inc. System and method for implementing a knowledge management system
US6438537B1 (en) 1999-06-22 2002-08-20 Microsoft Corporation Usage based aggregation optimization
US6389433B1 (en) 1999-07-16 2002-05-14 Microsoft Corporation Method and system for automatically merging files into a single instance store
US6415171B1 (en) 1999-07-16 2002-07-02 International Business Machines Corporation System and method for fusing three-dimensional shape data on distorted images without correcting for distortion
US7240199B2 (en) 2000-12-06 2007-07-03 Rpost International Limited System and method for verifying delivery and integrity of electronic messages
AU764415B2 (en) 1999-08-06 2003-08-21 Lexis-Nexis System and method for classifying legal concepts using legal topic scheme
US6523063B1 (en) 1999-08-30 2003-02-18 Zaplet, Inc. Method system and program product for accessing a file using values from a redirect message string for each change of the link identifier
US6651057B1 (en) 1999-09-03 2003-11-18 Bbnt Solutions Llc Method and apparatus for score normalization for information retrieval applications
US6260038B1 (en) 1999-09-13 2001-07-10 International Businemss Machines Corporation Clustering mixed attribute patterns
US6990238B1 (en) 1999-09-30 2006-01-24 Battelle Memorial Institute Data processing, analysis, and visualization system for use with disparate data types
US6544123B1 (en) 1999-10-29 2003-04-08 Square Co., Ltd. Game apparatus, command input method for video game and computer-readable recording medium recording programs for realizing the same
US7130807B1 (en) 1999-11-22 2006-10-31 Accenture Llp Technology sharing during demand and supply planning in a network-based supply chain environment
US6507847B1 (en) 1999-12-17 2003-01-14 Openwave Systems Inc. History database structure for Usenet
US6751621B1 (en) * 2000-01-27 2004-06-15 Manning & Napier Information Services, Llc. Construction of trainable semantic vectors and clustering, classification, and searching using trainable semantic vectors
US6542889B1 (en) 2000-01-28 2003-04-01 International Business Machines Corporation Methods and apparatus for similarity text search based on conceptual indexing
US6654739B1 (en) 2000-01-31 2003-11-25 International Business Machines Corporation Lightweight document clustering
US6571225B1 (en) 2000-02-11 2003-05-27 International Business Machines Corporation Text categorizers based on regularizing adaptations of the problem of computing linear separators
US7412462B2 (en) 2000-02-18 2008-08-12 Burnside Acquisition, Llc Data repository and method for promoting network storage of data
US7117246B2 (en) 2000-02-22 2006-10-03 Sendmail, Inc. Electronic mail system with methodology providing distributed message store
JP2003528377A (en) 2000-03-17 2003-09-24 ビジブル. コム インコーポレーティッド 3D space user interface
US6560597B1 (en) 2000-03-21 2003-05-06 International Business Machines Corporation Concept decomposition using clustering
US6757646B2 (en) 2000-03-22 2004-06-29 Insightful Corporation Extended functionality for an inverse inference engine based web search
US6785679B1 (en) 2000-03-29 2004-08-31 Brassring, Llc Method and apparatus for sending and tracking resume data sent via URL
US6915308B1 (en) 2000-04-06 2005-07-05 Claritech Corporation Method and apparatus for information mining and filtering
US7325127B2 (en) 2000-04-25 2008-01-29 Secure Data In Motion, Inc. Security server system
US6584564B2 (en) 2000-04-25 2003-06-24 Sigaba Corporation Secure e-mail system
US7698167B2 (en) 2000-04-28 2010-04-13 Computer Pundits, Inc. Catalog building method and system
US6879332B2 (en) 2000-05-16 2005-04-12 Groxis, Inc. User interface for displaying and exploring hierarchical information
US6883001B2 (en) 2000-05-26 2005-04-19 Fujitsu Limited Document information search apparatus and method and recording medium storing document information search program therein
US6519580B1 (en) 2000-06-08 2003-02-11 International Business Machines Corporation Decision-tree-based symbolic rule induction system for text categorization
US6697998B1 (en) 2000-06-12 2004-02-24 International Business Machines Corporation Automatic labeling of unlabeled text data
US20020078090A1 (en) 2000-06-30 2002-06-20 Hwang Chung Hee Ontological concept-based, user-centric text summarization
US7490092B2 (en) 2000-07-06 2009-02-10 Streamsage, Inc. Method and system for indexing and searching timed media information based upon relevance intervals
US6738759B1 (en) 2000-07-07 2004-05-18 Infoglide Corporation, Inc. System and method for performing similarity searching using pointer optimization
JP2002041544A (en) 2000-07-25 2002-02-08 Toshiba Corp Text information analyzing device
US6675159B1 (en) 2000-07-27 2004-01-06 Science Applic Int Corp Concept-based search and retrieval system
US20020032735A1 (en) 2000-08-25 2002-03-14 Daniel Burnstein Apparatus, means and methods for automatic community formation for phones and computer networks
US7457948B1 (en) 2000-09-29 2008-11-25 Lucent Technologies Inc. Automated authentication handling system
US7197470B1 (en) 2000-10-11 2007-03-27 Buzzmetrics, Ltd. System and method for collection analysis of electronic discussion methods
US6684205B1 (en) 2000-10-18 2004-01-27 International Business Machines Corporation Clustering hypertext with applications to web searching
CA2323883C (en) 2000-10-19 2016-02-16 Patrick Ryan Morin Method and device for classifying internet objects and objects stored oncomputer-readable media
US6978419B1 (en) 2000-11-15 2005-12-20 Justsystem Corporation Method and apparatus for efficient identification of duplicate and near-duplicate documents and text spans using high-discriminability text fragments
US6961731B2 (en) 2000-11-15 2005-11-01 Kooltorch, L.L.C. Apparatus and method for organizing and/or presenting data
AU2002235142A1 (en) 2000-11-27 2002-06-03 Nextworth, Inc. Anonymous transaction system
AU2002235147A1 (en) 2000-11-30 2002-06-11 Webtone Technologies, Inc. Web session collaboration
US7003551B2 (en) 2000-11-30 2006-02-21 Bellsouth Intellectual Property Corp. Method and apparatus for minimizing storage of common attachment files in an e-mail communications server
US6751628B2 (en) 2001-01-11 2004-06-15 Dolphin Search Process and system for sparse vector and matrix representation of document indexing and retrieval
US7233886B2 (en) * 2001-01-19 2007-06-19 Smartsignal Corporation Adaptive modeling of changed states in predictive condition monitoring
US6658423B1 (en) 2001-01-24 2003-12-02 Google, Inc. Detecting duplicate and near-duplicate files
JP4022374B2 (en) 2001-01-26 2007-12-19 株式会社ルネサステクノロジ Semiconductor device manufacturing method and system
JP3768105B2 (en) 2001-01-29 2006-04-19 株式会社東芝 Translation apparatus, translation method, and translation program
US7571177B2 (en) 2001-02-08 2009-08-04 2028, Inc. Methods and systems for automated semantic knowledge leveraging graph theoretic analysis and the inherent structure of communication
CN101030275B (en) 2001-02-12 2013-11-06 Emc公司 System and method of indexing unique electronic mail messages and uses for the same
US7366759B2 (en) 2001-02-22 2008-04-29 Parity Communications, Inc. Method and system for characterizing relationships in social networks
US6823333B2 (en) 2001-03-02 2004-11-23 The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration System, method and apparatus for conducting a keyterm search
US6819344B2 (en) 2001-03-12 2004-11-16 Microsoft Corporation Visualization of multi-dimensional data having an unbounded dimension
US20030130991A1 (en) 2001-03-28 2003-07-10 Fidel Reijerse Knowledge discovery from data sets
US7353204B2 (en) 2001-04-03 2008-04-01 Zix Corporation Certified transmission system
US6714929B1 (en) 2001-04-13 2004-03-30 Auguri Corporation Weighted preference data search system and method
US6804665B2 (en) * 2001-04-18 2004-10-12 International Business Machines Corporation Method and apparatus for discovering knowledge gaps between problems and solutions in text databases
US7020645B2 (en) 2001-04-19 2006-03-28 Eoriginal, Inc. Systems and methods for state-less authentication
US7155668B2 (en) * 2001-04-19 2006-12-26 International Business Machines Corporation Method and system for identifying relationships between text documents and structured variables pertaining to the text documents
US7194483B1 (en) 2001-05-07 2007-03-20 Intelligenxia, Inc. Method, system, and computer program product for concept-based multi-dimensional analysis of unstructured information
US6970881B1 (en) 2001-05-07 2005-11-29 Intelligenxia, Inc. Concept-based method and system for dynamically analyzing unstructured information
US6735578B2 (en) 2001-05-10 2004-05-11 Honeywell International Inc. Indexing of knowledge base in multilayer self-organizing maps with hessian and perturbation induced fast learning
US20020184193A1 (en) * 2001-05-30 2002-12-05 Meir Cohen Method and system for performing a similarity search using a dissimilarity based indexing structure
US6675164B2 (en) 2001-06-08 2004-01-06 The Regents Of The University Of California Parallel object-oriented data mining system
US7266545B2 (en) * 2001-08-07 2007-09-04 International Business Machines Corporation Methods and apparatus for indexing in a database and for retrieving data from a database in accordance with queries using example sets
JP4701564B2 (en) 2001-08-31 2011-06-15 ソニー株式会社 Menu display device and menu display method
US6778995B1 (en) * 2001-08-31 2004-08-17 Attenex Corporation System and method for efficiently generating cluster groupings in a multi-dimensional concept space
US6996575B2 (en) * 2002-05-31 2006-02-07 Sas Institute Inc. Computer-implemented system and method for text-based document processing
US20050171948A1 (en) * 2002-12-11 2005-08-04 Knight William C. System and method for identifying critical features in an ordered scale space within a multi-dimensional feature space
JP4828091B2 (en) * 2003-03-05 2011-11-30 ヒューレット・パッカード・カンパニー Clustering method program and apparatus
GB2403558A (en) * 2003-07-02 2005-01-05 Sony Uk Ltd Document searching and method for presenting the results
US7191175B2 (en) * 2004-02-13 2007-03-13 Attenex Corporation System and method for arranging concept clusters in thematic neighborhood relationships in a two-dimensional visual display space

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11269812B2 (en) 2019-05-10 2022-03-08 International Business Machines Corporation Derived relationship for collaboration documents
CN111835917A (en) * 2020-07-14 2020-10-27 北京字节跳动网络技术有限公司 Method, device and equipment for showing activity range and computer readable medium

Also Published As

Publication number Publication date
US20050010555A1 (en) 2005-01-13
US20140156664A1 (en) 2014-06-05
US20160085849A1 (en) 2016-03-24
US20130212098A1 (en) 2013-08-15
US8402026B2 (en) 2013-03-19
US9558259B2 (en) 2017-01-31
US6778995B1 (en) 2004-08-17
US9208221B2 (en) 2015-12-08
US8650190B2 (en) 2014-02-11

Similar Documents

Publication Publication Date Title
US9558259B2 (en) Computer-implemented system and method for generating clusters for placement into a display
US9619551B2 (en) Computer-implemented system and method for generating document groupings for display
US7610313B2 (en) System and method for performing efficient document scoring and clustering
CA2509580C (en) Identifying critical features in ordered scale space
US7085771B2 (en) System and method for automatically discovering a hierarchy of concepts from a corpus of documents
US6944612B2 (en) Structured contextual clustering method and system in a federated search engine
US20020152201A1 (en) Mining of generalised disjunctive association rules
Changala et al. A SURVEY ON DEVELOPMENT OF PATTERN EVOLVING MODEL FOR DISCOVERY OF PATTERNS IN TEXT MINING USING DATA MINING TECHNIQUES.
Moradi Small-world networks for summarization of biomedical articles
Olsen et al. Full text searching and information overload
Pasarate et al. Concept based document clustering using K prototype Algorithm
DEOGUN INFORMATION RETRIEVAL, RESEARCH: STRATEGIES AND USER IMPLICATIONS
Kourik Performance of classification tools on unstructured text
Muvva WikiSearch: An Information Retrieval System
Senthilkumar et al. High Dimensional Feature Based Word Pair Similarity Measuring For Web Database Using Skip-Pattern Clustering Algorithm
Cooper Advances in Lexical Navigation

Legal Events

Date Code Title Description
AS Assignment

Owner name: FTI CONSULTING TECHNOLOGY LLC, MARYLAND

Free format text: CHANGE OF NAME;ASSIGNOR:FTI TECHNOLOGY LLC;REEL/FRAME:045785/0645

Effective date: 20110926

AS Assignment

Owner name: NUIX NORTH AMERICA INC., VIRGINIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:FTI CONSULTING TECHNOLOGY LLC;REEL/FRAME:047237/0019

Effective date: 20180910

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

AS Assignment

Owner name: FTI TECHNOLOGY LLC, MARYLAND

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ATTENEX CORPORATION;REEL/FRAME:051679/0344

Effective date: 20091229

Owner name: ATTENEX CORPORATION, WASHINGTON

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:GALLIVAN, DAN;REEL/FRAME:051679/0324

Effective date: 20010831