5595 search results - page 166 / 1119 » Approximation Algorithms for Clustering Problems |
170
click to vote
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
153
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
119
Voted
IPL
2000
15 years 4 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
142
click to vote
SDM
2003
SIAM
15 years 6 months ago
2003
SIAM
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
168
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...