0-Step K-means for clustering Wikipedia search results

From WikiPapers
Jump to: navigation, search

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.

[edit] 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 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.

[edit] References

This section requires expansion. Please, help!

Cited by

Probably, this publication is cited by others, but there are no articles available for them in WikiPapers.