Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Efficient Monte Carlo clustering in subspaces

Efficient Monte Carlo clustering in subspaces Clustering of high-dimensional data is an important problem in many application areas, including image classification, genetic analysis, and collaborative filtering. However, it is common for clusters to form in different subsets of the dimensions. We present a randomized algorithm for subspace and projected clustering that is both simple and efficient. The complexity of the algorithm is linear in the number of data points and low-order polynomial in the number of dimensions. We present the results of a thorough evaluation of the algorithm using the OpenSubspace framework. Our algorithm outperforms competing subspace and projected clustering algorithms on both synthetic and real-world data sets. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Knowledge and Information Systems Springer Journals

Efficient Monte Carlo clustering in subspaces

Loading next page...
1
 
/lp/springer_journal/efficient-monte-carlo-clustering-in-subspaces-rucixosoGK

References (14)

Publisher
Springer Journals
Copyright
Copyright © 2017 by Springer-Verlag London
Subject
Computer Science; Information Systems and Communication Service; IT in Business
ISSN
0219-1377
eISSN
0219-3116
DOI
10.1007/s10115-017-1031-7
Publisher site
See Article on Publisher Site

Abstract

Clustering of high-dimensional data is an important problem in many application areas, including image classification, genetic analysis, and collaborative filtering. However, it is common for clusters to form in different subsets of the dimensions. We present a randomized algorithm for subspace and projected clustering that is both simple and efficient. The complexity of the algorithm is linear in the number of data points and low-order polynomial in the number of dimensions. We present the results of a thorough evaluation of the algorithm using the OpenSubspace framework. Our algorithm outperforms competing subspace and projected clustering algorithms on both synthetic and real-world data sets.

Journal

Knowledge and Information SystemsSpringer Journals

Published: Feb 14, 2017

There are no references for this article.