Sciweavers

4560 search results - page 151 / 912
» Finding Data in the Neighborhood
Sort
View
EMMCVPR
1997
Springer
14 years 8 days ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
KDD
1997
ACM
146views Data Mining» more  KDD 1997»
14 years 8 days ago
Density-Connected Sets and their Application for Trend Detection in Spatial Databases
1 Several clustering algorithms have been proposed for class identification in spatial databases such as earth observation databases. The effectivity of the well-known algorithms ...
Martin Ester, Hans-Peter Kriegel, Jörg Sander...
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
14 years 11 hour ago
Combining predictions for accurate recommender systems
We analyze the application of ensemble learning to recommender systems on the Netflix Prize dataset. For our analysis we use a set of diverse state-of-the-art collaborative filt...
Michael Jahrer, Andreas Töscher, Robert Legen...
NIPS
2007
13 years 9 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
ICDM
2009
IEEE
153views Data Mining» more  ICDM 2009»
13 years 5 months ago
A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of Clusters
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
Fabrice Muhlenbach, Stéphane Lallich