Mining Negative Association Rules from Multiple Data Sources on the Basis of Local Pattern Analysis

  • T. Ramkumar
  • S. Selvamuthukumaran
  • S. Hariharan
  • V. Harikrishnan
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 174)


While positive association rules identify the co-occurrences of frequent item-sets, negative association rules find out the negation relationships of frequent items-sets by forming occurrence of an item-set characterized by the absence of others. The notion of negative association rule is very useful in customer-driven domains such as market basket analysis for identifying products that conflict with each other. When data are scattered in multiple data sources that are located in different regions, negative relationships among frequent item-sets are very important for arriving decisions both at strategic and branch levels. This paper presents an approach for mining negative association rules from multiple data sources and synthesizing global negative association rules voted by most of the data sources. The proposal has been justified experimentally by using a bench marked database found in UCI machine learning repository.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adhikari, A., Rao, P.R.: Synthesizing heavy association rules from different real data sources. Pattern Recognition Letters 29, 59–71 (2008)CrossRefGoogle Scholar
  2. 2.
    Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of the Twentieth International Conference on Very Large Databases, Chile, pp. 478–499 (1994)Google Scholar
  3. 3.
    Antonie, M.-L., Zaïane, O.R.: Mining Positive and Negative Association Rules: An Approach for Confined Rules. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 27–38. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Brin, S., Motwani, R., Silverstein, C.: Beyond market basket: Generalizing association rules to correlations. In: Proceedings of SIGMOD, pp. 265–276 (1997)Google Scholar
  5. 5.
    Dong, X., Niu, Z., Shi, X., Zhang, X.-d., Zhu, D.: Mining Both Positive and Negative Association Rules from Frequent and Infrequent Itemsets. In: Alhajj, R., Gao, H., Li, X., Li, J., Zaïane, O.R. (eds.) ADMA 2007. LNCS (LNAI), vol. 4632, pp. 122–133. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Dong, X., Niu, Z., Zhu, D., Zheng, Z., Jia, Q.: Mining Interesting Infrequent and Frequent Itemsets Based on MLMS Model. In: Tang, C., Ling, C.X., Zhou, X., Cercone, N.J., Li, X. (eds.) ADMA 2008. LNCS (LNAI), vol. 5139, pp. 444–451. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Ramkumar, T., Srinivasan, R.: Modified algorithms for synthesizing high-frequency rules from different data sources. Knowledge and Information System 17, 313–334 (2008)CrossRefGoogle Scholar
  8. 8.
    Savasere, A., Omiecinski, E., Navathe, S.: Mining for strong negative associations in a large database of customer transactions. In: Proceedings of ICDE, pp. 494–502 (1998)Google Scholar
  9. 9.
    Wu, X., Zhang, C., Zhang, S.: Efficient Mining of both Positive and Negative Association Rules. ACM Transactions on Information Systems 22, 381–405 (2004)CrossRefGoogle Scholar
  10. 10.
    Wu, X., Zhang, S.: Synthesizing high-frequency rules from different data sources. IEEE Transactions on Knowledge and Data Engineering 15, 353–367 (2003)CrossRefGoogle Scholar
  11. 11.
    Zhang, S., Wu, X., Zhang, C.: Multi-Database Mining. IEEE Computational Intelligence Bulletin 2, 5–13 (2003)Google Scholar

Copyright information

© Springer India 2013

Authors and Affiliations

  • T. Ramkumar
    • 1
  • S. Selvamuthukumaran
    • 1
  • S. Hariharan
    • 2
  • V. Harikrishnan
    • 1
  1. 1.A.V.C. College of EngineeringMayiladuthuraiIndia
  2. 2.TRP Engineering CollegeTirichirappalliIndia

Personalised recommendations