Skip to main content
SpringerLink
Log in

Discovery of Fuzzy Temporal Associations in Multiple Data Streams

  • Conference paper
Soft Computing: Methodologies and Applications

Part of the book series: Advances in Soft Computing ((AINSC,volume 32))

5 Conclusion

Temporal antecedent and implicative constraints are required to ensure the relevancy of events in analyzing temporal data from multiple sources. Fuzzy predicates are used to represent imprecise temporal constraints and durations and a fuzzy partitions provide a hierarchy that allows the analysis of implicative constraints on several levels of granularity. In this paper we have outlined how standard data mining strategies can be adapted to utilize fuzzy representations in the discovery of imprecise temporal relationships between data obtained from multiple sources.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Peter Buneman and Sushil Jajodia, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207–216, Washington, D.C., 26–28 1993.

    Google Scholar 

  2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo, editors, Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pp. 487–499, Santiago, Chile, Sept 1994.

    Google Scholar 

  3. R. Agrawal and R. Srikant. Mining sequential patterns. In P. S. Yu and A. S. P. Chen, editors, Eleventh International Conference on Data Engineering, pp. 3–14, Taipei, Taiwan, 1995. IEEE Computer Society Press.

    Google Scholar 

  4. J. M. Ale and G. J. Rossi. An approach to discovering temporal association rules. In Proceedings of the 2000 ACM Symposium on Applied Computing, pp. 294–300, Como, Italy, March 2000.

    Google Scholar 

  5. C. Bettini, X. S. Wang, and S. Jajodia. Mining temporal relationships with multiple granularities in time sequences. Bulletin of the IEEE Computer Society Committee on Data Engineering, 21(1):32–38, 1998.

    MathSciNet  Google Scholar 

  6. K. C. C. Chan and W.-H. Au. An effective algorithm for mining interesting quantitative association rules. In Selected Areas in Cryptography, pp. 88–90, 1997.

    Google Scholar 

  7. M. Delgado, N. Marín, D. Sánchez, and M. A. Vila. Fuzzy association rules: General model and applications. IEEE Transactions on Fuzzy Systems, pp. 214–225, 2003.

    Google Scholar 

  8. J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time series database. In Fifteenth International Conference on Data Engineering, pp. 106–115, Sydney, Australia, 1999. IEEE Computer Society.

    Google Scholar 

  9. J. Han, W. Gong, and Y. Yin. Mining segment-wise periodic patterns in time-related databases. In Proc. Intl. Conf. Knowledge and Data Mining, pp. 1–12, New York, August 1998.

    Google Scholar 

  10. C. M. Kuok, A. W.-C. Fu, and M. H. Wong. Mining fuzzy association rules in databases. SIGMOD Record, 27(1):41–46, 1998.

    Article  Google Scholar 

  11. J. H. Lee and H. L. Kwang. An extension of association rules using fuzzy sets. In Proceedings of IFSA 1997, pp. 399–402, Prague, June 1997.

    Google Scholar 

  12. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episodes in sequences. In Proc. Intl. Conf. on Knowledge Discovery and Data Mining, pp. 210–215, Montreal, August 1995. AAAI Press.

    Google Scholar 

  13. R. J. Miller and Y. Yang. Association rules over interval data. In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, pp. 452–461, Tuscon, AR, May 1997. ACM Press.

    Google Scholar 

  14. B. Ozden, S. Ramaswamy, and A. Silberschatz. Cyclic association rules. In ICDE, pp. 412–421, 1998.

    Google Scholar 

  15. G. Piatetsky-Shapiro. Discovey, analysis, and presentation of strong rules. In G. Piatetsky-Shapiro and W. Frawley, editors, Knowledge Discovery in Databases, pp. 229–248. AAAI/MIT Press, Menlo Park, CA, 1991.

    Google Scholar 

  16. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In H. V. Jagadish and I. S. Mumick, editors, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 1–12, Montreal, 1996.

    Google Scholar 

  17. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In P. M. G. Apers, M. Bouzeghoub, and G. Gardarin, editors, Proc. 5th Int. Conf. Extending Database Technology, EDBT, Vol. 1057, pp. 3–17. Springer-Verlag, 25–29 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Wright State University, Dayton, OH, USA

    Thomas Sudkamp

Authors
  1. Thomas Sudkamp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Elektrotechnik und Informationstechnik, Lehrstuhl für Elektrische Steuerung und Regelung, Universität Dortmund, Otto-Hahn-Str. 4, 44227, Dortmund, Germany

    Frank Hoffmann

  2. Fraunhofer IPK, Berlin

    Mario Köppen

  3. Institut für Sicherheits-/Prüftechnik, Pascalstr. 8-9, 10587, Berlin, Germany

    Mario Köppen

  4. FH Braunschweig/Wolfenbüttel, Salzdahlumer Str. 46/48, 38302, Wolfenbüttel, Germany

    Frank Klawonn

  5. Enterprise Integration, Cranfield University, Cranfield, Bedford, MK43 0AL, UK

    Rajkumar Roy

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sudkamp, T. (2005). Discovery of Fuzzy Temporal Associations in Multiple Data Streams. In: Hoffmann, F., Köppen, M., Klawonn, F., Roy, R. (eds) Soft Computing: Methodologies and Applications. Advances in Soft Computing, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32400-3_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-32400-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25726-4

  • Online ISBN: 978-3-540-32400-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation