The research on model of mining association rules based on quantitative extended concept lattice

被引:0
作者
Wang, DX [1 ]
Hu, XG [1 ]
Wang, H [1 ]
机构
[1] Hefei Univ Technol, Dept Comp Sci & Technol, Hefei 230009, Peoples R China
来源
2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS | 2002年
关键词
data mining; association rules; concept lattice; frequent item sets;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Concept Lattice represents knowledge with the relationships between the intension and the extension of concepts, and the relationships between the generalization and the specialization of concepts, thus it is properly applied to the description of mining association rules in databases. The Quantitative Extended Concept Lattice (QECL) evolves from concept lattice by introducing equivalent relationship to its intension and quantity to its extension, which further enriches the relationships between its intensions. Based on QECL, we can mine association rules, comparing with well-known Apriori, Mining association rules on QECL does not need to scan databases for many times, has higher quality of time complexity and shows association rules on the Hasse diagram of QECL more visual and concise, moreover, it can be used to mine association rules interactively according to user's subjective interest.
引用
收藏
页码:134 / 138
页数:5
相关论文
共 8 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]  
HAN JW, 2001, DATA MINING CONCEPTS, P227
[3]  
HU XG, 2000, THESIS HEFEI U TECHN
[4]  
HU XG, 2000, P 3 INT C COMP AID I, P460
[5]  
HU XG, 1999, P 2 INT C COMP AID I, P236
[6]  
JITENDER DG, 1998, P RSDMGRC 98
[7]  
Snelting G., 1996, ACM Transactions on Software Engineering and Methodology, V5, P146, DOI 10.1145/227607.227613
[8]  
Wille R., 1982, ORDERED SETS, V23, P445, DOI [10.1007/978-94-009-7798-3_15, DOI 10.1007/978-94-009-7798-3_15]