k-Cliques mining in dynamic social networks based on triadic formal concept analysis

2016 ◽  
Vol 209 ◽  
pp. 57-66 ◽  
Author(s):  
Fei Hao ◽  
Doo-Soon Park ◽  
Geyong Min ◽  
Young-Sik Jeong ◽  
Jong-Hyuk Park
Keyword(s):  
Social Networks ◽  
Formal Concept Analysis ◽  
Concept Analysis ◽  
Formal Concept ◽  
Dynamic Social Networks

Identification of substructures in complex networks using formal concept analysis

2018 ◽  
Vol 14 (3) ◽  
pp. 281-298 ◽  
Author(s):  
Sebastião M. Neto ◽  
Sérgio Dias ◽  
Rokia Missaoui ◽  
Luis Zárate ◽  
Mark Song
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Formal Concept Analysis ◽  
Computational Models ◽  
Behavior Pattern ◽  
Concept Analysis ◽  
Behavior Patterns ◽  
Formal Concept ◽  
Content Type ◽  
Access Patterns

Purpose In recent years, the increasing complexity of the hyper-connected world demands new approaches for social network analysis. The main challenges are to find new computational methods that allow the representation, characterization and analysis of these social networks. Nowadays, formal concept analysis (FCA) is considered an alternative to identifying conceptual structures in a social network. In this FCA-based work, this paper aims to show the potential of building computational models based on implications to represent and analyze two-mode networks. Design/methodology/approach This study proposes an approach to find three important substructures in social networks such as conservative access patterns, minimum behavior patterns and canonical access patterns. The present study approach considered as a case study a database containing the access logs of a cable internet service provider. Findings The result allows us to uncover access patterns, conservative access patterns and minimum access behavior patterns. Furthermore, through the use of implications sets, the relationships between event-type elements (websites) in two-mode networks are analyzed. This paper discusses, in a generic form, the adopted procedures that can be extended to other social networks. Originality/value A new approach is proposed for the identification of conservative behavior in two-mode networks. The proper implications needed to handle minimum behavior pattern in two-mode networks is also proposed to be analyzed. The one-item conclusion implications are easy to understand and can be more relevant to anyone looking for one particular website access pattern. Finally, a method for a canonical behavior representation in two-mode networks using a canonical set of implications (steam base), which present a minimal set of implications without loss of information, is proposed.

$K$ -Clique Community Detection in Social Networks Based on Formal Concept Analysis

2017 ◽  
Vol 11 (1) ◽  
pp. 250-259 ◽  
Author(s):  
Fei Hao ◽  
Geyong Min ◽  
Zheng Pei ◽  
Doo-Soon Park ◽  
Laurence T. Yang
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Formal Concept Analysis ◽  
Concept Analysis ◽  
Formal Concept

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