DocumentCode :
3431620
Title :
Granular association rules with four subtypes
Author :
Min, Fan ; Hu, Qinghua ; Zhu, William
Author_Institution :
Lab of Granular Computing, Zhangzhou Normal University, 363000, China
fYear :
2012
fDate :
11-13 Aug. 2012
Firstpage :
353
Lastpage :
358
Abstract :
Relational data mining approaches look for patterns that involve multiple tables; therefore they become popular in recent years. In this paper, we introduce granular association rules to reveal connections between concepts in two universes. An example of such an association might be “men like alcohol.” We present four meaningful explanations corresponding to four subtypes of granular association rules. We also define five measures to evaluate the quality of rules. Based on these measures, the relationships among different subtypes are revealed. This work opens a new research trend concerning granular computing and associate rule mining.
Keywords :
Argon; Artificial intelligence; Context; Granular computing; complete match; granular association rule; partial match; relational data mining;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Granular Computing (GrC), 2012 IEEE International Conference on
Conference_Location :
Hangzhou, China
Print_ISBN :
978-1-4673-2310-9
Type :
conf
DOI :
10.1109/GrC.2012.6468630
Filename :
6468630
Link To Document :
بازگشت