Sciweavers

766 search results - page 73 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 9 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
PDPTA
2003
13 years 10 months ago
Distop: A Low-Overhead Cluster Monitoring System
Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-base...
Daniel Andresen, Nathan Schopf, Ethan Bowker, Timo...
ICPR
2006
IEEE
14 years 10 months ago
Learning Wormholes for Sparsely Labelled Clustering
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
Eng-Jon Ong, Richard Bowden
IVC
2007
164views more  IVC 2007»
13 years 8 months ago
Locality preserving CCA with applications to data visualization and pose estimation
- Canonical correlation analysis (CCA) is a major linear subspace approach to dimensionality reduction and has been applied to image processing, pose estimation and other fields. H...
Tingkai Sun, Songcan Chen
CSDA
2007
99views more  CSDA 2007»
13 years 8 months ago
CLUES: A non-parametric clustering method based on local shrinking
In this paper, we propose a novel non-parametric clustering method based on non-parametric local shrinking. Each data point is transformed in such a way that it moves a specific ...
Xiaogang Wang, Weiliang Qiu, Ruben H. Zamar