Repository Universitas Ahmad Dahlan

Alternative Technique Reducing Complexity of Maximum Attribute Relation

Tri Riyadi Yanto, Iwan and Azhari, Imam (2018) Alternative Technique Reducing Complexity of Maximum Attribute Relation. [Artikel Dosen]

[img]
Preview
Text
Alternative Technique Reducing Complexity of Maximum Attribute Relation.pdf

Download (95kB) | Preview

Abstract

Clustering refers to the method grouping the large data into the smaller groups based on the similarity measure. Clustering techniques have been applied on numerical, categorical and mix data. One of the categorical data clustering technique based on the soft set theory is Maximum Attribute Relation (MAR). The MAR technique allows calculating all of pair multi soft set made. However, the computational complexity is still an issue of the technique. To overcome the drawback, the paper proposes the alternative algorithm to decrease the complexity so get the faster response time. In this paper, to get the similar results as MAR without calculating all pair of soft set is proved. The alternative algorithm is implemented in MATLAB Software, and then experimental is run on the 10 benchmark datasets. The results show that the alternative algorithm improves the computational complexity in term of response time up to 36.46%.

Item Type: Artikel Dosen
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisi / Prodi: Faculty of Mathematics and Natural Sciences (Fakultas Matematika dan Ilmu Pengetahuan Alam) > S1-Information System (S1-Sistem Informasi)
Depositing User: Iwan Tri Riyadi Yanto
Date Deposited: 06 Nov 2018 22:16
Last Modified: 06 Nov 2018 22:16
URI: http://eprints.uad.ac.id/id/eprint/11617

Actions (login required)

View Item View Item

Repository Universitas Ahmad Dahlan is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.