Skip to main content
SpringerLink
Log in

An FP-Tree Based Approach for Mining All Strongly Correlated Item Pairs

  • Conference paper
Computational Intelligence and Security (CIS 2005)

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

Included in the following conference series:

Abstract

Based on the FP-tree data structure, this paper presents an efficient algorithm for mining the complete set of positive correlated item pairs. Our experimental results on both synthetic and real world datasets show that, the performance of our algorithm is significantly better than that of the previously developed Taper algorithm over practical ranges of correlation threshold specifications.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Xiong, H., Shekhar, S., Tan, P.-N., Kumar, V.: Exploiting a Support-based Upper Bound of Pearson’s Correlation Coefficient for Efficiently Identifying Strongly Correlated Pairs. In: Proceedings of SIGKDD 2004, pp. 334–343 (2004)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proceedings of VLDB 1994, pp. 478–499 (1994)

    Google Scholar 

  3. Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering 12(3), 372–390 (2000)

    Article  MathSciNet  Google Scholar 

  4. Han, J., Pei, J., Yin, J.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of SIGMOD 2000, pp. 1–12 (2000)

    Google Scholar 

  5. Brin, S., Motwani, R., Silverstein, C.: Beyond Market Basket: Generalizing Association Rules to Correlations. In: Proceedings of SIGMOD 1997, pp. 265–276 (1997)

    Google Scholar 

  6. Ma, S., Hellerstein, J.L.: Mining Mutually Dependent Patterns. In: Proceedings of ICDM 2001, pp. 409–416 (2001)

    Google Scholar 

  7. Omiecinski, E.: Alternative Interest Measures for Mining Associations. IEEE Transactions on Knowledge and Data Engineering 15(1), 57–69 (2003)

    Article  MathSciNet  Google Scholar 

  8. Lee, Y.K., Kim, W.Y., Cai, Y.D., Han, J.: CoMine: Efficient Mining of Correlated Patterns. In: Proceedings of ICDM 2003, pp. 581–584 (2003)

    Google Scholar 

  9. Kim, W.Y., Lee, Y.K., Han, J.: CCMine: Efficient Mining of Confidence-Closed Correlated Patterns. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 569–579. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Merz, C.J., Merphy, P.: UCI Repository of Machine Learning Databases (1996), http://www.ics.uci.edu/~mlearn/MLRRepository.html

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Harbin Institute of Technology, China

    Zengyou He, Shengchun Deng & Xiaofei Xu

Authors
  1. Zengyou He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shengchun Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaofei Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yuping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security (Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

He, Z., Deng, S., Xu, X. (2005). An FP-Tree Based Approach for Mining All Strongly Correlated Item Pairs. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_108

Download citation

  • DOI: https://doi.org/10.1007/11596448_108

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30818-8

  • Online ISBN: 978-3-540-31599-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation