A rough set based subspace clustering technique for high dimensional data
Open Access
- 1 March 2020
- journal article
- research article
- Published by Elsevier BV in Journal of King Saud University - Computer and Information Sciences
- Vol. 32 (3), 329-334
- https://doi.org/10.1016/j.jksuci.2017.09.003
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A survey on enhanced subspace clusteringData Mining and Knowledge Discovery, 2012
- Enhanced soft subspace clustering integrating within-cluster and between-cluster informationPattern Recognition, 2010
- A convergence theorem for the fuzzy subspace clustering (FSC) algorithmPattern Recognition, 2008
- An optimization algorithm for clustering using weighted dissimilarity measuresPattern Recognition, 2004
- Density-Connected Subspace Clustering for High-Dimensional DataPublished by Society for Industrial & Applied Mathematics (SIAM) ,2004
- FINDIT: a fast and intelligent subspace clustering algorithm using dimension votingInformation and Software Technology, 2004
- Finding generalized projected clusters in high dimensional spacesACM SIGMOD Record, 2000
- Fast algorithms for projected clusteringACM SIGMOD Record, 1999
- Automatic subspace clustering of high dimensional data for data mining applicationsACM SIGMOD Record, 1998
- Rough setsInternational Journal of Parallel Programming, 1982