Journal of Guangxi Normal University(Natural Science Edition) ›› 2011, Vol. 29 ›› Issue (1): 98-101.

Previous Articles     Next Articles

An Inter-transaction Association Rules Mining Algorithm Based onClustering Analysis

QI Yan-yan, REN Yong-gong   

  1. School of Computer and Information Technology,Liaoning NormalUniversity,Dalian Liaoning 116081,China
  • Received:2010-12-29 Published:2018-11-16

Abstract: The association rules between transactions are concentrated on meaningful association between different services in data mining.The existing algorithms can realize the largest conversion of frequent itemsets amongand within affairs,and find the relationship between different users.However,indealing with the affairs of the larger database,a large number of false rules are generated due to the correlation analysis is performed on the original database.This paper proposes a mining algorithm of association rules for inter-transaction among affairs based on cluster analysis.Through simplifying the complex dataset by cluster analysis,the proposed approach can eliminate redundant data,reduse the size of dataset and avoid the need for multipole scanning of the database and the generation of a large number of false rules.Experimental results indicate that the proposed method has higher efficiency and the ability of more precisely predicting the interests of users

Key words: Web data mining, inter-transaction association rules, clustering analysis, sliding window

CLC Number: 

  • TP181
[1] TUNG A K H,LU Hong-jun,HAN Jia-wei,et al.Efficient mining of intertransaetion association rules[J].IEEE Transactions on Knowledge and Data Engineering,2003,15(1):43-56.
[2] CAMPELLO R J G B,HRUSCHKA E R.On comparing two sequence of numbers and its applications to clustering analysis[J].Information Sciences,2009,179(8):1025-1039.
[3] SHI Na,LIU Xu-min,GUAN Yong.Research on k-means clustering algorithm:an improved k-means clustering algorithm[C]//Proceedings of the2010 Third International Symposium on Intelligent Information Technology and Security Informatics.Washington DC:IEEE Comtuter Society,2010:63-67.
[4] LEE A J T,WANG chun-sheng,WENG Wan-Yu,et al.An efficient algorithm for mining closed inter-transaction itemsets[J].Data and Knowledge Engineering,2008,66(1):68-91.
[5] BUZIKASHVILI N.Sliding window technique for the Web log analysis[C]//Proceedings of the 16th international conference on World Wide Web.New York:ACM Press,2007:1213-1214.
[6] 任永功,张琰瑜.一种基于最大频繁项目集的挖掘事务间关联规则方法[J].计算机科学,2008,35(11):185-188.
[7] 艾晶,宋自林,赵靓,等.聚类思想在挖掘关联规则中的运用[J].广西师范大学学报:自然科学版,2009,27(1):117-120.
[1] TANG Qiling, CHEN Zhilin, ZHOU Shanyi. Geographic Division of Chinese Ants (Hymenoptera: Formicidae) Based on Generic Category [J]. Journal of Guangxi Normal University(Natural Science Edition), 2017, 35(1): 82-91.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!