Name
Abstract | ||
|---|---|---|
Clustering, which is a set of categorical data into a homogenous class, is a fundamental operation in data mining. One of the techniques of data clustering was performed by introducing a clustering attribute. A number of algorithms have been proposed to address the problem of clustering attribute selection. However, the performance of these algorithms is still an issue due to high computational complexity. This paper proposes a new algorithm called Maximum Attribute Relative (MAR) for clustering attribute selection. It is based on a soft set theory by introducing the concept of the attribute relative in information systems. Based on the experiment on fourteen UCI datasets and a supplier dataset, the proposed algorithm achieved a lower computational time than the three rough set-based algorithms, i.e. TR, MMR, and MDA up to 62%, 64%, and 40% respectively and compared to a soft set-based algorithm, i.e. NSS up to 33%. Furthermore, MAR has a good scalability, i.e. the executing time of the algorithm tends to increase linearly as the number of instances and attributes are increased respectively. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.knosys.2013.05.009 | Knowl.-Based Syst. |
Keywords | DocType | Volume |
data mining,clustering attribute selection,maximum attribute relative,categorical data,soft set-based algorithm,new algorithm,clustering attribute,high computational complexity,rough set-based algorithm,proposed algorithm,lower computational time,complexity | Journal | 52, |
ISSN | Citations | PageRank |
0950-7051 | 16 | 0.71 |
References | Authors | |
19 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rabiei Mamat | 1 | 21 | 3.50 |
| Tutut Herawan | 2 | 608 | 75.21 |
| Mustafa Mat Deris | 3 | 510 | 56.25 |