Skip to main content

Estimating Prevalence Bounds of Temporal Association Patterns to Discover Temporally Similar Patterns

  • Conference paper
  • First Online:
Recent Advances in Soft Computing (ICSC-MENDEL 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 576))

Included in the following conference series:

Abstract

Mining Temporal Patterns from temporal databases is challenging as it requires handling efficient database scan. A pattern is temporally similar when it satisfies subset constraints. The naive and apriori algorithm designed for non-temporal databases cannot be extended to find similar temporal patterns from temporal databases. The brute force approach requires computing \(2^n\) true support combinations for ā€˜nā€™ items from finite item set and falls in NP-class. The apriori or fp-tree based approaches are not directly extendable to temporal databases to obtain similar temporal patterns. In this present research, we come up with novel approach to discover temporal association patterns which are similar for pre-specified subset constraints, and substantially reduce support computations by defining expressions to estimate support bounds. The proposed approach eliminates computational overhead in finding similar temporal patterns. The results prove that the proposed method outperforms brute force 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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Jin, L., Lee, Y., Seo, S., Ryu, K.H.: Discovery of temporal frequent patterns using TFP-tree. In: Yu, J.X., Kitsuregawa, M., Leong, H.V. (eds.) WAIM 2006. LNCS, vol. 4016, pp. 349ā€“361. Springer, Heidelberg (2006). doi:10.1007/11775300_30

    ChapterĀ  Google ScholarĀ 

  2. Hirano, S., Tsumoto, S.: Mining similar temporal patterns in long time-series data and its application to medicine. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2003, pp. 219ā€“226 (2002)

    Google ScholarĀ 

  3. Yoo, J.S., Shekhar, S.: Similarity-profiled temporal association mining. IEEE Trans. Knowl. Data Eng. 21(8), 1147ā€“1161 (2009)

    ArticleĀ  Google ScholarĀ 

  4. Chen, Y.C., Peng, W.C., Lee, S.Y.: Mining temporal patterns in time interval-based data. IEEE Trans. Knowl. Data Eng. 27(12), 3318ā€“3331 (2015)

    ArticleĀ  Google ScholarĀ 

  5. Yoo, J.S., Shekhar, S.: Mining temporal association patterns under a similarity constraint. In: LudƤscher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol. 5069, pp. 401ā€“417. Springer, Heidelberg (2008). doi:10.1007/978-3-540-69497-7_26

    ChapterĀ  Google ScholarĀ 

  6. Yoo, J.S.: Temporal data mining: similarity-profiled association pattern. Data Mining: Foundations and Intelligent Paradigms. Intelligent Systems Reference Library, vol. 23, pp 29ā€“47 (2012)

    Google ScholarĀ 

  7. Radhakrishna, V., Kumar, P.V., Janaki, V.: A Survey on temporal databases and data mining. In: Proceedings of the International Conference on Engineering & MIS 2015 (ICEMIS 2015), Article 52, 6 pages. ACM, New York (2015). doi:10.1145/2832987.2833064

  8. Radhakrishna, V., Kumar, P.V., Janaki, V.: A novel approach for mining similarity profiled temporal association patterns using venn diagrams. In: Proceedings of the International Conference on Engineering & MIS 2015 (ICEMIS 2015), Article 58, 9 pages. ACM, New York (2015). doi:10.1145/2832987.2833071

  9. Radhakrishna, V., Kumar, P.V., Janaki, V.: An approach for mining similarity profiled temporal association patterns using gaussian based dissimilarity measure. In: Proceedings of the International Conference on Engineering & MIS 2015 (ICEMIS 2015), Article 57, 6 pages. ACM, New York (2015). doi:10.1145/2832987.2833069

  10. Radhakrishna, V., Kumar, P.V., Janaki, V.: A novel approach for mining similarity profiled temporal association patterns. Rev. TĆ©c. Ing. Univ. Zulia. 38(3), 80ā€“93 (2015)

    Google ScholarĀ 

  11. Calders, T.: Deducing bounds on the support of itemsets. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds.) Database Support for Data Mining Applications. LNCS (LNAI), vol. 2682, pp. 214ā€“233. Springer, Heidelberg (2004). doi:10.1007/978-3-540-44497-8_11

    ChapterĀ  Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vangipuram Radhakrishna .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2017 Springer International Publishing AG

About this paper

Cite this paper

Radhakrishna, V., Kumar, P.V., Janaki, V., Rajasekhar, N. (2017). Estimating Prevalence Bounds of Temporal Association Patterns to Discover Temporally Similar Patterns. In: MatouŔek, R. (eds) Recent Advances in Soft Computing. ICSC-MENDEL 2016. Advances in Intelligent Systems and Computing, vol 576. Springer, Cham. https://doi.org/10.1007/978-3-319-58088-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-58088-3_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-58087-6

  • Online ISBN: 978-3-319-58088-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics