Skip to main content
SpringerLink
Log in

An Improvement of Posteriori

  • Conference paper
Fuzzy Systems and Knowledge Discovery (FSKD 2006)

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

Included in the following conference series:

  • 1129 Accesses

Abstract

Interactive mining, which is the problem of mining frequent itemsets in a database under different thresholds, is becoming one of the interesting topics in frequent itemsets mining because of needs of practical application. In this paper, we propose a heuristic method for greatly decreasing the number of possible candidates in Poteriori, which is an algorithm based on Apriori for interactive mining. Fewer possible candidates make Poteriori more efficient. Analysis based on an example shows the advantage of our method.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000, pp. 1–12 (2000)

    Google Scholar 

  2. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Set of Items in Large Databases. In: SIGMOD 1993, pp. 207–216 (1993)

    Google Scholar 

  3. Liu, J., Yin, J.: Towards efficient data re-mining (DRM). In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, pp. 406–412. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Agrawal, R., Srikant, R.: Fast algorithm for mining Association rules. In: VLDB 1994, pp. 487–499 (1994)

    Google Scholar 

  5. Bayardo, R.J.: Efficiently mining long patterns from databases. In: SIGMOD 1998, pp. 85–93 (1998)

    Google Scholar 

  6. Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: ICDE 2001, pp. 443–452 (2001)

    Google Scholar 

  7. Zaki, M., Hsiao, C.: CHARM: An efficient algorithm for closed itemset mining. In: SDM 2002, pp. 12–28 (2002)

    Google Scholar 

  8. Wang, J.Y., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: SIGKDD 2003, pp. 236–245 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Laboratory of Machine Perception, School of Electronics Engineering and Computer Science, Peking University, Beijing, 100871, China

    Zhi-Hong Deng

Authors
  1. Zhi-Hong Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University,, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

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

    Licheng Jiao

  3. School of Electrical and Electronic Engineering, Xidian University, 710071, Xi’an, China

    Guanming Shi

  4. School of Information Technology and Electrical Engineering, The University of Queensland, 4072, Brisbane, Queensland, Australia

    Xue Li

  5. College of Mathematics and Information Science, Hebei Normal University, 050016, Shijiazhuang, Hebei, P.R. China

    Jing Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deng, ZH. (2006). An Improvement of Posteriori. In: Wang, L., Jiao, L., Shi, G., Li, X., Liu, J. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2006. Lecture Notes in Computer Science(), vol 4223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881599_63

Download citation

  • DOI: https://doi.org/10.1007/11881599_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45916-3

  • Online ISBN: 978-3-540-45917-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation