2010 · 19 citations · 11 references
ComputingComputer ScienceData MiningMachine LearningTime Series AnalysisCluster DetectionDimensionality ReductionScalable Data MiningScalable Machine LearningTime Series ClusteringUnsupervised LearningClusteringClustering For Large-scale DataHigh-dimensional Data ClusteringHigh-dimensional Data MiningK-means ClusteringScalable ClusteringScalable Time Series Clustering
Clustering is considered as the most important unsupervised learning problem. It aims to find some structure in a collection of unlabeled data. Dealing with a large quantity of data items can be problematic because of time complexity. On the other hand high dimensional data is a challenge arena in data clustering e.g. time series data. Novel algorithms are needed to be robust, scalable, efficient and accurate to cluster of these kinds of data. In this study we proposed a two stages algorithm base on K-Means to achieve our objective.
11
High-dimensional data clustering
Charles Bouveyron, Stéphane Girard, C. Schmid · Computational Statistics & Data Analysis · 2007 · 374 citations · Full text
<i>k</i> -means projective clustering
Pankaj K. Agarwal, Nabil H. Mustafa · 2004 · 191 citations
Discriminative K-means for Clustering
Jieping Ye, Zheng Zhao, Mingrui Wu · 2007 · 187 citations