Knowledge acquisition by methods of formal concept analysis
Proceedings of the conference on Data analysis, learning symbolic and numeric knowledge
Building and maintaining analysis-level class hierarchies using Galois Lattices
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Object-oriented analysis and design with applications (2nd ed.)
Object-oriented analysis and design with applications (2nd ed.)
Object-Oriented Software
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Integration of Inheritance Trees as Part of View Generation For Database Federations
ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
ER '97 Proceedings of the 16th International Conference on Conceptual Modeling
Inheritance Graph Assessment Using Metrics
METRICS '96 Proceedings of the 3rd International Symposium on Software Metrics: From Measurement to Empirical Results
KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Cooperative Information Retrieval enhanced by formal concept analysis
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
In [M.M. Gammoudi et al., in: Proceedings Lecture Notes of the International Conference on Conceptual Modeling ER'97, Los Angeles, November 1997; M.M. Gammoudi et al., in: The 18th International Conference on Conceptual Modelling (ER'99), Paris, November 15-18, Lecture Notes, Springer, Berlin, 1999] we proposed a semi-automatic method for generating inheritance graph hierarchy for the purpose of assisting the designer during the definition of his conceptual schema. The motivation for this work was the very few approaches which attempt to provide methods and tools for designing inheritance graph in object databases [R. Wille, in: E. Diday (Ed.), Data Analysis, Learning Symbolic and Numeric Knowledge, Nova Science, New York, 1989], and object software [A.L. Winblad et al., Object-Oriented Software, Addison-Wesley, New York, 1990]. To address some limitations found in our work, we propose a new method whose principles are: (i) From a binary relation which represents the links between entities and their properties and methods, our proposed heuristic generates and organizes incrementally a set of optimal rectangles into a brut inheritance graph (BIG). (ii) BIG is refined and submitted to the designer. (iii) The designer can modify, add or remove classes, attributes or methods in the binary relation and activate step (i) until he obtains a proper class hierarchy or an optimal inheritance graph.