Skip to main content

Towards a Framework for Change Detection in Data Sets

  • Conference paper
Research and Development in Intelligent Systems XXIII (SGAI 2006)

Abstract

Since the world with its markets, innovations and customers is changing faster than ever before, the key to survival for businesses is the ability to detect, assess and respond to changing conditions rapidly and intelligently. Discovering changes and reacting to or acting upon them before others do has therefore become a strategical issue for many companies. However, existing data analysis techniques are insufflent for this task since they typically assume that the domain under consideration is stable over time. This paper presents a framework that detects changes within a data set at virtually any level of granularity. The underlying idea is to derive a rule-based description of the data set at different points in time and to subsequently analyse how these rules change. Nevertheless, further techniques are required to assist the data analyst in interpreting and assessing their changes. Therefore the framework also contains methods to discard rules that are non-drivers for change and to assess the interestingness of detected changes.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal R., Imielinski T., Swami A. Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pages 207–216, Washington D.C., May 1993.

    Google Scholar 

  2. Agrawal R., Psaila G. Active data mining. In KDD 1995, pages 3 8, 1995.

    Google Scholar 

  3. Dong, G., Li, S. Efficient mining of emerging patterns: discovering trends and differences. In Proc. of the 5th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, pages 43–52, 1999.

    Google Scholar 

  4. Zhang, X., Dong, G., Kotagiri, R. Exploring constraints to efficiently mine emerging patterns from large high-dimensional datasets. In Proc. of the 6th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, pages 310 314, 2000.

    Google Scholar 

  5. Au, W.-H., Chan K.C.C. Mining changes in association rules: a-fuzzy approach. Fuzzy Sets and Systems, 149(1):87–104, 2005.

    Article  MathSciNet  Google Scholar 

  6. Chakrabarti, S., Sarawagi, S., Dom, B. Mining surprising patterns using temporal description length. In Proc. of VLDB 1998, pages 606–617. Morgan Kaufmann Publishers, 1998.

    Google Scholar 

  7. Liu, B., Ma, Y., Lee, R. Analyzing the interestingness of association rules from the temporal dimension. In Proc. of IEEE ICDM 2001, pages 377 384, 2001.

    Google Scholar 

  8. Liu, B., Hsu, W., Ma, Y. Discovering the set of fundamental rule changes. In Proc. of the 7th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, pages 335–340, 2001.

    Google Scholar 

  9. Markou, M., Singh, S.Novelty detection: A review part 1: Statistical approaches. Signal Processing, 83(12):2481–2497, 2003.

    Article  MATH  Google Scholar 

  10. Chatfield, C. Time-Series Forecasting. Chapman and Hall/CRC, 2001.

    Google Scholar 

  11. Mann, H.B. Nonparametric tests against trend. Econometrica, 13:245 259, 1945.

    Article  MATH  MathSciNet  Google Scholar 

  12. Cox, D.R., Stuart, A. Some quick sign tests for trend in location and dispersion. Biometrika, 42:80–95, 1955.

    MATH  MathSciNet  Google Scholar 

  13. Böttcher, M., Spott, M., Nauck, D. Detecting temporally redundant association rules. In Proc. of 4th ICMLA, pages 397–403, Los Angeles, USA, 2005. IEEE Computer Society.

    Google Scholar 

  14. Webb, J.I. Efficient search for association rules.In Proc. of the 6th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, pages 99 107, 2000.

    Google Scholar 

  15. Tan, P.N., Kumar, V., Srivastava, J. Selecting the right objective measure for association analysis. Information Systems, 29(4):293–313, 2004.

    Article  Google Scholar 

  16. Spott, M., Nauck, D. On choosing an appropriate data analysis algorithm. In Proc. of FUZZ-IEEE 2005, pages 597–602, 2005. IEEE Computer Society.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag London Limited

About this paper

Cite this paper

Böttcher, M., Nauck, D., Ruta, D., Spott, M. (2007). Towards a Framework for Change Detection in Data Sets. In: Bramer, M., Coenen, F., Tuson, A. (eds) Research and Development in Intelligent Systems XXIII. SGAI 2006. Springer, London. https://doi.org/10.1007/978-1-84628-663-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-663-6_9

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-662-9

  • Online ISBN: 978-1-84628-663-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics