Efficient mining of distance‐based subspace clusters
- 18 November 2009
- journal article
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 2 (5-6) , 427-444
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- HARP: a practical projected clustering algorithmIEEE Transactions on Knowledge and Data Engineering, 2004
- Biclustering algorithms for biological data analysis: a surveyIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- GO::TermFinder—open source software for accessing Gene Ontology information and finding significantly enriched Gene Ontology terms associated with a list of genesBioinformatics, 2004
- Subspace clustering for high dimensional dataACM SIGKDD Explorations Newsletter, 2004
- FINDIT: a fast and intelligent subspace clustering algorithm using dimension votingInformation and Software Technology, 2004
- Adaptive Grids for Clustering Massive Data Sets2001
- Re-designing distance functions and distance-based applications for high dimensional dataACM SIGMOD Record, 2001
- Functional Discovery via a Compendium of Expression ProfilesCell, 2000
- Automatic subspace clustering of high dimensional data for data mining applicationsACM SIGMOD Record, 1998
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993