Identification of substructures in complex networks using formal concept analysis

Author:

Neto Sebastião M.,Dias Sérgio,Missaoui Rokia,Zárate Luis,Song Mark

Abstract

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.

Publisher

Emerald

Subject

Computer Networks and Communications,Information Systems

Reference48 articles.

1. Fast algorithms for mining association rules,1994

2. Dependency structures of data base relationships,1974

3. Advances in FCA-based applications for social networks analysis;International Journal of Conceptual Structures and Smart Applications (IJCSSA),2013

4. Recognizing Pseudo-intents is coNP-complete,2010

5. The multiple facets of the canonical direct unit implicational basis;Theoretical Computer Science,2010

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Knowledge Identification within the Decomposition of Homogeneous Classes of Objects;2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT);2023-10-19

2. An open computing language‐based parallel Brute Force algorithm for formal concept analysis on heterogeneous architectures;Concurrency and Computation: Practice and Experience;2021-02-06

3. Mining GitHub for research and education: challenges and opportunities;International Journal of Web Information Systems;2020-06-29

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3