Skip to main content
SpringerLink
Log in
Book cover

International Conference on Intelligence and Security Informatics

ISI 2006: Intelligence and Security Informatics pp 650–651Cite as

Mining Weighted Sequential Patterns Based on Length-Decreasing Support Constraints

  • Conference paper

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

Abstract

We suggest an efficient weighted sequential pattern mining algorithm with length decreasing support constraints. Our approach is to push weight constraints and length decreasing support constraints to improve performance.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Masakazu, S., Karypis, G.: SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraints. In: ICDM 2002 (2002)

    Google Scholar 

  2. Yun, U., Leggett, J.J.: WFIM: Weighted Frequent Itemset Mining with a weight range and a minimum weight. In: SDM 2005 (April 2005)

    Google Scholar 

  3. Yun, U., Leggett, J.J.: WLPMiner: Weighted Frequent Pattern Mining with Length-decreasing support constraints. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 555–567. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Yun, U., Leggett, J.J.: WSpan: Weighted Sequential pattern mining in large sequence databases. In: IEEE IS 2006 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, Texas A&M University, College station, TX, 77843, USA

    Unil Yun, John J. Leggett & TeongJoo Ong

Authors
  1. Unil Yun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John J. Leggett
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. TeongJoo Ong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information and Computer Science, University of California, Irvine

    Sharad Mehrotra

  2. MIS Department, University of Arizona, 85721, Tucson, AZ, USA

    Daniel D. Zeng

  3. Department of Management Information Systems, Eller College of Management, The University of Arizona, 85721, AZ, USA

    Hsinchun Chen

  4. University of Texas at Dallas,  

    Bhavani Thuraisingham

  5. Chinese Academy of Sciences, 100190, Beijing, China

    Fei-Yue Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yun, U., Leggett, J.J., Ong, T. (2006). Mining Weighted Sequential Patterns Based on Length-Decreasing Support Constraints. In: Mehrotra, S., Zeng, D.D., Chen, H., Thuraisingham, B., Wang, FY. (eds) Intelligence and Security Informatics. ISI 2006. Lecture Notes in Computer Science, vol 3975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760146_74

Download citation

  • DOI: https://doi.org/10.1007/11760146_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34478-0

  • Online ISBN: 978-3-540-34479-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation