338 search results - page 26 / 68 » A PAC-Bayesian Analysis of Graph Clustering and Pairwise Clu... |
189
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
174
click to vote
EMMCVPR
1997
Springer
15 years 10 months ago
1997
Springer
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 ...
156
click to vote
CIVR
2005
Springer
15 years 11 months ago
2005
Springer
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
155
click to vote
CASCON
1992
15 years 7 months ago
1992
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
170
click to vote
ICPR
2008
IEEE
16 years 18 days ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...