Affiliations: [a] Lab for Internet Software Technologies, Institute of Software Chinese Academy of Sciences, Beijing, 100080, P.R. China. E-mail: [email protected], [email protected], [email protected] | [b] Microsoft Research Asia, 49 Zhichun Road, Beijing, 100080, P.R. China. E-mail: [email protected], [email protected] | [c] Department of Information Engineering, the Chinese University of Hong Kong, Hong Kong. E-mail: [email protected] | [d] Department of Computer Science, Hong Kong University of Science and Technology. E-mail: [email protected] | [e] Key Lab of Computer Science, Institute of Software Chinese Academy of Sciences, Beijing, China
Correspondence:
[*]
Corresponding author.
Abstract: Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To additionally capture the quantitative association knowledge, Korn et.al. recently propose a paradigm named Ratio Rules [6] for quantifiable data mining. However, their approach is mainly based on Principle Component Analysis (PCA), and as a result, it cannot guarantee that the ratio coefficients are non-negative. This may lead to serious problems in the rules' application. In this paper, we propose a new method, called Principal Sparse Non-negative Matrix Factorization (PSNMF), for learning the associations between itemsets in the form of Ratio Rules. In addition, we provide a support measurement to weigh the importance of each rule for the entire dataset. Experiments on several datasets illustrate that the proposed method performs well for discovering latent associations between itemsets in large datasets.
Keywords: Data mining, association rules, non-negative matrix factorization, principal sparse non-negative matrix factorization
