High performance in minimizing of term-document matrix representation for document clustering

• Main Authors: B., Baharudin, L., Muflikhah
• Format: Conference or Workshop Item
• Published: 2009
• Subjects: Q Science (General); QA75 Electronic computers. Computer science
• Online Access: http://eprints.utp.edu.my/185/1/paper.pdf; http://www.scopus.com/inward/record.url?eid=2-s2.0-70449096518&partnerID=40&md5=8e95f85e0aa9c498cd3f93ed10ebf89d; http://eprints.utp.edu.my/185/

Document clustering usually involves high dimensional term space, which makes it difficult for organizing data into a small number of meaningful clusters. Clustering based on similar terms without considering the content or meaning is often unsatisfactory as it ignores the relationship between important terms that do not co-occur literally. In this paper, we propose to integrate the Latent Semantic Indexing (LSI) concept to our document clustering. This involves the use of Singular Value Decomposition (SVD) which creates a new abstract and uses a way of finding pattern document collection in matrix representation, so that it can identify between the terms and documents which are similar. By using various numbers of patterns (rank) of SVD, the proposed method is applied to cluster documents using the Fuzzy C-Means algorithm. The results of the experiment show that the performance of document clustering to be better when appliedto the LSI method. © 2009 IEEE.