338 search results - page 29 / 68 » A PAC-Bayesian Analysis of Graph Clustering and Pairwise Clu... |
180
click to vote
MST
2010
15 years 4 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
175
click to vote
UAI
2004
15 years 7 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
155
click to vote
CLUSTER
2009
IEEE
15 years 11 months ago
2009
IEEE
—Statistical analysis is widely used for countless scientific applications in order to analyze and infer meaning from data. A key challenge of any statistical analysis package a...
145
click to vote
ISI
2007
Springer
16 years 10 days ago
2007
Springer
Graph data represents relationships, connections, or affinities. Innocent relationships produce repeated, and so common, substructures in graph data. We present techniques for dis...
207
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...