Skip to main content
SpringerLink
Log in

A Fast Algorithm for Mining Share-Frequent Itemsets

  • Conference paper
Web Technologies Research and Development - APWeb 2005 (APWeb 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3399))

Included in the following conference series:

Abstract

Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total profit or total customer purchased quantity associated with an itemset in database. The discovery of share-frequent itemsets does not have the downward closure property. Existing algorithms for discovering share-frequent itemsets are inefficient or do not find all share-frequent itemsets. Therefore, this study proposes a novel Fast Share Measure (FSM) algorithm to efficiently generate all share-frequent itemsets. Instead of the downward closure property, FSM satisfies the level closure property. Simulation results reveal that the performance of the FSM algorithm is superior to the ZSP algorithm two to three orders of magnitude between 0.2% and 2% minimum share thresholds.

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

  • Agarwal, R.C., Aggarwal, C.C., Prasad, V.V.V.: A Tree Projection Algorithm for Generation of Frequent Itemsets. Journal of Parallel and Distributed Computing 61, 350–361 (2001)

    Article  MATH  Google Scholar 

  • Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. 1993 ACM SIGMOD Intl. Conf. on Management of Data, Washington, D.C. pp. 207–216 (1993)

    Google Scholar 

  • Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. 20th Intl. Conf. on Very Large Data Bases, Santiago, Chile, pp. 487–499 (1994)

    Google Scholar 

  • Barber, B., Hamilton, H.J.: Algorithms for mining share frequent itemsets containing infrequent subsets. In: Zighed, D.A., Komorowski, J., Å»ytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 316–324. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  • Barber, B., Hamilton, H.J.: Parametric Algorithm for Mining Share Frequent Itemsets. Journal of Intelligent Information Systems 16, 277–293 (2001)

    Article  MATH  Google Scholar 

  • Barber, B., Hamilton, H.J.: Extracting Share Frequent Itemsets with Infrequent Subsets. Data Mining and Knowledge Discovery 7, 153–185 (2003)

    Article  MathSciNet  Google Scholar 

  • Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. In: Proc. 1997 ACM SIGMOD Intl. Conf. on Management of Data, Tucson, AZ, pp. 255–264 (1997)

    Google Scholar 

  • Berzal, F., Cubero, J.C., Marín, N., Serrano, J.M.: TBAR: An Efficient Method for Association Rule Mining in Relational Databases. Data & Knowledge Engineering 37, 47–64 (2001)

    Article  MATH  Google Scholar 

  • Carter, C.L., Hamilton, H.J., Cercone, N.: Share Based Measures for Itemsets. In: Komorowski, J., Å»ytkow, J.M. (eds.) PKDD 1997. LNCS, vol. 1263, pp. 14–24. Springer, Heidelberg (1997)

    Google Scholar 

  • Chen, M.S., Han, J., Yu, P.S.: Data Mining: An Overview from a Database Perspective. IEEE Trans. Knowledge Data Engineering 8, 866–883 (1996)

    Article  Google Scholar 

  • Grahne, G., Zhu, J.: Efficient using Prefix-Tree in Mining Frequent Itemsets. In: Proc. IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Melbourne, FL (2003)

    Google Scholar 

  • Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent Pattern Tree Approach. Data Mining and Knowledge Discovery 8, 53–87 (2004)

    Article  MathSciNet  Google Scholar 

  • Hilderman, R.J.: Predicting Itemset Sales Profiles with Share Measures and Repeat-Buying Theory. In: Liu, J., Cheung, Y.-m., Yin, H. (eds.) IDEAL 2003. LNCS, vol. 2690, pp. 789–795. Springer, Heidelberg (2003)

    Google Scholar 

  • Hilderman, R.J., Carter, C.L., Hamilton, H.J., Cercone, N.: Mining Association Rules from Market Basket Data using Share Measures and Characterized Itemsets. Intl. Journal of Artificial Intelligence Tools 7, 189–220 (1998)

    Article  Google Scholar 

  • Liu, J., Pan, Y., Wang, K., Han, J.: Mining Frequent Item Sets by Opportunistic Projection. In: Proc. 8th ACM-SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, Alberta, Canada, pp. 229–238 (2002)

    Google Scholar 

  • Park, J.S., Chen, M.S., Yu, P.S.: An Effective Hash-Based Algorithm for Mining Association Rules. In: Proc. 1995 ACM-SIGMOD Intl. Conf. on Management of Data, San Jose, CA, pp. 175–186 (1995)

    Google Scholar 

  • Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases. In: Proc. 2001 IEEE Intl. Conf. on Data Mining, San Jose, CA, pp. 441–448 (2001)

    Google Scholar 

  • http://alme1.almaden.ibm.com/software/quest/Resources/datasets/syndata.html

  • http://www.cse.cuhk.edu.hk/~kdd/data/IBM_VC++.zip

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, 621, Taiwan

    Yu-Chiang Li & Chin-Chen Chang

  2. Department of Computer Science and Information Management, Providence University, Taichung, 433, Taiwan

    Jieh-Shan Yeh

  3. Department of Computer Science and Information Engineering, Feng Chia University, Taichung, 407, Taiwan

    Chin-Chen Chang

Authors
  1. Yu-Chiang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jieh-Shan Yeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chin-Chen Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Victoria University, Australia

    Yanchun Zhang

  2. University of Kyoto, Japan

    Katsumi Tanaka

  3. Chinese University of Hong Kong, Hong Kong, China

    Jeffrey Xu Yu

  4. Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE, 100872, Beijing, P.R. China

    Shan Wang

  5. Department of Computer Science and Engineering, Shanghai Jiatong University, 80 Dongcuan Road, 200240, Shanghai, China

    Minglu Li

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, YC., Yeh, JS., Chang, CC. (2005). A Fast Algorithm for Mining Share-Frequent Itemsets. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds) Web Technologies Research and Development - APWeb 2005. APWeb 2005. Lecture Notes in Computer Science, vol 3399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31849-1_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31849-1_41

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31849-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation