Access the full text.
Sign up today, get DeepDyve free for 14 days.
K-G Woo, J-H Lee, Y-J Lee (2004)
FINDIT: a fast and intelligent subspace clustering algorithm using dimension votingInf Softw Technol, 46
L Parsons, E Haque, H Liu (2004)
Subspace clustering for high dimensional data: A reviewSIGKDD Explor, 6
I Witten, E Frank (1999)
Data mining: practical machine learning tools and techniques
H-P Kriegel, P Kröger, A Zimek (2009)
Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clusteringACM Trans Knowl Discov Data, 3
EL Dyer, AC Sankaranarayanan, RG Baraniuk (2013)
Greedy feature selection for subspace clusteringJ Mach Learn Res, 14
H Hu, J Feng, J Zhou (2015)
Exploiting unsupervised and supervised constraints for subspace clusteringIEEE Trans Pattern Anal Mach Intell, 37
M Soltanolkotabi, E Elhamifar, EJ Candès (2014)
Robust subspace clusteringAnn Stat, 42
R Vidal, P Favaro (2014)
Low rank subspace clustering (LRSC)Pattern Recognit Lett, 43
H Hotelling (1933)
Analysis of a complex of statistical variables into principal componentsJ Educ Psychol, 24
A Patrikainen, M Meila (2006)
Comparing subspace clusteringsIEEE Trans Knowl Data Eng, 18
ML Yiu, N Mamoulis (2005)
Iterative projected clustering by subspace miningIEEE Trans Knowl Data Eng, 17
AK Jain, MN Murty, PJ Flynn (1999)
Data clustering: A reviewACM Comput Surv, 31
R Agrawal, J Gehrke, D Gunopulos, P Raghavan (2005)
Automatic subspace clustering of high dimensional dataData Min Knowl Discov, 11
JA Hartigan (1975)
Clustering algorithms
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.
Knowledge and Information Systems – Springer Journals
Published: Feb 14, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.