396 search results - page 24 / 80 » Probabilistic Cluster Unfoldings |
146
Voted
CORR
2012
Springer
13 years 12 months ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
133
click to vote
ICVGIP
2004
15 years 5 months ago
2004
The first contribution of this paper is a probabilistic approach for measuring motion similarity for point sequences. While most motion segmentation algorithms are based on a rank...
130
Voted
ECML
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Clustering has recently enjoyed progress via spectral methods which group data using only pairwise affinities and avoid parametric assumptions. While spectral clustering ...
120
Voted
ICCSA
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we propose a new clustering procedure for high dimensional microarray data. Major difficulty in cluster analysis of microarray data is that the number of samples to ...
106
click to vote
NIPS
2003
15 years 5 months ago
2003
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...