Skip to main content
SpringerLink
Log in

Max-Pattern Mining

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Database Systems

  • 45 Accesses

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 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 487–99.

    Google Scholar 

  2. Agarwal RC, Aggarwal CC, Prasad VVV. Depth first generation of long patterns. In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2000. p. 108–18.

    Google Scholar 

  3. Bayardo RJ Jr. Efficiently mining long patterns from databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 85–93.

    Google Scholar 

  4. Burdick D, Calimlim M, Gehrke J. Mafia: a maximal frequent itemset algorithm for transactional databases. In: Proceedings of the 17th International Conference on Data Engineering; 2001. p. 443–52.

    Google Scholar 

  5. Gouda K, Zaki MJ. GenMax: efficiently mining maximal frequent itemsets. In: Proceedings of the 1st IEEE International Conference on Data Mining; 2001. p. 163–70.

    Google Scholar 

  6. Gunopulos D, Mannila H, Saluja S. Discovering all most specific sentences by randomized algorithms. In: Proceedings of the 6th International Conference on Database Theory; 1997. p. 215–29.

    Google Scholar 

  7. Lin DI, Kedem ZM. Pincer search: a new algorithm for discovering the maximum frequent set. In: Advances in Database Technology, Proceedings of the 1st International Conference on Extending Database Technology; 1998. p. 105–19.

    Google Scholar 

  8. Liu G, Lu H, Lou W, Xu Y, Yu JX. Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Min Knowl Disc. 2004;9(3):249–74.

    Article  MathSciNet  Google Scholar 

  9. Rymon R. Search through systematic set enumeration. In: Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning; 1992. p. 268–75.

    Google Scholar 

  10. Xiao Y, Yao JF, Li Z, Dunham MH. Efficient data mining for maximal frequent subtrees. In: Proceedings of the 3rd IEEE International Conference on Data Mining; 2003. p. 379–86.

    Google Scholar 

  11. Yang G. The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2004. p. 344–53.

    Google Scholar 

  12. Yang J, Wang W, Yu PS, Han J. Mining long sequential patterns in a noisy environment. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2002. p. 406–17.

    Google Scholar 

  13. Zaki MJ, Parthasarathy S, Ogihara M, Li W. New algorithms for fast discovery of association rules. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining; 1997. p. 283–6.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Infocomm Research, Singapore, Singapore

    Guimei Liu

Authors
  1. Guimei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guimei Liu .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. School of Computing Science, Simon Fraser Univ., Burnaby, British Columbia, Canada

    Jian Pei

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Liu, G. (2018). Max-Pattern Mining. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_216

Download citation

Publish with us

Policies and ethics

Search

Navigation