Advertisement

Mining Quantitative Associations in Large Database

  • Chenyong Hu
  • Yongji Wang
  • Benyu Zhang
  • Qiang Yang
  • Qing Wang
  • Jinhui Zhou
  • Ran He
  • Yun Yan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3399)

Abstract

Association Rule Mining algorithms operate on a data matrix to derive association rule, discarding the quantities of the items, which contains valuable information. In order to make full use of the knowledge inherent in the quantities of the items, an extension named Ratio Rules [6] is proposed to capture the quantitative association. However, the approach, which is addressed in [6], is mainly based on Principle Component Analysis (PCA) and as a result, it cannot guarantee that the ratio coefficient is non-negative. This may lead to serious problems in the association rules’ application. In this paper, a new method, called Principal Non-negative Sparse Coding (PNSC), is provided for learning the associations between itemsets in the form of Ratio Rules. Experiments on several datasets illustrate that the proposed method performs well for the purpose of discovering latent associations between itemsets in large datasets.

Keywords

Association Rule Principal Component Analysis Association Rule Mining Nonnegative Matrix Factorization Latent Association 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD , Washington, pp. 207–216 (1993)Google Scholar
  2. 2.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of VLDB 1994, Santiago,Chile, pp. 487–499 (1994)Google Scholar
  3. 3.
    Aumann, Y., Lindell, Y.: A statistical theory for quantitative association rules. In: Proceedings of KDD, pp. 261–270 (1999)Google Scholar
  4. 4.
    Guan, J.W., Bell, D.A., Liu, D.Y.: The Rough Set Approach to Association Rule Mining. In: Proceedings of the Third IEEE International Conference on Data Mining, Melbourne, Florida, pp. 529–532 (2003)Google Scholar
  5. 5.
    Han, J., Fu, Y.: Discovery of Multiple-Level Association Rules from Large Databases. in: Proceedings of the VLDB 1995, 420–431 (1995)Google Scholar
  6. 6.
    Korn, F., Labrinidis, A., Kotidis, Y., Faloutsos, C.: Quantifiable Data Mining Using Principal Component Analysis. In: Proceedings of VLDB, pp. 582–593 (1998)Google Scholar
  7. 7.
    Lee, D.D., Seung, H.S.: Algorithms for nonnegative matrix factorization. In: Proceedings of the Advances in Neural Information Processing Systems, vol. 13, pp. 556–562. MIT Press, Cambridge (2001)Google Scholar
  8. 8.
    Li, W., Han, J., Pe, J.: CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules. In: Proceedings of the 2001 Int. Conf. on Data Mining (ICDM 2001), San Jose, CA, pp. 369–376 (2001)Google Scholar
  9. 9.
    Lin, J., Dunham, M.H.: Mining association rules: Anti-skew algorithms. In: Proceedings of the Intl. Conf. on Data Engineering, pp. 486–493 (1998)Google Scholar
  10. 10.
    Otey, M.E., Wang, C., Parthasarathy, S., et al.: Mining Frequent Itemsets in Distributed and Dynamic Databases. In: Proceedings of the ICDM 2003, pp. 617–620 (2003)Google Scholar
  11. 11.
    Kaya, M., Alhajj, R.: Facilitating Fuzzy Association Rules Mining by Using Multi-Objective Genetic Algorithms for Automated Clustering. In: Proceedings of the ICDM 2003, pp. 561–564 (2003)Google Scholar
  12. 12.
    Ng, E.K.K., Fu, A.W.-C., Wang, K.: Mining Association Rules from Stars. In: Proceedings of the 2nd IEEE Intl. Conf. on Data Mining, Maebashi, Japan, pp. 322–329 (2002)Google Scholar
  13. 13.
    Olshausen, B.A., Field, D.J.: Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature 381, 607–609 (1996)CrossRefGoogle Scholar
  14. 14.
    Patrik, O.: Hoyer. Non-negative sparse coding. In: Proc. IEEE Workshop on Neural Networks for Signal Processing, Martigny, Switzerland (2002)Google Scholar
  15. 15.
    Schuster, A., Wolff, R., Trock, D.: A High-Performance Distributed Algorithm for Mining Association Rules. In: Proceedings of the ICDM 2003, pp. 291–298 (2003)Google Scholar
  16. 16.
    Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: Proceedings of the the ACM SIGMOD international conference on Management of data, pp. 1–12 (1996)Google Scholar
  17. 17.
    Wang, H., Perng, C.S., Ma, S., Yu, P.S.: Mining Associations by Pattern Structure in Large Relational Tables. In: Proceedings of the 2nd IEEE Intl. Conf. on Data Mining, Maebashi, Japan, pp. 482–489 (2002)Google Scholar
  18. 18.
    Wolff, R., Schuster, A.: Association Rule Mining in Peer-to-Peer Systems. In: Proceedings of the ICDM 2003, pp. 291–298 (2003)Google Scholar
  19. 19.
    Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New parallel algorithms for fast discovery of association rules. Data Mining and Knowledge Discovery: An International Journal 4(1), 343–373 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Chenyong Hu
    • 1
  • Yongji Wang
    • 1
  • Benyu Zhang
    • 2
  • Qiang Yang
    • 3
  • Qing Wang
    • 1
  • Jinhui Zhou
    • 1
  • Ran He
    • 1
  • Yun Yan
    • 4
  1. 1.Lab for Internet Software Technologies, Institute of SoftwareChinese Academy of SciencesBeijing
  2. 2.Microsoft Research AsiaBeijingP.R. China
  3. 3.Department of Computer ScienceHong Kong University of Science and Technology 
  4. 4.LMAM, Department of Information Science, School of Mathematical SciencePeking UniversityBeijing

Personalised recommendations