Granular association rules for multi-valued data

Granular association rule is a new approach to reveal patterns hide in many-to-many relationships of relational databases. Different types of data such as nominal, numeric and multi-valued ones should be dealt with in the process of rule mining. In this paper, we study multi-valued data and develop techniques to filter out strong however uninteresting rules. An example of such rule might be “male students rate movies released in 1990s that are not thriller.” This kind of rules, called negative granular association rules, often overwhelms positive ones which are more useful. To address this issue, we filter out negative granules such as “not thriller” in the process of granule generation. In this way, only positive granular association rules are generated and strong ones are mined. Experimental results on the movielens data set indicate that most rules are negative, and our technique is effective to filter them out.

[1]  William Zhu,et al.  Granular Association Rule Mining through Parametric Rough Sets , 2012, Brain Informatics.

[2]  Yiyu Yao,et al.  Information granulation for web-based information support systems , 2003, SPIE Defense + Commercial Sensing.

[3]  Andrzej Skowron,et al.  Approximation of Relations , 1993, RSKD.

[4]  Cherié L. Weible,et al.  The Internet Movie Database , 2001 .

[5]  David M. Pennock,et al.  Categories and Subject Descriptors , 2001 .

[6]  Yoav Shoham,et al.  Fab: content-based, collaborative recommendation , 1997, CACM.

[7]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[8]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[9]  Fan Min,et al.  Rough sets approach to symbolic value partition , 2008, Int. J. Approx. Reason..

[10]  Qinghua Hu,et al.  Granular association rules with four subtypes , 2012, 2012 IEEE International Conference on Granular Computing.

[11]  Yiyu Yao,et al.  A Granular Computing Paradigm for Concept Learning , 2013 .

[12]  Hannu Toivonen,et al.  Finding Frequent Substructures in Chemical Compounds , 1998, KDD.

[13]  Fei-Yue Wang,et al.  Reduction and axiomization of covering generalized rough sets , 2003, Inf. Sci..

[14]  Y. Yao,et al.  Information Granulation for Web based Information Retrieval Support Systems , 2003 .

[15]  Bart Goethals,et al.  Mining interesting sets and rules in relational databases , 2010, SAC '10.

[16]  Douglas B. Terry,et al.  Using collaborative filtering to weave an information tapestry , 1992, CACM.

[17]  Aristides Gionis,et al.  Mining chains of relations , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[18]  Lotfi A. Zadeh,et al.  Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic , 1997, Fuzzy Sets Syst..

[19]  Yiyu Yao,et al.  Measuring Retrieval Effectiveness Based on User Preference of Documents , 1995, J. Am. Soc. Inf. Sci..

[20]  Qinghua Hu,et al.  Granular association rules on two universes with four measures , 2012, ArXiv.

[21]  Y. Yao.  Granular Computing : basic issues and possible solutions , 2000 .