RMF: Rough Set Membership Function-based for Clustering Web Transactions
One of the most important techniques to improve information management on the web in order to obtain better understanding of user's behaviour is clustering web data. Currently, the rough approximation-based clustering technique has been used to group web transactions into clusters. It is based...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
SERSC
2013
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://umpir.ump.edu.my/id/eprint/7504/1/RMF-_Rough_Set_Membership_Function-based_for_Clustering_Web_Transactions.pdf http://umpir.ump.edu.my/id/eprint/7504/ http://dx.doi.org/10.14257/ijmue.2013.8.6.11 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | One of the most important techniques to improve information management on the web in order to obtain better understanding of user's behaviour is clustering web data. Currently, the rough approximation-based clustering technique has been used to group web transactions into clusters. It is based on the similarity of upper approximations of transactions to merge between two or more clusters. However, in reviewing the technique, it has a weakness in terms of processing time in obtaining web clusters. In this paper, an alternative technique for
grouping web transactions using rough set theory, named RMF is proposed. It is based on the rough membership function of a transaction similarity class with respect to the other classes. The two UCI benchmarks datasets are opted in the experimental processes. The experimental results reveal that the proposed technique has an benefit of low time complexity as compared to the baseline technique up to 67 % |
|---|