Abstract
As soon as data is noisy, knowledge as it is represented in an information system becomes unreliable. Features in databases induce equivalence relations—but knowledge discovery takes the other way round: given a relation, what could be a suitable functional description? But the relations we work on are noisy again. If we expect to record data for learning a classification of objects then it can well be the real data does not create a reflexive, symmetric and transitive relation although we know it should be. The usual approach taken here is to build the closure in order to ensure desired properties. This, however, leads to overgeneralisation rather quickly.
In this paper we present our first steps towards finding maximal subrelations that satisfy the desired properties. This includes a discussion of different properties and their representations, several simple measures on relations that help us comparing them and a few distance measures that we expect to be useful when searching for maximal subrelations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blyth, T.S.: Lattices and ordered algebraic structures. Springer (2005)
Bóna, M.: Combinatorics of Permutations, 2nd edn. Chapman and Hall/CRC (2012)
Booth, A.D.: A Signed Binary Multiplication Technique. Quarterly Journal of Mechanics and Applied Mathematics, 236–240 (1951)
Christophe, J., Doignon, J.-P., Fiorini, S.: Counting Biorders. Journal of Integer Sequences 6 (2003)
Cowlishaw, M.: Densely packed decimal encoding. IEE Proceedings – Computers and Digital Techniques 149 (2002)
Fodor, J.C., Roubens, M.: Structure of transitive valued binary relations. Mathematical Social Sciences (1995)
Ganter, B., Wille, R.: Formal Concept Analysis. Springer (1999)
Gonzalez-Pachon, J., Romero, C.: A method fir obtaining transitive approximations of a binary relation. Annals of Operations Research (2008)
Klaška, J.: Transitivity and partial order. Mathematica Bohemnia 122 (2004)
Müller, M.E.: Relational Knowledge Discovery. Cambridge University Press (2012)
Nikaido, H.: Introduction to sets and mappings in modern economics. North-Holland (1970)
Pawlak, Z.: On rough sets. Bulletin of the EATCS 24, 94–184 (1984)
Pfeiffer, G.: Counting transitive relations. Journal of integer sequences 7 (2004)
Polkowski, L.: Rough Sets - Mathematical Foundations. Advances in Soft Computing. Physica (2002)
Rudolf Zurmühl, S.F.: Matrizen und ihre Anwendungen. Springer Orig. Erstausgabe 1950 (2011)
Schmidt, G.: Relational Mathematics, Encyclopedia of Mathematics and its Applications, vol. 132. Cambridge University Press (2011)
Tien Chi Chen, I. T.H.: Storage-efficient representation of decimal data. Communications of the ACM 18, 49–52 (1975)
Winter, M.: Decomposing relations into orderings. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS/Kleene-Algebra Ws 2003. LNCS, vol. 3051, pp. 265–277. Springer, Heidelberg (2004)
Zhang, F.: Matrix Theory: Basic Results and Techniques. Springer (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Müller, M.E. (2014). Towards Finding Maximal Subrelations with Desired Properties. In: Höfner, P., Jipsen, P., Kahl, W., Müller, M.E. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2014. Lecture Notes in Computer Science, vol 8428. Springer, Cham. https://doi.org/10.1007/978-3-319-06251-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-06251-8_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06250-1
Online ISBN: 978-3-319-06251-8
eBook Packages: Computer ScienceComputer Science (R0)