Skip to main content

Discovering Probabilistic Sequential Pattern in Uncertain Sequence Database

  • Conference paper
Advanced Research on Computer Science and Information Engineering (CSIE 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 153))

  • 1813 Accesses

Abstract

Sequence data are subject to uncertainties in many applications due to incompleteness and imprecision of data. We propose a novel formulation of probabilistic sequential pattern discovering problem and an algorithm UCMiner to discover probabilistic sequential pattern in uncertain sequence database. Extensive experiments evaluate the factors impact our techniques and shows that our approach is significantly faster than a naïve approach.

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 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.

Similar content being viewed by others

References

  1. Meger, N., Rigotti, C.: Constraint-based mining of episode rules and optimal window sizes. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 313–324. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Mannila, H., Toivonen, H.: Discovering generalized episodes using minimal occurrences. In: Proceedings of SIGKDD (1996)

    Google Scholar 

  3. Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceeding of the 1995 International Conference on Data Engineering (ICDE 1995), pp. 3–14. IEEE Computer Society Press, Washington, USA (1995)

    Google Scholar 

  4. Gong, C., Xindong, W.: Mining sequential patterns across time sequences. New Generatoin Computing 26, 75–96 (2008)

    MATH  Google Scholar 

  5. Aggarwal, C.C., Li, Y., Wang, J., Wang, J.: Frequent pattern mining with uncertain data. In: KDD, pp. 29–38 (2009)

    Google Scholar 

  6. Zhaonian, Z., Li, J., Hong, G., Shuo, Z.: Frequent subgraph pattern mining on uncertian graph data. In: Proceedings of CIKM (2009)

    Google Scholar 

  7. Cormode, G., McGregor, A.: Approximation algorithms for clustering uncertain data. In: PODS, pp. 191–200 (2008)

    Google Scholar 

  8. Tsang, S., Kao, B., Yip, K.Y., Ho, W.-S., Lee, S.D.: Decision trees for uncertain data. In: ICDE, pp. 441–444 (2009)

    Google Scholar 

  9. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized algorithms and probabilistic analysis. Cambridge University Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  10. http://archive.ics.uci.edu/ml/datasets/Molecular+Biology+%28Promoter+Gene+Sequences%29

  11. http://archive.ics.uci.edu/ml/datasets/Molecular+Biology+%28Splice-unction+Gene+Sequences%29

  12. http://archive.ics.uci.edu/ml/datasets/UNIX+User+Data

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wan, L. (2011). Discovering Probabilistic Sequential Pattern in Uncertain Sequence Database. In: Shen, G., Huang, X. (eds) Advanced Research on Computer Science and Information Engineering. CSIE 2011. Communications in Computer and Information Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21411-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21411-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21410-3

  • Online ISBN: 978-3-642-21411-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics