Design of class hierarchies based on concept (Galois) lattices

被引:1
|
作者
Godin, R [1 ]
Mili, H [1 ]
Mineau, GW [1 ]
Missaoui, R [1 ]
Arfi, A [1 ]
Chau, TT [1 ]
机构
[1] Univ Quebec, Dept Informat, Montreal, PQ H3C 3P8, Canada
来源
THEORY AND PRACTICE OF OBJECT SYSTEMS | 1998年 / 4卷 / 02期
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices and related structures are presented as a framework for dealing with the design and maintenance of class hierarchies. Because the design of class hierarchies is inherently an iterative and incremental process, we designed incremental algorithms that update existing Galois lattices as the result of adding, removing, or modifying class specifications. A prototype tool incorporating this and other algorithms has been developed as part of the IGLOO project, which is a large object-oriented software engineering joint research project involving academic and industrial partners. The tool can generate either the concept lattice or several variant structures incrementally by incorporating new classes one by one. The resulting hierarchies can be interactively explored and refined using a graphical browser. In addition, several metrics are computed to help evaluating the quality of the hierarchies. Experiments are presented to better assess the applicability of the approach. (C) 1998 John Wiley & Sons, Inc.
引用
收藏
页码:117 / 134
页数:18
相关论文
共 50 条
  • [21] Pessimistic Concept Lattices and Optimistic Concept Lattices Based on Attribute Classification
    Gao L.
    Wang Z.
    Wei L.
    Qi J.
    Wei, Ling (wl@nwu.edu.cn); Wei, Ling (wl@nwu.edu.cn), 1600, Science Press (34): : 701 - 711
  • [22] Dichotomic lattices and local discretization for Galois lattices
    Nathalie Girard
    Karell Bertet
    Muriel Visani
    Advances in Data Analysis and Classification, 2017, 11 : 49 - 77
  • [23] Dichotomic lattices and local discretization for Galois lattices
    Girard, Nathalie
    Bertet, Karell
    Visani, Muriel
    ADVANCES IN DATA ANALYSIS AND CLASSIFICATION, 2017, 11 (01) : 49 - 77
  • [24] Constructing L-fuzzy concept lattices without fuzzy Galois closure operation
    Zhang, Zhuo
    FUZZY SETS AND SYSTEMS, 2018, 333 : 71 - 86
  • [25] On basic conditions to generate multi-adjoint concept lattices via Galois connections
    Diaz-Moreno, J. C.
    Medina, J.
    Ojeda-Aciego, M.
    INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 2014, 43 (02) : 149 - 161
  • [26] Maximal and stochastic Galois lattices
    Diday, E
    Emilion, R
    DISCRETE APPLIED MATHEMATICS, 2003, 127 (02) : 271 - 284
  • [27] Galois lattices and algebraic groups
    Voskresenskii V.E.
    Journal of Mathematical Sciences, 2001, 106 (4) : 3098 - 3144
  • [28] Alpha Galois lattices: An overview
    Ventos, V
    Soldano, H
    FORMAL CONCEPT ANALYSIS, PROCEEDINGS, 2005, 3403 : 299 - 314
  • [29] TOLERANCE RELATIONSHIPS AS GALOIS LATTICES
    BANDELT, HJ
    ACTA SCIENTIARUM MATHEMATICARUM, 1983, 46 (1-4): : 55 - 58
  • [30] Galois lattices and strongly divisible lattices in the unipotent case
    Gao, Hui
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 2017, 728 : 263 - 299