{"title":"A novel framework for trust network analysis: Connectivity-based intuitionistic fuzzy rough digraph","authors":"Danyang Wang , Ping Zhu","doi":"10.1016/j.ijar.2025.109564","DOIUrl":null,"url":null,"abstract":"<div><div>Network connectivity analysis enables information source tracing and spread regulation in social systems. While existing studies have explored intuitionistic fuzzy rough (IFR) digraphs to address the representation needs of pervasive uncertainties and dual-polarity information in real-world networks, their neglect of connectivity characteristics has limited applicability in information diffusion scenarios. This study breaks through conventional framework and proposes a connectivity-based IFR digraph model, which achieves comprehensive representation of information oppositionality, uncertainty, and propagative characteristic. First, we explore minimum equivalent intuitionistic fuzzy subgraph (MEIFS) and semi-maximum equivalent intuitionistic fuzzy supergraph (SEIFS). MEIFS preserves original strength of connectedness through minimal arc sets, while SEIFS achieves the same objective via redundant arc augmentation. This complementarity provides a mathematical tool for approximating complex networks. Then, a connectivity-based IFR digraph model is established through the synergy of MEIFS and SEIFS. Finally, according to the co-occurrence characteristics of trust and distrust in society, the community detection algorithm and multi-core-node mining method for IFR trust networks are developed. Comparative analysis with three existing methods demonstrates the superiority of the proposed technique in approximate modeling of adversarial information propagation systems.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"187 ","pages":"Article 109564"},"PeriodicalIF":3.0000,"publicationDate":"2025-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X25002051","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Network connectivity analysis enables information source tracing and spread regulation in social systems. While existing studies have explored intuitionistic fuzzy rough (IFR) digraphs to address the representation needs of pervasive uncertainties and dual-polarity information in real-world networks, their neglect of connectivity characteristics has limited applicability in information diffusion scenarios. This study breaks through conventional framework and proposes a connectivity-based IFR digraph model, which achieves comprehensive representation of information oppositionality, uncertainty, and propagative characteristic. First, we explore minimum equivalent intuitionistic fuzzy subgraph (MEIFS) and semi-maximum equivalent intuitionistic fuzzy supergraph (SEIFS). MEIFS preserves original strength of connectedness through minimal arc sets, while SEIFS achieves the same objective via redundant arc augmentation. This complementarity provides a mathematical tool for approximating complex networks. Then, a connectivity-based IFR digraph model is established through the synergy of MEIFS and SEIFS. Finally, according to the co-occurrence characteristics of trust and distrust in society, the community detection algorithm and multi-core-node mining method for IFR trust networks are developed. Comparative analysis with three existing methods demonstrates the superiority of the proposed technique in approximate modeling of adversarial information propagation systems.
期刊介绍:
The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest.
Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning.
Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.