Skip to main content

Classification of Contradiction Patterns

  • Conference paper
Book cover Advances in Data Analysis

Abstract

Solving conflicts between overlapping databases requires an understanding of the reasons that lead to the inconsistencies. Provided that conflicts do not occur randomly but follow certain regularities, patterns in the form of “If condition Then conflict” provide a valuable means to facilitate their understanding. In previous work, we adopt existing association rule mining algorithms to identify such patterns. Within this paper we discuss extensions to our initial approach aimed at identifying possible update operations that caused the conflicts between the databases. This is done by restricting the items used for pattern mining. We further propose a classification of patterns based on mappings between the contradicting values to represent special cases of conflict generating updates.

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

  • FAN, W., LU, H., MADNICK, S.E. and CHEUNG, D. (2001): Discovering and Reconciling Value Conflicts for Numerical Data Integration. Information Systems, 26, 635–656.

    Article  MATH  Google Scholar 

  • FELLEGI, P. and HOLT, D. (1976): A Systematic Approach to Automatic Edit and Imputation. Journal of the American Statistical Association, 71, 17–35.

    Article  Google Scholar 

  • HERNANDEZ, M.A. and STOLFO, S.J. (1995): The Merge/Purge Problem for Large Databases. Proc. Int. Conf. Management of Data (SIGMOD). San Jose, California.

    Google Scholar 

  • MÜLLER, H., LESER, U. and FREYTAG, J.-C. (2004): Mining for Patterns in Contradictory Data. Proc. SIGMOD Int. Workshop on Information Quality for Information Systems (IQIS’04). Paris, France.

    Google Scholar 

  • PAN, F., CONG, G., TUNG, A.K.H., YANG, J. and ZAKI, M.J. (2003): CARPENTER: Finding Closed Patterns in Long Biological Datasets. Proc. Int. Conf. on Knowledge Discovery and Data Mining (SIGKDD). Washington DC.

    Google Scholar 

  • ZAKI, M.J. (2002): CHARM: An Efficient Algorithm for Closed Itemset Mining. Proc. of the Second SIAM Int. Conf. on Data Mining. Arlington, VA.

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

About this paper

Cite this paper

Müller, H., Leser, U., Freytag, JC. (2007). Classification of Contradiction Patterns. In: Decker, R., Lenz, H.J. (eds) Advances in Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70981-7_20

Download citation

Publish with us

Policies and ethics