0-Step K-Means for Clustering Wikipedia Search Results

From Wikipedia Quality
Revision as of 18:50, 13 March 2021 by Karyn (talk | contribs) (Embed)
Jump to: navigation, search


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.

Embed

Wikipedia Quality

Szymański, Julian; Wegrzynowicz, Kamil. (2011). "[[0-Step K-Means for Clustering Wikipedia Search Results]]".DOI: 10.1109/INISTA.2011.5946070.

English Wikipedia

{{cite journal |last1=Szymański |first1=Julian |last2=Wegrzynowicz |first2=Kamil |title=0-Step K-Means for Clustering Wikipedia Search Results |date=2011 |doi=10.1109/INISTA.2011.5946070 |url=https://wikipediaquality.com/wiki/0-Step_K-Means_for_Clustering_Wikipedia_Search_Results}}

HTML

Szymański, Julian; Wegrzynowicz, Kamil. (2011). &quot;<a href="https://wikipediaquality.com/wiki/0-Step_K-Means_for_Clustering_Wikipedia_Search_Results">0-Step K-Means for Clustering Wikipedia Search Results</a>&quot;.DOI: 10.1109/INISTA.2011.5946070.