Sciweavers

4526 search results - page 119 / 906
» An overview of clustering methods
Sort
View
COMPGEOM
2011
ACM
13 years 13 days ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
ICDAR
2011
IEEE
12 years 8 months ago
A Chinese Character Localization Method Based on Intergrating Structure and CC-Clustering for Advertising Images
—In this paper, a novel Chinese character localization method is proposed for texts in advertising images. To deal with the texts with gradient color, a color clustering method b...
Jie Liu, Shuwu Zhang, Heping Li, Wei Liang
WWW
2008
ACM
14 years 9 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
JSCIC
2008
71views more  JSCIC 2008»
13 years 8 months ago
Numerical and Statistical Methods for the Coarse-Graining of Many-Particle Stochastic Systems
In this article we discuss recent work on coarse-graining methods for microscopic stochastic lattice systems. We emphasize the numerical analysis of the schemes, focusing on error ...
Markos A. Katsoulakis, Petr Plechác, Luc Re...
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 8 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri