Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
On Clustering Validation Techniques
Journal of Intelligent Information Systems
MMR: An algorithm for clustering categorical data using Rough Set Theory
Data & Knowledge Engineering
Data analysis approaches of soft sets under incomplete information
Knowledge-Based Systems
A combined forecasting approach based on fuzzy soft sets
Journal of Computational and Applied Mathematics
A Direct Proof of Every Rough Set is a Soft Set
AMS '09 Proceedings of the 2009 Third Asia International Conference on Modelling & Simulation
An adjustable approach to fuzzy soft set based decision making
Journal of Computational and Applied Mathematics
A rough set approach for selecting clustering attribute
Knowledge-Based Systems
Research on the model of rough set over dual-universes
Knowledge-Based Systems
Relation between concept lattice reduction and rough set reduction
Knowledge-Based Systems
A soft set approach for association rules mining
Knowledge-Based Systems
Finding key attribute subset in dataset for outlier detection
Knowledge-Based Systems
Information Sciences: an International Journal
Fuzzy rough set based attribute reduction for information systems with fuzzy decisions
Knowledge-Based Systems
A vague-rough set approach for uncertain knowledge acquisition
Knowledge-Based Systems
Data filling approach of soft sets under incomplete information
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part II
A new efficient normal parameter reduction algorithm of soft sets
Computers & Mathematics with Applications
Data clustering using variable precision rough set
Intelligent Data Analysis
Applying variable precision rough set model for clustering student suffering study's anxiety
Expert Systems with Applications: An International Journal
Another approach to soft rough sets
Knowledge-Based Systems
MAR: Maximum Attribute Relative of soft set for clustering attribute selection
Knowledge-Based Systems
Hi-index | 0.00 |
Clustering is one of the most useful tasks in data mining process for discovering groups and identifying interesting distributions and patterns in the underlying data. One of the techniques of data clustering was performed by introducing a clustering attribute. Soft set theory, initiated by Molodtsov in 1999, is a new general mathematical tool for dealing with uncertainties. In this paper, we define a soft set model on the equivalence classes of an information system, which can be easily applied in obtaining approximate sets of rough sets. Furthermore, we use it to select a clustering attribute for categorical datasets and a heuristic algorithm is presented. Experiment results on fifteen UCI benchmark datasets showed that the proposed approach provides a faster decision in selecting a clustering attribute as compared with maximum dependency attributes (MDAs) approach up to 14.84%. Furthermore, MDA and NSS have a good scalability i.e. the executing time of both algorithms tends to increase linearly as the number of instances and attributes are increased, respectively.