Difference between revisions of "0-Step K-Means for Clustering Wikipedia Search Results"
(0-Step K-Means for Clustering Wikipedia Search Results - creating a new article) |
(+ wikilinks) |
||
| Line 1: | Line 1: | ||
| − | '''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. | + | '''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 == | == 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. | + | 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. |
Revision as of 11:07, 4 March 2021
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.
