FCA-ARMM: A Model for Mining Association Rules from Formal Concept Analysis

被引:2
作者
Abdullah, Zailani [1 ]
Saman, Md Yazid Mohd [2 ]
Karim, Basyirah [2 ]
Herawan, Tutut [3 ]
Deris, Mustafa Mat [4 ]
Hamdan, Abdul Razak [5 ]
机构
[1] Univ Malaysia Kelantan, Ctr Comp & Informat, Fac Entrepreneurship & Business, Kota Baharu 16100, Kelantan, Malaysia
[2] Univ Malaysia Terengganu, Sch Informat & Appl Math, Kuala Terengganu 21030, Terengganu, Malaysia
[3] Univ Malaya, Fac Comp Sci & Informat Technol, Kuala Lumpur 50603, Malaysia
[4] Univ Tun Hussein Onn Malaysia, Fac Sci Comp & Informat Technol, Batu Pahat 86400, Johor, Malaysia
[5] Univ Kebangsaan Malaysia, Fac Informat Sci & Technol, Bangi 43600, Selangor, Malaysia
来源
RECENT ADVANCES ON SOFT COMPUTING AND DATA MINING | 2017年 / 549卷
关键词
Data mining; Association rule; Formal concept analysis; GALOIS CONCEPT LATTICES; ALGORITHMS;
D O I
10.1007/978-3-319-51281-5_22
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The evolution of technology in this era has contributed to a growing of abundant data. Data mining is a well-known computational process in discovering meaningful and useful information from large data repositories. There are various techniques in data mining that can be deal with this situation and one of them is association rule mining. Formal Concept Analysis (FCA) is a method of conceptual knowledge representation and data analysis. It has been applied in various disciplines including data mining. Extracting association rule from constructed FCA is very promising study but it is quite challenging, not straight forward and nearly unfocused. Therefore, in this paper we proposed an Integrated Formal Concept Analysis-Association Rule Mining Model (FCA-ARMM) and an open source tool called FCA-Miner. The results show that FCA-ARMM with FCA-Miner successful in generating the association rule from the real dataset.
引用
收藏
页码:213 / 223
页数:11
相关论文
共 20 条
[1]  
Abdullah Z., 2011, ICSECS 2011 COMMUN 2, V188, P475
[2]  
Abdullah Z., 2014, LNEE, V285, P127
[3]   Mining significant association rules from educational data using critical relative support approach [J].
Abdullah, Zailani ;
Herawan, Tutut ;
Ahmad, Noraziah ;
Deris, Mustafa Mat .
WORLD CONFERENCE ON EDUCATIONAL TECHNOLOGY RESEARCHES-2011, 2011, 28
[4]  
Abdullah Z, 2010, LECT NOTES COMPUT SC, V6059, P324, DOI 10.1007/978-3-642-13577-4_28
[5]  
[Anonymous], 1998, BDA 1998 INT C ADV D
[6]  
[Anonymous], 2000, J. Comput. Res. Devel.
[7]   MAFIA: A maximal frequent itemset algorithm for transactional databases [J].
Burdick, D ;
Calimlim, M ;
Gehrke, J .
17TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2001, :443-452
[8]   INCREMENTAL CONCEPT-FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES [J].
GODIN, R ;
MISSAOUI, R ;
ALAOUI, H .
COMPUTATIONAL INTELLIGENCE, 1995, 11 (02) :246-267
[9]  
Liang JY, 2006, INT J COMPUT SCI NET, V6, P107
[10]  
Ourida B.B.S., 2011, INT J COMPUT SCI ISS, V8, P490