Sciweavers

387 search results - page 20 / 78
» Beyond Pairwise Clustering
Sort
View
ICCV
2007
IEEE
14 years 1 months ago
Latent Model Clustering and Applications to Visual Recognition
We consider clustering situations in which the pairwise affinity between data points depends on a latent ”context” variable. For example, when clustering features arising fro...
Simon Polak, Amnon Shashua
TREC
2004
13 years 8 months ago
Columbia University in the Novelty Track at TREC 2004
Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text sp...
Barry Schiffman, Kathleen McKeown
ICPR
2008
IEEE
14 years 8 months ago
Active query selection for semi-supervised clustering
Semi-supervised clustering allows a user to specify available prior knowledge about the data to improve the clustering performance. A common way to express this information is in ...
Anil K. Jain, Pavan Kumar Mallapragada, Rong Jin
SSPR
2004
Springer
14 years 22 days ago
Clustering with Soft and Group Constraints
Several clustering algorithms equipped with pairwise hard constraints between data points are known to improve the accuracy of clustering solutions. We develop a new clustering alg...
Martin H. C. Law, Alexander P. Topchy, Anil K. Jai...
CORR
2006
Springer
161views Education» more  CORR 2006»
13 years 7 months ago
Consensus Propagation
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
Ciamac Cyrus Moallemi, Benjamin Van Roy