Abstract
We consider several basic classes of tolerance relations among objects. These (global) relations are defined from some predefined similarity measures on values of attributes. A tolerance relation in a given class of tolerance relations is optimal with respect to a given decision table A if it contains only pairs of objects with the same decision and the number of such pairs contained in the relation is maximal among all relations from the class. We present a method for (sub-)optimal tolerance relation learning from data (decision table). The presented method is based on rough set approach. We show that for some basic families of tolerance relations this problem can be transformed to a relative geometrical problem in a real affine space. Hence geometrical computations are becoming useful tools for solving the problem of global tolerance relation construction. The complexity of considered problems can be evaluated by the complexity of the corresponding geometrical problems. We propose some efficient heuristics searching for an approximation of optimal tolerance relations in considered families of tolerance relations. The global tolerance relations can be treated as patterns in the cartesian product of the object set. We show how to apply the relational patterns (global tolerance relations) in clustering and classification of objects.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bezdek J.C., Chuah S., Leep D. Generalized k-Nearest Neighbour Rule, Fuzzy Sets and Systems, 1,8(3), 1986, pp. 237–256.
Cover T., Hart P., Nearest Neighbour Pattern Classification, IEEE Trans. Inf. Theory, Vol. 13, 1967, pp. 21–27.
Hu X., Cercone N., Rough Set Similarity Based Learning from Databases. Proc of The Fourth International Workshop on Rough Set, Fuzzy Set and Machine Discovery. August 20–21, 1995 Montreal, Canada, pp. 162–167.
Krawiec K., Slowiński R., Vanderpooten D. Construction of Rough Classifires Based on Application of a Similarity Relation. Proc. of The Fourth International Workshop on Rough Set, Fuzzy Set and Machine Discovery. November 6–8, 1996, Tokio, Japan, pp. 23–30.
Lin T.Y. Neighbourhood system and approximation in database and knowled base systems, Proc. of The Fourth International Symposium on Methodologies of Intelligent System, 1989.
Marcus S., Tolerance Rough Sets, Cech Topologies, Learning Process, Bull. of The Polish Academy of Technical Sciences, Vol. 42, No. 3, 1994, pp. 471–487.
Nguyen S. H., Nguyen T. T., Skowron A., Synak P., Knowledge Discovery by Rough Set Methods, Proc. of The International Conference On Information Systems Analysis and Synthesis, July, 22–26, 1996, Orlando, USA, pp. 26–33.
Nguyen S. H., Polkowski L., Skowron A., Synak P., Wróblewski J., Searching for Approximate Description of Decision Classes, Proc.of The Fourth International Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery, November 6–8, 1996, Tokyo, Japan, pp. 153–161.
Pawlak Z.. Rough Classification, International Journal of Man-Machine Studies, 20, pp. 469–483, 1984.
Pawlak Z., Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, 1991.
Polkowski L., Skowron A., Zytkow J., Tolerance Based Rough Sets, In: Soft Computing, T.Y. Lin, A.M. Wildberger (eds.), San Diego, Simulation Council, Inc., 1995, pp. 55–58.
Stepaniuk J., Similarity Based Rough Sets and Learning, Proc. of The Fourth International Workshop on Rough Sets, Fuzzy Sets and Machine Discovery, November 6–8, 1996, Tokyo, Japan, pp. 18–22.
Stepaniuk J., Kretowski M., Polkowski L., Skowron A., Data Reduction Based on Rough Set Theory, Proc. of The International Workshop on Statistics, Machine Learning and Knowledge Discovery in Databases, Crete, Greece, April 28–29, 1995
Skowron A., Polkowski L., Komorowski J. (1996). Learning Tolerance Relation by Boolean Descriptions: Automatic feature extraction from data tabes. Proc of The Fourth International Workshop on Rough Set, Fuzzy Set and Machine Discovery. November 6–8, 1996, Tokio, Japan, pp. 11–17.
Skowron A., Stepaniuk J., Tolerance Approximation Spaces. In Fundamenta Informaticae, August 1996, Vol. 27, Numer 2,3, pp. 245–253.
Windham, M.P. Geometric Fuzzy Clustering Algorithms, Fuzzy Set and Systems 3, pp. 271–280, 1983.
Ziarko, W.P.(Ed.) Rough Set, Fuzzy Set and Knowledge Discovery, Springer-Verlag, London, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, S.H., Skowron, A. (1997). Searching for relational patterns in data. In: Komorowski, J., Zytkow, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1997. Lecture Notes in Computer Science, vol 1263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63223-9_125
Download citation
DOI: https://doi.org/10.1007/3-540-63223-9_125
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63223-8
Online ISBN: 978-3-540-69236-2
eBook Packages: Springer Book Archive