@inproceedings{Mueller2014,
  author    = {Martin Eric M{\"u}ller},
  title     = {Towards Finding Maximal Subrelations with Desired Properties},
  series = {H{\"o}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},
  publisher = {Springer},
  isbn      = {978-3-319-06250-1},
  doi       = {10.1007/978-3-319-06251-8\_21},
  pages     = {344 -- 361},
  year      = {2014},
  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.},
  language  = {en}
}