Search
Abstract
This article describes an improvement for K-means algorithm and its application in the form of a system that clusters search results retrieved from Wikipedia. The proposed algorithm eliminates K-means isadvantages and allows one to create a cluster hierarchy. The main contributions of this paper include the ollowing: (1) The concept of an improved K-means algorithm and its application for hierarchical clustering. (2) Description of the WikiClusterSearch system that employs the proposed algorithm to organize Wikipedia search results into clusters.
Citations
-
1
CrossRef
-
0
Web of Science
-
2
Scopus
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Title of issue:
- Inista 2011, International Symposium on INnovations in Intelligent SysTems and Applications, Istambuł, Turcja 15-18 June 2011 strony 253 - 257
- Language:
- English
- Publication year:
- 2011
- Bibliographic description:
- Szymański J.: 0-step K-means for clustering Wikipedia search results // Inista 2011, International Symposium on INnovations in Intelligent SysTems and Applications, Istambuł, Turcja 15-18 June 2011/ : , 2011, s.253-257
- DOI:
- Digital Object Identifier (open in new tab) 10.1109/inista.2011.5946070
- Verified by:
- Gdańsk University of Technology
seen 130 times