340 search results - page 30 / 68 » Clustering with Lower Bound on Similarity |
117
Voted
ICML
2005
IEEE
16 years 1 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...
182
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
93
Voted
CORR
2006
Springer
15 years 24 days ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
112
click to vote
SDM
2007
SIAM
15 years 2 months ago
2007
SIAM
In recent years, spectral clustering method has gained attentions because of its superior performance compared to other traditional clustering algorithms such as K-means algorithm...
114
click to vote
DCC
2007
IEEE
16 years 10 days ago
2007
IEEE
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...