Sciweavers

38 search results - page 4 / 8
» Interpreting and Extending Classical Agglomerative Clusterin...
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
A Topological Approach to Hierarchical Segmentation using Mean Shift
Mean shift is a popular method to segment images and videos. Pixels are represented by feature points, and the segmentation is driven by the point density in feature space. In thi...
Frédo Durand, Sylvain Paris
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
13 years 8 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
PAMI
2011
13 years 2 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
IJCAI
2003
13 years 8 months ago
Spectral Learning
We present a simple, easily implemented spectral learning algorithm which applies equally whether we have no supervisory information, pairwise link constraints, or labeled example...
Sepandar D. Kamvar, Dan Klein, Christopher D. Mann...
CPM
2004
Springer
108views Combinatorics» more  CPM 2004»
14 years 22 days ago
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Thomas Schmidt, Jens Stoye