Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms

DOI10.1051/ita:2000129zbMath0976.06003OpenAlexW2141344863MaRDI 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/

zbMATH Keywords

Galois latticeobject-oriented systemsglobal algorithmsalgorithms for building class hierarchies

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (8)

Representing a concept lattice by a graph ⋮ Relational concept discovery in structured datasets ⋮ A local approach to concept generation ⋮ Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation ⋮ Generalized domination in closure systems ⋮ ZooM: a nested Galois lattices-based system for conceptual clustering ⋮ An incremental algorithm to construct a lattice of set intersections ⋮ Performance-friendly rule extraction in large water data-sets with AOC posets and relational concept analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms