A visualization method of huge video/image databases based on formal concept analysis and the attribute partial order theory

2013 ◽  
Author(s):  
Yanyan Zhang ◽  
Xiaomin Wang ◽  
Jinkuan Wang ◽  
Jianbo Liu
Keyword(s):  
Partial Order ◽  
Formal Concept Analysis ◽  
Order Theory ◽  
Concept Analysis ◽  
Image Databases ◽  
Video Image ◽  
Formal Concept ◽  
Visualization Method

Interactive Data Mining for Large-Scale Image Databases Based on Formal Concept Analysis

2010 ◽  
Vol 14 (3) ◽  
pp. 303-308 ◽  
Author(s):  
Takanari Tanabata ◽  
◽  
Kazuhito Sawase ◽  
Hajime Nobuhara ◽  
Barnabas Bede ◽  
...  
Keyword(s):  
Data Mining ◽  
Formal Concept Analysis ◽  
Large Scale ◽  
Lattice Structure ◽  
Concept Analysis ◽  
Image Features ◽  
Image Databases ◽  
Formal Concept ◽  
Interactive Data Mining ◽  
Interactive Data

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.

scholarly journals Four-Fold Formal Concept Analysis Based on Complete Idempotent Semifields

Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 173
Author(s):  
Francisco José Valverde-Albacete ◽  
Carmen Peláez-Moreno
Keyword(s):  
Data Mining ◽  
Formal Concept Analysis ◽  
Order Theory ◽  
Concept Analysis ◽  
Galois Connection ◽  
Formal Concept ◽  
Data Mining Technique ◽  
Full Spectrum ◽  
Mining Technique ◽  
Ordered Pairs

Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lattice and Order Theory, that has several extensions to, e.g., fuzzy and idempotent semirings. At the heart of FCA lies a Galois connection between two powersets. In this paper we extend the FCA formalism to include all four Galois connections between four different semivectors spaces over idempotent semifields, at the same time. The result is K¯-four-fold Formal Concept Analysis (K¯-4FCA) where K¯ is the idempotent semifield biasing the analysis. Since complete idempotent semifields come in dually-ordered pairs—e.g., the complete max-plus and min-plus semirings—the basic construction shows dual-order-, row–column- and Galois-connection-induced dualities that appear simultaneously a number of times to provide the full spectrum of variability. Our results lead to a fundamental theorem of K¯-four-fold Formal Concept Analysis that properly defines quadrilattices as 4-tuples of (order-dually) isomorphic lattices of vectors and discuss its relevance vis-à-vis previous formal conceptual analyses and some affordances of their results.

Designing Access Control Policy Using Formal Concept Analysis

2014 ◽  
Vol 602-605 ◽  
pp. 3822-3825 ◽  
Author(s):  
Bo Chen ◽  
Jia Di Qiu ◽  
Ming Ming Chen
Keyword(s):  
Access Control ◽  
Formal Concept Analysis ◽  
Control Policy ◽  
Order Theory ◽  
Concept Analysis ◽  
Experimental Results ◽  
Formal Concept ◽  
Access Control Policy ◽  
Computer Environment ◽  
Share Information

The need to securely share information among collaborating entities is increasingly becoming important. It often needed to implement access control (AC) models. The objective of this paper is to design access control policy using formal concept analysis, which is based on mathematical lattice and order theory. We provide discussion on how FCA can be used to capture RBAC constraints. We show with FCA, we can express more intend constrains than it can be done in traditional RBAC approach. The experimental results show that the approach is more resilient to dynamic computer environment.

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.

Sign in / Sign up

Export Citation Format

Share Document