Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
From MaRDI portal
Publication:2729629
DOI10.1051/ita:2000129zbMath0976.06003MaRDI QIDQ2729629
No author found.
Publication date: 23 July 2001
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2000__34_6_521_0/
Galois lattice; object-oriented systems; global algorithms; algorithms for building class hierarchies
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
06A15: Galois correspondences, closure operators (in relation to ordered sets)
Related Items
ZooM: a nested Galois lattices-based system for conceptual clustering, An incremental algorithm to construct a lattice of set intersections, Representing a concept lattice by a graph, Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation, Relational concept discovery in structured datasets, A local approach to concept generation, Generalized domination in closure systems, Performance-friendly rule extraction in large water data-sets with AOC posets and relational concept analysis
Cites Work
