Formal Concept Analysis-Based Class Hierarchy Design in Object-Oriented Software Development

2005 ◽  
pp. 304-323 ◽  
Author(s):  
Robert Godin ◽  
Petko Valtchev
Keyword(s):  
Software Development ◽  
Formal Concept Analysis ◽  
Object Oriented ◽  
Concept Analysis ◽  
Formal Concept ◽  
Class Hierarchy

scholarly journals LGPD: A Formal Concept Analysis and its Evaluation

2020 ◽  
Author(s):  
Antônio Diogo Forte Martins ◽  
Patrícia Vieira da Silva Barros ◽  
José Maria Monteiro ◽  
Javam De Castro Machado
Keyword(s):  
Software Development ◽  
Formal Concept Analysis ◽  
Personal Data ◽  
Concept Analysis ◽  
Smart Devices ◽  
Formal Concept ◽  
General Law ◽  
Support Software ◽  
Privacy Issues

Nowadays, personal data generated through the use of smart devices are collected and stored by many companies. So, concerns about privacy issues are raised by users. In this context, the Brazilian General Law for the Protection of Personal Data (LGPD) was proposed in 2018. It regulates how any company must store and process personal data. This paper details the results of applying formal concept analysis (FCA) to the LGPD. The goal of applying FCA was to elicit key insights to support software development or re-design in compliance with LGPD. Besides, we propose an automatic manner to apply FCA.

scholarly journals Continuous Domains in Formal Concept Analysis*

2021 ◽  
Vol 179 (3) ◽  
pp. 295-319
Author(s):  
Longchun Wang ◽  
Lankun Guo ◽  
Qingguo Li
Keyword(s):  
Formal Concept Analysis ◽  
Concept Analysis ◽  
Continuous Functions ◽  
Formal Context ◽  
Formal Concept ◽  
Contractive Mappings ◽  
Continuous Domains ◽  
Algebraic Domains ◽  
Scott Continuous ◽  
Continuous Domain

Formal Concept Analysis (FCA) has been proven to be an effective method of restructuring complete lattices and various algebraic domains. In this paper, the notion of contractive mappings over formal contexts is proposed, which can be viewed as a generalization of interior operators on sets into the framework of FCA. Then, by considering subset-selections consistent with contractive mappings, the notions of attribute continuous formal contexts and continuous concepts are introduced. It is shown that the set of continuous concepts of an attribute continuous formal context forms a continuous domain, and every continuous domain can be restructured in this way. Moreover, the notion of F-morphisms is identified to produce a category equivalent to that of continuous domains with Scott continuous functions. The paper also investigates the representations of various subclasses of continuous domains including algebraic domains and stably continuous semilattices.

The Research of Semantic Web Service Matching Algorithm Based on the Formal Concept Analysis

2013 ◽  
Vol 760-762 ◽  
pp. 1708-1712
Author(s):  
Ying Fang Li ◽  
Ying Jiang Li ◽  
Yan Li ◽  
Yang Bo
Keyword(s):  
Semantic Web ◽  
Web Service ◽  
Formal Concept Analysis ◽  
Service Discovery ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Concept ◽  
Semantic Web Service ◽  
Matching Algorithm ◽  
Service Matching

At present, as the number of web services resources on the network drastically increased, how to quickly and efficiently find the needed services from publishing services has become a problem to resolve. Aiming at the problems of low efficiency in service discovery of traditional web service, the formal concept analysis ( FCA) is introduced into the semantic Web service matching, and a Matching Algorithm based semantic web service is proposed. With considering the concept of limited inheritance,this method introduces the concept of limited inheritance to the semantic similarity calculation based on the concept lattice. It is significant in enhancing the service function matching in practical applications through adjust the calculation.

Sign in / Sign up

Export Citation Format

Share Document