Abstract
When knowledge mining starts from contingency tables, many types of knowledge become apparent that would otherwise went unnoticed. In this paper we start from contingency tables for pairs of attributes whose domains are ordered. The domain of each attribute can be interpreted as a preference list. We present a common 2-d pattern that can be collectively called preference relation. Preference relation tells that one of the choices is accepted to a higher degree over another. On one end of the spectrum, a weak preference borders equivalence relation between choices. On the other, a very strong preference is similar to subset relation. We present several tests that can distinguish various forms of preference relation knowledge and also subset and equivalence. Our experience in data mining with the application of the 49er system shows that the exploration of many databases frequently leads to large numbers of preference-type regularities. Large numbers of preference-type regularities can be combined into concise, useful forms of preference graphs. We compare preference graphs to taxonomies and inclusion graphs. We illustrate the presented algorithms by applications on the International Social Survey Program (ISSP) databases.
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
Fienberg, S.E. 1980.The analysis of cross-classified categorical data,MIT Press.
Fisher, D.H. 1987. Knowledge Acquisition Via Incremental Conceptual Clustering, Machine Learning 2: 139–172.
Gokhale, D.V.& Kullback, S. 1978. The Information in Contingency Tables, New York: M.Dekker.
Klösgen, W. (1992). Patterns for Knowledge Discovery in Databases in: ed Proceedings of the ML-92 Workshop on Machine Discovery (MD-92), Aberdeen, UK. July 4,p.1–10.
Moraczewski, I., Zembowicz, R.& Żytkow, J.M. 1995. Geobotanical Database Exploration.In Working Notes of the AAAI Spring Symposium.Forthcoming.
Sudnik–Wojcikowska, B. 1987?The flora of Warsaw and its changes in 19th and 20th Centuries (in Polish), Warsaw: Warsaw University Publ?
Troxel, M., Swarm, K., Zembowicz, R.& Żytkow, J.M. 1994. Concept Hierarchies: a Restricted Form of Knowledge Derived from Regularities. In: Proc. of Methodologies for Intelligent Systems, ed. M. Zemankova Z. Ras, Springer-Verlag.
Żytkow, J.,& Zembowicz, R., (1993) Database Exploration in Search of Regularities Journal of Intelligent Information Systems2, p.39–81?
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Żytkow, J.M., Arredondo, D. (2001). Mining the Preference Relations and Preference Graphs. In: Kłopotek, M.A., Michalewicz, M., Wierzchoń, S.T. (eds) Intelligent Information Systems 2001. Advances in Intelligent and Soft Computing, vol 10. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1813-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1813-0_11
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1407-1
Online ISBN: 978-3-7908-1813-0
eBook Packages: Springer Book Archive