International Journal of Man-Machine Studies
A conceptual version of the K-means algorithm
Pattern Recognition Letters
CACTUS—clustering categorical data using summaries
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
ROCK: a robust clustering algorithm for categorical attributes
Information Systems
Unsupervised Rough Set Classification Using GAs
Journal of Intelligent Information Systems
Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
Data Mining and Knowledge Discovery
Squeezer: an efficient algorithm for clustering categorical data
Journal of Computer Science and Technology
On Clustering Validation Techniques
Journal of Intelligent Information Systems
Extraction of Experts' Decision Process from Clinical Databases Using Rough Set Model
PKDD '97 Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery
Clustering categorical data: an approach based on dynamical systems
The VLDB Journal — The International Journal on Very Large Data Bases
Interval Set Clustering of Web Users with Rough K-Means
Journal of Intelligent Information Systems
Cluster Analysis for Gene Expression Data: A Survey
IEEE Transactions on Knowledge and Data Engineering
Fuzzy clustering of categorical data using fuzzy centroids
Pattern Recognition Letters
Web Intelligence and Agent Systems
Cluster analysis of gene expression data based on self-splitting and merging competitive learning
IEEE Transactions on Information Technology in Biomedicine
A possibilistic approach to clustering
IEEE Transactions on Fuzzy Systems
IEEE Transactions on Fuzzy Systems
Fundamenta Informaticae
Determining the best K for clustering transactional datasets: A coverage density-based approach
Data & Knowledge Engineering
An initialization method for the K-Means algorithm using neighborhood model
Computers & Mathematics with Applications
A rough set approach for selecting clustering attribute
Knowledge-Based Systems
A framework on rough set-based partitioning attribute selection
ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
On multi-soft sets construction in information systems
ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
A framework for clustering categorical time-evolving data
IEEE Transactions on Fuzzy Systems
Application rough sets theory to ordinal scale data for discovering knowledge
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
Applying variable precision rough set model for clustering student suffering study's anxiety
Expert Systems with Applications: An International Journal
A dissimilarity measure for the k-Modes clustering algorithm
Knowledge-Based Systems
The rough set-based algorithm for two steps
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Adjusting the clustering results referencing an external set
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
A novel soft set approach in selecting clustering attribute
Knowledge-Based Systems
On soft partition attribute selection
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
International Journal of Information Retrieval Research
Rough set based fuzzy k-modes for categorical data
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
MAR: Maximum Attribute Relative of soft set for clustering attribute selection
Knowledge-Based Systems
Hi-index | 0.00 |
A variety of cluster analysis techniques exist to group objects having similar characteristics. However, the implementation of many of these techniques is challenging due to the fact that much of the data contained in today's databases is categorical in nature. While there have been recent advances in algorithms for clustering categorical data, some are unable to handle uncertainty in the clustering process while others have stability issues. This research proposes a new algorithm for clustering categorical data, termed Min-Min-Roughness (MMR), based on Rough Set Theory (RST), which has the ability to handle the uncertainty in the clustering process.