2932 search results - page 222 / 587 » Higher order mining |
173
click to vote
PAKDD
2005
ACM
16 years 1 days ago
2005
ACM
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
165
click to vote
ICDM
2003
IEEE
15 years 12 months ago
2003
IEEE
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than...
183
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
153
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
147
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Higher quality synthesized speech is required for widespread use of text-to-speech (TTS) technology, and prosodic pattern is the key feature that makes synthetic speech sound unna...