TY  - CHAP
U1  - Konferenzveröffentlichung
A1  - Müller, Martin Eric
T1  - Towards Finding Maximal Subrelations with Desired Properties
T2  - Höfner, Jipsen et al. (Eds.): Relational and Algebraic Methods in Computer Science. 14th International Conference, RAMiCS 2014, Marienstatt, Germany, April 28-May 1, 2014, Proceedings. Lecture Notes in Computer Science (LNCS), Vol. 8428
N2  - 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.
Y1  - 2014
SN  - 978-3-319-06250-1
SB  - 978-3-319-06250-1
U6  - https://doi.org/10.1007/978-3-319-06251-8_21
DO  - https://doi.org/10.1007/978-3-319-06251-8_21
SP  - 344
EP  - 361
PB  - Springer
ER  -