Skip to main content

Mining Interesting Infrequent and Frequent Itemsets Based on Minimum Correlation Strength

  • Conference paper
Artificial Intelligence and Computational Intelligence (AICI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7002))

Abstract

IMLMS (interesting MLMS (Multiple Level Minimum Supports)) model, which was proposed in our previous works, is designed for pruning uninteresting infrequent and frequent itemsets discovered by MLMS model. One of the pruning measures used in IMLMS model, interest, can be described as follows: to two disjoint itemsets A,B, if interest(A,B)=|s(AB) - s(A)s(B)| <mi, then AB is recognized as uninteresting itemset and is pruned, where s(·) is the support and mi a minimum interestingness threshold. This measure, however, is a bit difficult for users to set the value mi because interest (A,B) highly depends on the values of s(·). So in this paper, we propose a new measure, MCS (minimum correlation strength) as asubstitute. MCS, whichis based on correlation coefficient, has better performance than interest and it is very easy for users to set its value. The theoretical analysis and experimental results show the validity of the new measure.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Database. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207–216. ACM Press, New York (1993)

    Chapter  Google Scholar 

  2. Wu, X., Zhang, C., Zhang, S.: Efficient Mining of both Positive and Negative Association Rules. ACM Transactions on Information Systems, 381–405 (2004)

    Google Scholar 

  3. Dong, X., Niu, Z., Shi, X., Zhang, X., 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)

    Chapter  Google Scholar 

  4. Dong, X., Wang, S., Song, H.: 2-level Support based Approach for Mining Positive & Negative Association Rules. Computer Engineering, 16–18 (2005)

    Google Scholar 

  5. Dong, X., Zheng, Z., Niu, Z., Jia, Q.: Mining Infrequent Itemsets based on Multiple Level Minimum Supports. In: Proceedings of the Second International Conference on Innovative Computing, Information and Control (ICICIC 2007), Kumamoto (2007)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  7. Tan, P.-N., Kumar, V., Srivastava, J.: Selecting the Right Interestingness Measure for Association Patterns. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton (CA), pp. 32–41 (2002)

    Google Scholar 

  8. Tan, P.-N., Kumar, V., Srivastava, J.: Selecting the right objective measure for association analysis. Information Systems 29, 293–313 (2004)

    Article  Google Scholar 

  9. Hilderman, R.J., Hamilton, H.J.: Applying Objective Interestingness Measures in Data Mining Systems. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 432–439. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Geng, L., Hamilton, H.J.: Interestingness Measures for Data Mining: A Survey. ACM Computing Surveys 38(3), Article 9 (2006)

    Google Scholar 

  11. Antonie, M.-L., Zaïane, O.: 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)

    Chapter  Google Scholar 

  12. Piatetsky-Shapiro, G.: Discovery, analysis, and presentation of strong rules. In: Knowledge discovery in Databases, pp. 229–248. AAAI Press/MIT Press (1991)

    Google Scholar 

  13. Cohen, J.: Statistical Power Analysis for the Behavioral Sciences, 2nd edn. Lawrence Erlbaum, New Jersey (1988)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dong, X. (2011). Mining Interesting Infrequent and Frequent Itemsets Based on Minimum Correlation Strength. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23881-9_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23881-9_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23880-2

  • Online ISBN: 978-3-642-23881-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics