Sciweavers

84 search results - page 7 / 17
» On the Number of Pseudo-Triangulations of Certain Point Sets
Sort
View
ICPR
2008
IEEE
14 years 1 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
COLT
2008
Springer
13 years 9 months ago
Relating Clustering Stability to Properties of Cluster Boundaries
In this paper, we investigate stability-based methods for cluster model selection, in particular to select the number K of clusters. The scenario under consideration is that clust...
Shai Ben-David, Ulrike von Luxburg
CVPR
2006
IEEE
14 years 9 months ago
Dimensionality Reduction by Learning an Invariant Mapping
Dimensionality reduction involves mapping a set of high dimensional input points onto a low dimensional manifold so that "similar" points in input space are mapped to ne...
Raia Hadsell, Sumit Chopra, Yann LeCun
JMLR
2010
102views more  JMLR 2010»
13 years 2 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 9 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller