Automated document indexing via intelligent hierarchical clustering: A novel approach

With the rising quantity of textual data available in electronic format, the need to organize it become a highly challenging task. In the present paper, we explore a document organization framework that exploits an intelligent hierarchical clustering algorithm to generate an index over a set of documents. The framework has been designed to be scalable and accurate even with large corpora. The advantage of the proposed algorithm lies in the need for minimal inputs, with much of the hierarchy attributes being decided in an automated manner using statistical methods. The use of topic modeling in a pre-processing stage ensures robustness to a range of variations in the input data. For experimental work 20-Newsgroups dataset has been used. The F-measure of the proposed approach has been compared with the traditional K-Means and K-Medoids clustering algorithms. Test results demonstrate the applicability, efficiency and effectiveness of our proposed approach. After extensive experimentation, we conclude that the framework shows promise for further research and specialized commercial applications.

[1]  Thomas Hofmann,et al.  Learning the Similarity of Documents: An Information-Geometric Approach to Document Retrieval and Categorization , 1999, NIPS.

[2]  Euripides G. M. Petrakis,et al.  Hierarchical Clustering in Medical Document Collections: the BIC-Means Method , 2010, J. Digit. Inf. Manag..

[3]  Jiawei Han,et al.  Locally Consistent Concept Factorization for Document Clustering , 2011, IEEE Transactions on Knowledge and Data Engineering.

[4]  Daniel Boley,et al.  Principal Direction Divisive Partitioning , 1998, Data Mining and Knowledge Discovery.

[5]  Viggo Kann,et al.  Comparing Comparisons: Document Clustering Evaluation Using Two Manual Classifications , 2004 .

[6]  Charles Nicholas,et al.  Feature Selection and Document Clustering , 2004 .

[7]  Akiko Aizawa,et al.  An information-theoretic perspective of tf-idf measures , 2003, Inf. Process. Manag..

[8]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[9]  Benjamin C. M. Fung,et al.  Hierarchical Document Clustering using Frequent Itemsets , 2003, SDM.

[10]  P. Mahalanobis On the generalized distance in statistics , 1936 .

[11]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[12]  Mansaf Alam,et al.  Web Search Result Clustering using Heuristic Search and Latent Semantic Indexing , 2012 .

[13]  Inderjit S. Dhillon,et al.  Generalized Nonnegative Matrix Approximations with Bregman Divergences , 2005, NIPS.

[14]  Richard A. Harshman,et al.  Indexing by Latent Semantic Analysis , 1990, J. Am. Soc. Inf. Sci..

[15]  Peter J. Rousseeuw,et al.  Clustering by means of medoids , 1987 .

[16]  Hamid Alinejad Rokny,et al.  Text clustering on latent semantic indexing with particle swarm optimization (PSO) algorithm , 2012 .

[17]  Wei Song,et al.  Analysis of Web Clustering Based on Genetic Algorithm with Latent Semantic Indexing Technology , 2007, Sixth International Conference on Advanced Language Processing and Web Information Technology (ALPIT 2007).

[18]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..