Knowledge Transfer for Large-Scale Urban Growth Modeling Based on Formal Concept Analysis

2015 ◽  
Vol 20 (5) ◽  
pp. 684-700 ◽  
Author(s):  
Jinyao Lin ◽  
Xia Li
Author(s):  
Takanari Tanabata ◽  
◽  
Kazuhito Sawase ◽  
Hajime Nobuhara ◽  
Barnabas Bede ◽  
...  

In order to perform an interactive data-mining for huge image databases efficiently, a visualization interface based on Formal Concept Analysis (FCA) is proposed. The proposed interface system provides an intuitive lattice structure enabling users freely and easily to select FCA attributes and to view different aspects of the Hasse diagram of the lattice of a given image database. The investigation environment is implemented using C++ and the OpenCV library on a personal computer (CPU = 2.13 GHz, MM = 2 GB). In visualization experiments using 1,000 Corel Image Gallery images, we test image features such as color, edge, and face detectors as FCA attributes. Experimental analysis confirms the effectiveness of the proposed interface and its potential as an efficient datamining tool.


2021 ◽  
Vol 179 (3) ◽  
pp. 295-319
Author(s):  
Longchun Wang ◽  
Lankun Guo ◽  
Qingguo Li

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.


2013 ◽  
Vol 760-762 ◽  
pp. 1708-1712
Author(s):  
Ying Fang Li ◽  
Ying Jiang Li ◽  
Yan Li ◽  
Yang Bo

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.


2007 ◽  
Vol 158 (23) ◽  
pp. 2627-2640 ◽  
Author(s):  
Ming-Wen Shao ◽  
Min Liu ◽  
Wen-Xiu Zhang

Sign in / Sign up

Export Citation Format

Share Document