Computer Science – Information Retrieval
Scientific paper
2010-03-09
Computer Science
Information Retrieval
Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS, Vol. 7 No. 2, February 2010, US
Scientific paper
Fast and high quality document clustering is an important task in organizing information, search engine results obtaining from user query, enhancing web crawling and information retrieval. With the large amount of data available and with a goal of creating good quality clusters, a variety of algorithms have been developed having quality-complexity trade-offs. Among these, some algorithms seek to minimize the computational complexity using certain criterion functions which are defined for the whole set of clustering solution. In this paper, we are proposing a novel document clustering algorithm based on an internal criterion function. Most commonly used partitioning clustering algorithms (e.g. k-means) have some drawbacks as they suffer from local optimum solutions and creation of empty clusters as a clustering solution. The proposed algorithm usually does not suffer from these problems and converge to a global optimum, its performance enhances with the increase in number of clusters. We have checked our algorithm against three different datasets for four different values of k (required number of clusters).
Dhar Joydip
Kandpal Eatesh
Ranjan Alok
Verma Harish
No associations
LandOfFree
An Analytical Approach to Document Clustering Based on Internal Criterion Function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Analytical Approach to Document Clustering Based on Internal Criterion Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Analytical Approach to Document Clustering Based on Internal Criterion Function will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-454707