0-Step K-means for clustering Wikipedia search results
|0-Step K-means for clustering Wikipedia search results|
|Author(s)||Szymanski J., Wegrzynowicz K.|
|Published in||INISTA 2011 - 2011 International Symposium on INnovations in Intelligent SysTems and Applications|
|Keyword(s)||Unknown (Extra: Hier-archical clustering, Improved K-Means algorithm, K-means, k-Means algorithm, Search results, Wikipedia, Intelligent systems, Clustering algorithms)|
|Article||BASE, CiteSeerX, Google Scholar|
|Web||Ask, Bing, Google (PDF), Yahoo!|
|Download and mirrors|
|Local copy||Not available|
|Remote mirror(s)||Not available|
|Export and share|
|BibTeX, CSV, RDF, JSON|
|Browse properties · List of conference papers|
0-Step K-means for clustering Wikipedia search results is a 2011 conference paper written in English by Szymanski J., Wegrzynowicz K. and published in INISTA 2011 - 2011 International Symposium on INnovations in Intelligent SysTems and Applications.
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 disadvantages and allows one to create a cluster hierarchy. The main contributions of this paper include the following: (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.
- This section requires expansion. Please, help!
Probably, this publication is cited by others, but there are no articles available for them in WikiPapers.