Sciweavers

671 search results - page 26 / 135
» Mean shift-based clustering
Sort
View
WWW
2008
ACM
14 years 10 months ago
Resolving Person Names in Web People Search
Disambiguating person names in a set of documents (such as a set of web pages returned in response to a person name) is a key task for the presentation of results and the automatic...
Krisztian Balog, Leif Azzopardi, Maarten de Rijke
IPPS
2010
IEEE
13 years 8 months ago
Large-scale multi-dimensional document clustering on GPU clusters
Document clustering plays an important role in data mining systems. Recently, a flocking-based document clustering algorithm has been proposed to solve the problem through simulat...
Yongpeng Zhang, Frank Mueller, Xiaohui Cui, Thomas...
GFKL
2007
Springer
123views Data Mining» more  GFKL 2007»
14 years 4 months ago
Projecting Dialect Distances to Geography: Bootstrap Clustering vs. Noisy Clustering
Abstract. Dialectometry produces aggregate distance matrices in which a distance is specified for each pair of sites. By projecting groups obtained by clustering onto geography on...
John Nerbonne, Peter Kleiweg, Wilbert Heeringa, Fr...
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
14 years 2 months ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang
ICML
2007
IEEE
14 years 11 months ago
Best of both: a hybridized centroid-medoid clustering heuristic
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
Nizar Grira, Michael E. Houle