0-Step K-Means for Clustering Wikipedia Search Results
Authors | Julian Szymański Kamil Wegrzynowicz |
|---|---|
Publication date | 2011 |
DOI | 10.1109/INISTA.2011.5946070 |
Links | Original Preprint |
0-Step K-Means for Clustering Wikipedia Search Results - scientific work related to Wikipedia quality published in 2011, written by Julian Szymański and Kamil Wegrzynowicz.
Overview
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.
