Sciweavers

3934 search results - page 110 / 787
» A monothetic clustering method
Sort
View
HAIS
2008
Springer
15 years 7 months ago
Clustering Likelihood Curves: Finding Deviations from Single Clusters
For systematic analyses of quantitative mass spectrometry data a method was developed in order to reveal peptides within a protein, that show differences in comparison with the rem...
Claudia Hundertmark, Frank Klawonn
WWW
2008
ACM
16 years 6 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»
15 years 5 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»
15 years 5 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
ICML
2003
IEEE
16 years 6 months ago
The Pre-Image Problem in Kernel Methods
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...
James T. Kwok, Ivor W. Tsang