Difference between revisions of "0-Step K-Means for Clustering Wikipedia Search Results"
(+ wikilinks) |
(+ infobox) |
||
| Line 1: | Line 1: | ||
| + | {{Infobox work | ||
| + | | title = 0-Step K-Means for Clustering Wikipedia Search Results | ||
| + | | date = 2011 | ||
| + | | authors = [[Julian Szymański]]<br />[[Kamil Wegrzynowicz]] | ||
| + | | doi = 10.1109/INISTA.2011.5946070 | ||
| + | | link = http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5946070&contentType=Conference+Publications | ||
| + | | plink = https://www.researchgate.net/profile/Julian_Szymanski/publication/241185366_0Step_K-means_for_clustering_Wikipedia_search_results/links/00463539aa19095cee000000.pdf | ||
| + | }} | ||
'''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 00:08, 9 March 2021
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.
