Scalable feature selection, classification and signature generation for organizing large text databases into hierarchical topic taxonomies

• Published in: The VLDB journal Vol. 7; no. 3; pp. 163 - 178
• Main Authors: CHAKRABARTI, S, DOM, B, AGRAWAL, R, RAGHAVAN, P
• Format: Conference Proceeding Journal Article
• Language: English
• Published: Heidelberg Springer 01.08.1998
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Computer science; control theory; systems; Exact sciences and technology; Information systems. Data bases; Memory organisation. Data processing; Office automation, teleprocessing; Software; Theoretical computing; System architecture; Database query; Information system; Taxonomy; Experimental study; Algorithm; Document processing; Remote data processing; System performance; Classification; World wide web; Internet; Data structure; Database management system
• ISSN: 1066-8888; 0949-877X
• DOI: 10.1007/s007780050061

We explore how to organize large text databases hierarchically by topic to aid better searching, browsing and filtering. Many corpora, such as internet directories, digital libraries, and patent databases are manually organized into topic hierarchies, also called taxonomies. Similar to indices for relational data, taxonomies make search and access more efficient. However, the exponential growth in the volume of on-line textual information makes it nearly impossible to maintain such taxonomic organization for large, fast-changing corpora by hand. We describe an automatic system that starts with a small sample of the corpus in which topics have been assigned by hand, and then updates the database with new documents as the corpus grows, assigning topics to these new documents with high speed and accuracy. To do this, we use techniques from statistical pattern recognition to efficiently separate the feature words, or discriminants, from thenoise words at each node of the taxonomy. Using these, we build a multilevel classifier. At each node, this classifier can ignore the large number of "noise" words in a document. Thus, the classifier has a small model size and is very fast. Owing to the use of context-sensitive features, the classifier is very accurate. As a by-product, we can compute for each document a set of terms that occur significantly more often in it than in the classes to which it belongs. We describe the design and implementation of our system, stressing how to exploit standard, efficient relational operations like sorts and joins. We report on experiences with the Reuters newswire benchmark, the US patent database, and web document samples from Yahoo!. We discuss applications where our system can improve searching and filtering capabilities.