Abstract
High quality of master data is crucial for almost every company and it has become increasingly difficult for domain experts to validate the quality and extract useful information out of master data sets. However, experts are rare and expensive for companies and cannot be aware of all dependencies in the master data sets. In this paper, we introduce a complete process which applies association rule mining in the area of master data to extract such association dependencies for quality assessment. It includes the application of the association rule mining algorithm to master data and the classification of interesting rules (from the perspective of domain experts) in order to reduce the result association rules set to be analyzed by domain experts. The model can learn the knowledge of the domain expert and reuse it to classify the rules. As a result, only a few interesting rules are identified from the perspective of domain experts which are then used for database quality assessment and anomaly detection.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hipp, J., Müller, M., Hohendorff, J., Naumann, F.: Rule-based measurement of data quality in nominal data. In: ICIQ, pp. 364–378 (2007)
Liu, B., Hsu, W., Chen, S., Ma, Y.: Analyzing the subjective interestingness of association rules. IEEE Intelligent Systems and their Applications 15(5), 47–55 (2000)
The main important sap material master tables ( data & customizing ). http://sap4tech.net/sap-material-master-tables/ (accessed on February 20, 2017)
Jaroszewicz, S., Simovici, D.A.: Pruning redundant association rules using maximum entropy principle. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS, vol. 2336, pp. 135–147. Springer, Heidelberg (2002). doi:10.1007/3-540-47887-6_13
Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. ACM Sigmod Record 25(2), 1–12 (1996)
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I., et al.: Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining 12(1), 307–328 (1996)
What is pal? – sap hana platform, https://help.sap.com/viewer/2cfbc5cf2bc14f028cfbe2a2bba60a50/2.0.00/en-US (accessed on February 20, 2017)
Zaki, M.J.: Generating non-redundant association rules. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 34–43. ACM (2000)
Strehl, A., Gupta, G.K., Ghosh, J.: Distance based clustering of association rules. In: Proceedings ANNIE, vol. 9(1999), pp. 759–764. Citeseer (1999)
Breiman, L.: Random forests. Machine Learning 45(1), 5–32 (2001)
Fawcett, T.: Roc graphs: Notes and practical considerations for researchers. Machine Learning 31(1), 1–38 (2004)
Xu, Z., Yu, K., Tresp, V., Xu, X., Wang, J.: Representative Sampling for Text Classification Using Support Vector Machines. In: Sebastiani, F. (ed.) ECIR 2003. LNCS, vol. 2633, pp. 393–407. Springer, Heidelberg (2003). doi:10.1007/3-540-36618-0_28
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Han, W., Borges, J., Neumayer, P., Ding, Y., Riedel, T., Beigl, M. (2017). Interestingness Classification of Association Rules for Master Data. In: Perner, P. (eds) Advances in Data Mining. Applications and Theoretical Aspects. ICDM 2017. Lecture Notes in Computer Science(), vol 10357. Springer, Cham. https://doi.org/10.1007/978-3-319-62701-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-62701-4_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62700-7
Online ISBN: 978-3-319-62701-4
eBook Packages: Computer ScienceComputer Science (R0)