Efficient Document Clustering for Web Search Result

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    Clustering the document in data mining is one of the traditional approach in which the same documents that are more relevant are grouped together. Document clustering take part in achieving accuracy that retrieve information for systems that identifies the nearest neighbors of the document. Day to day the massive quantity of data is being generated and it is clustered. According to particular sequence to improve the cluster qualityeven though different clustering methods have been introduced, still many challenges exist for the improvement of document clustering. For web search purposea document in group is efficiently arranged for the result retrieval.The users accordingly search query in an organized way. Hierarchical clustering is attained by document clustering.To the greatest algorithms for groupingdo not concentrate on the semantic approach, hence resulting to the unsatisfactory output clustering. The involuntary approach of organizing documents of web like Google, Yahoo is often considered as a reference. A distinct method to identify the existing group of similar things in the previously organized documents and retrieves effective document classifier for new documents. In this paper the main concentration is on hierarchical clustering and k-means algorithms, hence prove that k-means and its variant are efficient than hierarchical clustering along with this by implementing greedy fast k-means algorithm (GFA) for cluster document in efficient way is considered.



  • Keywords

    Document Clustering, Hierarchical Clustering, K-means, Spherical k-means, GFA,Distance for Euclidean, To measure the Cosine, Text data mining, Knowledge discovery in databases

  • References

      [1] Chan, L.M (1994) Cataloging and Classification: An Introduction. McGraw Hill, New York.

      [2] JochenDorrePeterGerstland (1999)Text mining finding nuggets in mountains of textual data in knowledge discovery and data mining.

      [3] Dan Pelleg and Andrew Moore (2000).: X-means: Extending k-means with efficient estimation of the number of clusters. In Proceedings of the Seventeenth International Conference on Machine Learning, Palo Alto, C.

      [4] AristidisLikas, Nikos Vlassis and Jacob J. Verbeek (2003): The global k-means clustering algorithm. In Pattern Recognition Vol 36, No 2.

      [5] R Kannan, S. Vempala, and Adrian Vetta (2000), “On Clusterings: Good, Bad, and Spectral”, Proc. of the 41st Foundations of Computer Science, Redondo Beach.

      [6] Michael Steinbach Vipin Kumar (2003) ―finding clusters of different sizes, shapes, and densities in noisy high dimensional data―. IEEE‘university of Minnesota, MN, USA.

      [7] Padmini Srinivasan (2005) ―The search for Novelity in text.

      [8] Anoop Jain, Aruna Bajpai, Manish Kumar Rohila (2012) Efficient Clustering Technique for Information Retrieval in Data Mining‖, Department of Computer Applications, Samrat Ashok Technological Institute, Vidisha (M.P.) India.

      [9] J. Matoušek (2000): On the approximate geometric k-clustering. Discrete and Computational Geometry. 24:61-84.

      [10] Anand V. Saurkar, Vaibhav Bhujade, Priti Bhagat Amit Kasarda (2014) ― Various Data Mining Techniques‖ Department of Computer Science& Engineering, Department of Information Technology,DMIETR, Sawangi(M), Wardh,Maharashtra, India.

      [11] Shi Zhong (2008) ―Efficient online spherical K-means clustering‖, Deptt of computer science & Engineering, Florida Atlantivc University, IEEE, USA.

      [12] R Kannan, S. Vempala, and Adrian Vetta (2000), “On Clusterings: Good, Bad, and Spectral”, Proc. of the 41st Foundations of Computer Science, Redondo Beach.




Article ID: 14494
DOI: 10.14419/ijet.v7i3.3.14494

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.