Skip to main content

Time-Fading Based High Utility Pattern Mining from Uncertain Data Streams

  • Conference paper

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 27))

Abstract

Recently, high utility pattern mining from data streams has become a great challenge to the data mining researchers due to rapid changes in technology. Data streams are continuous flow of data with rapid rate and huge volumes. There are mainly three widow models namely: Landmark window, sliding window and time-fading window used over the data streams in different applications. In many applications knowledge discovery from the data which is available in current window is required to respond quickly. Next the Landmark window keeps the information from the specific time point to the present time. Where as in time-fading model information is also captured from the landmark time to current time but it assigns the different weights to the different batches or transactions. Time-fading model is mainly suitable for mining the uncertain data which is generated by many sources like sensor data streams and so on. In this paper, we have proposed an approach using time-fading window model to mine high utility patterns from uncertain data streams.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gaber, M., Zaslavsky, A., Krishnaswamy, S.: Mining data streams: a review. ACM Sigmod Record 34(2), 18–26 (2005)

    Article  Google Scholar 

  2. Aggarwal, C.: Data streams: models and algorithms, vol. 31. Springer (2007)

    Google Scholar 

  3. Yao, H., Hamilton, H., Butz, C.: A foundational approach to mining itemset utilities from databases. In: The 4th SIAM International Conference on Data Mining, pp. 482–486 (2004)

    Google Scholar 

  4. Shie, B.E., Yu, P., Tseng, V.: Efficient algorithms for mining maximal high utility itemsets from data streams with different models. Expert Systems with Applications 39(17), 12947–12960 (2012)

    Article  Google Scholar 

  5. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, vol. 1215, pp. 487–499 (1994)

    Google Scholar 

  6. Ahmed, C., Tanbeer, S., Jeong, B.S.: Efficient mining of high utility patterns over data streams with a sliding window method, pp. 99–113 (2010)

    Google Scholar 

  7. Ahmed, C., Tanbeer, S., Jeong, B.S., Choi, H.J.: Interactive mining of high utility patterns over data streams. Expert Systems with Applications 39(15), 11979–11991 (2012)

    Article  Google Scholar 

  8. Leung, C.S., Jiang, F.: Frequent itemset mining of uncertain data streams using the damped window model. In: Proceedings of the 2011 ACM Symposium on Applied Computing, pp. 950–955. ACM (2011)

    Google Scholar 

  9. Aggarwal, C., Yu, P.: A survey of uncertain data algorithms and applications. IEEE Transactions on Knowledge and Data Engineering 21(5), 609–623 (2009)

    Article  Google Scholar 

  10. Chan, R., Yang, Q., Shen, Y.D.: Mining high utility itemsets. In: Third IEEE International Conference on Data Mining, ICDM 2003, pp. 19–26. IEEE (2003)

    Google Scholar 

  11. Liu, Y., Liao, W.K., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets, pp. 689–695 (2005)

    Google Scholar 

  12. Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.: Mining frequent patterns in data streams at multiple time granularities. Next Generation Data Mining 212, 191–212 (2003)

    Google Scholar 

  13. Tseng, V., Chu, C.J., Liang, T.: Efficient mining of temporal high utility itemsets from data streams. In: Second International Workshop on Utility-Based Data Mining, p. 18. Citeseer (2006)

    Google Scholar 

  14. Li, H.F., Huang, H.Y., Chen, Y.C., Liu, Y.J., Lee, S.Y.: Fast and memory efficient mining of high utility itemsets in data streams. In: Eighth IEEE International Conference on (ICDM), pp. 881–886. IEEE (2008)

    Google Scholar 

  15. Leung, C.K.-S., Jiang, F.: Frequent pattern mining from time-fading streams of uncertain data. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. LNCS, vol. 6862, pp. 252–264. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chiranjeevi Manike .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Manike, C., Om, H. (2014). Time-Fading Based High Utility Pattern Mining from Uncertain Data Streams. In: Kumar Kundu, M., Mohapatra, D., Konar, A., Chakraborty, A. (eds) Advanced Computing, Networking and Informatics- Volume 1. Smart Innovation, Systems and Technologies, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-319-07353-8_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07353-8_61

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07352-1

  • Online ISBN: 978-3-319-07353-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics