Granular association rules with four subtypes

  • Authors:
  • Fan Min;Qinghua Hu;William Zhu

  • Affiliations:
  • Lab of Granular Computing, Zhangzhou Normal University, 363000, China;Tianjin University, 300072, China;Lab of Granular Computing, Zhangzhou Normal University, 363000, China

  • Venue:
  • GRC '12 Proceedings of the 2012 IEEE International Conference on Granular Computing (GrC-2012)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.