Object-oriented modeling and design
Object-oriented modeling and design
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
On automatic class insertion with overloading
Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Rough concept analysis: a synthesis of rough sets and formal concept analysis
Fundamenta Informaticae - Special issue: rough sets
Reengineering class hierarchies using concept analysis
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Design of class hierarchies based on concept (Galois) lattices
Theory and Practice of Object Systems - Special issue high availability in CORBA
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Efficient mining of association rules using closed itemset lattices
Information Systems
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
An Aristotelian understanding of object-oriented programming
OOPSLA '00 Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Relational Data Mining
A partition-based approach towards constructing Galois (concept) lattices
Discrete Mathematics
Conceptual Structures of Multicontexts
ICCS '96 Proceedings of the 4th International Conference on Conceptual Structures: Knowledge Representation as Interlingua
Structural Machine Learning with Galois Lattice and Graphs
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Learning of Simple Conceptual Graphs from Positive and Negative Examples
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
iO2 - An Algorithmic Method for Building Inheritance Graphs in Object Database Design
ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
TOSCANA - a Graphical Tool for Analyzing and Exploring Data
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Mining Safety Signals in Spontaneous Reports Database Using Concept Analysis
AIME '09 Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine
Normalized-scale Relations and Their Concept Lattices in Relational Databases
Fundamenta Informaticae
A Generic Approach for Class Model Normalization
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Backing composite web services using formal concept analysis
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Object configuration browsing in relational databases
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Supporting ontology design through large-scale FCA-based ontology restructuring
ICCS'11 Proceedings of the 19th international conference on Conceptual structures for discovering knowledge
Normalized-scale Relations and Their Concept Lattices in Relational Databases
Fundamenta Informaticae
Fixing Generalization Defects in UML Use Case Diagrams
Fundamenta Informaticae - Concept Lattices and Their Applications
Generation of operational transformation rules from examples of model transformations
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Relational concept analysis: mining concept lattices from multi-relational data
Annals of Mathematics and Artificial Intelligence
Highlighting stakeholder communities to support requirements decision-making
REFSQ'13 Proceedings of the 19th international conference on Requirements Engineering: Foundation for Software Quality
Formal query systems on contexts and a representation of algebraic lattices
Information Sciences: an International Journal
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
Reusable abstractions for modeling languages
Information Systems
Hi-index | 0.00 |
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as databases, both relational and object-oriented, knowledge bases, or software models, e.g., UML class diagrams. When processing such complex datasets, it is of prime importance for an analysis tool to hold as much as possible to the initial format so that the semantics is preserved and the interpretation of the final results eased. Therefore, several attempts have been made to introduce relations into the formal concept analysis field which otherwise generated a large number of knowledge discovery methods and tools. However, the proposed approaches invariably look at relations as an intra-concept construct, typically relating two parts of the concept description, and therefore can only lead to the discovery of coarse-grained patterns. As an approach towards the discovery of finer-grain relational concepts, we propose to enhance the classical (object 脳 attribute) data representations with a new dimension that is made out of inter-object links (e.g., spouse, friend, manager-of, etc.). Consequently, the discovered concepts are linked by relations which, like associations in conceptual data models such as the entity-relation diagrams, abstract from existing links between concept instances. The borders for the application of the relational mining task are provided by what we call a relational context family, a set of binary data tables representing individuals of various sorts (e.g., human beings, companies, vehicles, etc.) related by additional binary relations. As we impose no restrictions on the relations in the dataset, a major challenge is the processing of relational loops among data items. We present a method for constructing concepts on top of circular descriptions which is based on an iterative approximation of the final solution. The underlying construction methods are illustrated through their application to the restructuring of class hierarchies in object-oriented software engineering, which are described in UML.