Skip to main content

Discovering Trends and Relationships among Rules

  • Conference paper
  • 923 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5690))

Abstract

Data repositories are constantly evolving and techniques are needed to reveal the dynamic behaviors in the data that might be useful to the user. Existing temporal association rules mining algorithms consider time as another dimension and do not describe the behavior of rules over time. In this work, we introduce the notion of trend fragment to facilitate the analysis of relationships among rules. Two algorithms are proposed to find the relationships among rules. Experiment results on both synthetic and real-world datasets indicate that our approach is scalable and effective.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baron, S., Spiliopoulou, M.: Monitoring Change in Mining Results. In: 3rd International Conference on Data Warehousing and Knowledge Discovery, pp. 51–60 (2001)

    Google Scholar 

  2. Baron, S., Spiliopoulou, M., Gunther, O.: Efficient Monitoring of Patterns in Data Mining Environments. In: 7th East European Conference on Advances in Databases and Information Systems, pp. 253–265 (2003)

    Google Scholar 

  3. Baron, S., Spiliopoulou, M.: Monitoring the Evolution of Web Usage Patterns. In: 1st European Web Mining Forum Workshop, pp. 181–200 (2003)

    Google Scholar 

  4. Spiliopoulou, M., Baron, S., Giinther, O.: Temporal Evolution and Local Patterns. In: International Seminar on Local Pattern Detection, pp. 190–206 (2005)

    Google Scholar 

  5. Liu, B., Ma, Y., Lee, R.: Analyzing the Interestingness of Association Rules from the Temporal Dimension. In: 1st IEEE International Conference on Data Mining, pp. 377–384 (2001)

    Google Scholar 

  6. Chen, X., Petrounias, I.: Mining Temporal Features in Association Rules. In: 3rd European Conference on Principles of Data Mining and Knowledge Discovery, pp. 295–300 (1999)

    Google Scholar 

  7. Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: 5th International Conference on Knowledge Discovery and Data Mining, pp. 43–52 (1999)

    Google Scholar 

  8. Mann, P.S.: Introductory Statistics. John Wiley & Sons, Chichester (2003)

    MATH  Google Scholar 

  9. Duke Statistics Dataset. http://www.stat.duke.edu/data-sets/mw/ts_data/all_exrates.html

  10. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: 20th International Conference on Very Large Databases, pp. 487–499 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, C., Hsu, W., Lee, M.L. (2009). Discovering Trends and Relationships among Rules. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2009. Lecture Notes in Computer Science, vol 5690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03573-9_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03573-9_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03572-2

  • Online ISBN: 978-3-642-03573-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics