Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : TELKOMNIKA (Telecommunication Computing Electronics and Control)

Alternative Technique reducing complexity of Maximum Attribute Relation Iwan Tri Riyadi Yanto; Imam Azhari
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v13i4.2179

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%
A Soft Set-based Co-occurrence for Clustering Web User Transactions Edi Sutoyo; Iwan Tri Riyadi Yanto; Rd Rohmat Saedudin; Tutut Herawan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 15, No 3: September 2017
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v15i3.6382

Abstract

Grouping web transactions into some clusters are essential to gain a better understanding the behavior of the users, which e-commerce companies widely use this grouping process. Therefore, clustering web transaction is important even though it is challenging data mining issue. The problems arise because there is uncertainty when forming clusters. Clustering web user transaction has used the rough set theory for managing uncertainty in the clustering process. However, it suffers from high computational complexity and low cluster purity. In this study, we propose a soft set-based co-occurrence for clustering web user transactions. Unlike rough set approach that uses similarity approach, the novelty of this approach uses a co-occurrence approach of soft set theory. We compare the proposed approach and rough set approaches regarding computational complexity and cluster purity. The result demonstrates better performance and is more effective so that lower computational complexity is achieved with the improvement more than 100% and cluster purity is higher as compared to two previous rough set-based approaches.