23 March 2021 in IEEE Transactions on Network Science and Engineering
The booming of Social Internet of Things (SIoT) has witnessed the significance of graph mining and analysis for social network management. Online Social Networks (OSNs) can be efficiently managed by monitoring users’ behaviors within a cohesive social group represented by a maximal clique. They can further provide valued social intelligence for their users. Maximal Cliques Problem (MCP) as a fundamental problem in graph mining and analysis is to identify the maximal cliques in a graph. Existing studies on MCP mainly focus on static graphs, with less attention on the detection and dynamic evolution of maximal cliques in OSNs. To fill this gap, we adopt the Formal Concept Analysis (FCA) theory to represent and analyze social networks. We then develop two novel formal concepts generation algorithms, termed Add-FCA and Dec-FCA, that can be applicable to OSNs for detecting the maximal cliques and characterizing the dynamic evolution process of maximal cliques in OSNs. Extensive experimental results are conducted to investigate and demonstrate the correctness and effectiveness of the proposed algorithms. The results reveal that our algorithms can efficiently capture and manage the evolutionary patterns of maximal cliques, including unchanged, changed, added, and vanished maximal cliques in OSNs, and a quantitative relation among them is presented. In addition, an illustrative example is presented to verify the usefulness of the proposed approach.
14 January 2020 in The Journal of Supercomputing
17 June 2021 in IEEE Transactions on Services Computing
Knowledge graph describes entities by numerous RDF data (subject-predicate-object triples), which has been widely applied in various fields, such as artificial intelligence, Semantic Web, entity summarization. With time elapses, the continuously increasing RDF descriptions of entity lead to information overload and further cause people confused. With this backdrop, automatic entity summarization has received much attention in recent years, aiming to select the most concise and most typical facts that depict an entity in brief from lengthy RDF data. As new descriptions of entity are continually coming, creating a compact summary of entity quickly from a lengthy knowledge graph is challenging. To address this problem, this paper firstly formulates the problem and proposes a novel approach of Incremental Entity Summarization by leveraging Formal Concept Analysis (FCA), called IES-FCA. Additionally, we not only prove the rationality of our suggested method mathematically, but also carry out extensive experiments using two real-world datasets. The experimental results demonstrate that the proposed method IES-FCA can save about 8.7% of time consumption for all entities than the non-incremental entity summarization approach KAFCA at best. As for the effectiveness, IES-FCA outperforms the state-of-the-art algorithms in terms of F1-measure, MAP, and NDCG.
22 August 2023 in Connection Science