Skip to main content
SpringerLink
Log in

An Incremental Algorithm for Mining Closed Frequent Intervals

  • Conference paper
  • First Online:
Advanced Computational and Communication Paradigms

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

  • 957 Accesses

Abstract

Interval data are found in many real-life situations involving attributes like distance, time, etc. Mining closed frequent intervals from such data may provide useful information. Previous methods for finding closed frequent intervals assume that the data is static. In practice, the data in a dynamic database changes over time, with intervals being added and deleted continuously. In this paper, we propose an incremental method to mine frequent intervals from an interval database with n records, where each record represents one interval. This method assumes that intervals are added one by one into the database and each time an interval is added to the database, our proposed method will mine all the newly generated closed frequent intervals in O(n) time.

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

Access this chapter

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)

    Article  Google Scholar 

  2. Lin, J.L.: Mining maximal frequent intervals. In: Proceedings of ACM Symposium on Applied Computing, New York, USA, pp. 426–431 (2000)

    Google Scholar 

  3. Dutta, M.: Development of efficient algorithm for some problems in interval data mining. Ph.D. thesis, Department of Computer Science, Gauhati University, India (2012)

    Google Scholar 

  4. Sarmah, N.J., Mahanta, A.K.: An incremental approach for mining all closed intervals from an interval database. In: IEEE International Advance Computing Conference (IACC), pp. 529–532 (2014)

    Google Scholar 

  5. Mahanta, A.K., Dutta, M.: Mining closed frequent intervals from interval data. Int. J. Appl. Sci. Adv. Technol. 1(1), 1–3 (2012)

    Google Scholar 

  6. Sarma, N.J.: Study and design of algorithms for certain problems in interval data mining. Ph.D. thesis, Department of Computer Science, Gauhati University, India (2016)

    Google Scholar 

  7. De Souza, R.M.C.R., De Carvalho, F.D.A.T.: Clustering of interval data based on city–block distances. Pattern Recogn. Lett. 25, 353–365 (2004)

    Article  Google Scholar 

  8. Gowda, K.C., Diday, E.: Symbolic clustering using a new dissimilarity measure. Pattern Recogn. 24(6), 567–578 (1991)

    Article  Google Scholar 

  9. Ichino, M., Yaguchi, H.: Generalized Minkowski metrics for mixed feature-type data analysis. IEEE Trans. Syst. Man Cybern. 24, 698–708 (1994)

    Article  MathSciNet  Google Scholar 

  10. Roh, J.W., Yi, B.K.: Efficient indexing of interval time sequences. Inf. Process. Lett. 109(1), 1–12 (2008)

    Article  MathSciNet  Google Scholar 

  11. Sarmah, N.J., Mahanta, A.K.: An efficient algorithm for mining maximal sparse interval from interval dataset. Int. J. Comput. Appl. 107(16), 28–32 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Gauhati University, Guwahati, India

    Irani Hazarika & Anjana Kakoti Mahanta

Authors
  1. Irani Hazarika
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anjana Kakoti Mahanta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Irani Hazarika .

Editor information

Editors and Affiliations

  1. Department of Computer Application, RCC Institute of Information Technology, Kolkata, West Bengal, India

    Siddhartha Bhattacharyya

  2. Department of Computer Science and Engineering, University of Calcutta, Kolkata, West Bengal, India

    Nabendu Chaki

  3. Department of Computer Science and Engineering, Sikkim Manipal Institute of Technology, Majitar, Rangpo, Sikkim, India

    Debanjan Konar

  4. Department of Computer Science and Engineering, Sikkim Manipal Institute of Technology, Majitar, Rangpo, Sikkim, India

    Udit Kr. Chakraborty

  5. Department of Computer Science and Engineering, Sikkim Manipal Institute of Technology, Majitar, Rangpo, Sikkim, India

    Chingtham Tejbanta Singh

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hazarika, I., Mahanta, A.K. (2018). An Incremental Algorithm for Mining Closed Frequent Intervals. In: Bhattacharyya, S., Chaki, N., Konar, D., Chakraborty, U., Singh, C. (eds) Advanced Computational and Communication Paradigms. Advances in Intelligent Systems and Computing, vol 706. Springer, Singapore. https://doi.org/10.1007/978-981-10-8237-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-8237-5_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-8236-8

  • Online ISBN: 978-981-10-8237-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation