Skip to main content

An Efficient Algorithm for High Utility Sequential Pattern Mining

  • Conference paper
  • First Online:
Frontier and Innovation in Future Computing and Communications

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 301))

Abstract

High utility sequential pattern mining is to mine sequences with high utility (e.g. profits) but probably with low frequency. In some applications such as marketing analysis, high utility sequential patterns are usually more useful than sequential patterns with high frequency. In this paper, we devise two pruning strategies RSU and PDU, and propose HUS-Span algorithm based on these two pruning strategies to efficiently identify high utility sequential patterns. Experimental results show that HUS-Span algorithm outperforms prior algorithms by pruning more low utility sequences.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.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

Notes

  1. 1.

    Due to the page limit, readers can refer to [2] for more details about LQS-Tree.

  2. 2.

    The details of PDU will be described in Sect. 7.3.3.

  3. 3.

    The details of RSU will be described in Sect. 7.3.2.

References

  1. Ahmed CF, Tanbeer SK, Jeong BS (2010) A novel approach for mining high-utility sequential patterns in sequence databases. ETRI J 32(5):676–686

    Article  Google Scholar 

  2. Yin J, Zheng Z, Cao L (2012) Uspan: an efficient algorithm for mining high utility sequential patterns. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 660–668

    Google Scholar 

  3. Shie BE, Hsiao HF, Tseng VS, Yu PS (2011) Mining high utility mobile sequential patterns in mobile commerce environments. In: Proceedings of the 16th international conference on Database systems for advanced applications, vol 1. pp 224–238

    Google Scholar 

  4. Kohavi R, Brodley CE, Frasca B, Mason L, Zheng Z (2000) Kdd-cup 2000 organizers’ report: peeling the onion. SIGKDD Explor Newsl 2(2):86–93

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiun-Long Huang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Wang, JZ., Yang, ZH., Huang, JL. (2014). An Efficient Algorithm for High Utility Sequential Pattern Mining. In: Park, J., Zomaya, A., Jeong, HY., Obaidat, M. (eds) Frontier and Innovation in Future Computing and Communications. Lecture Notes in Electrical Engineering, vol 301. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-8798-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-8798-7_7

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-017-8797-0

  • Online ISBN: 978-94-017-8798-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics