766 search results - page 68 / 154 » Clustering high dimensional data using subspace and projecte... |
DASFAA
2008
IEEE
14 years 3 months ago
2008
IEEE
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
PKDD
2000
Springer
14 years 10 days ago
2000
Springer
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
JIFS
2008
13 years 8 months ago
2008
The crucial issue in many classification applications is how to achieve the best possible classifier with a limited number of labeled data for training. Training data selection is ...
MLMI
2005
Springer
14 years 2 months ago
2005
Springer
The TNO speaker speaker diarization system is based on a standard BIC segmentation and clustering algorithm. Since for the NIST Rich Transcription speaker dizarization evaluation m...
COLING
2008
13 years 10 months ago
2008
In this paper, an extension of a dimensionality reduction algorithm called NONNEGATIVE MATRIX FACTORIZATION is presented that combines both `bag of words' data and syntactic ...