×
Oct 12, 2016 · This paper aims at investigating the computation intelligence extraction approach with focus on the dynamic k-clique mining that is an important ...
This paper aims at investigating the computation intelligence extraction approach with focus on the dynamic k-clique mining that is an important issue in social ...
k-Cliques Mining in Dynamic Social Networks based on Triadic Formal Concept Analysis. June 2016; Neurocomputing 209(C). 209(C). DOI:10.1016/j.neucom.2015.10.141.
k-Cliques mining in dynamic social networks based on triadic formal concept analysis. https://doi.org/10.1016/j.neucom.2015.10.141 ·. Journal: Neurocomputing ...
k-Cliques mining in dynamic social networks based on triadic formal concept analysis. F Hao, DS Park, G Min, YS Jeong, JH Park. Neurocomputing 209, 57-66 ...
k-Cliques mining in dynamic social networks based on triadic formal concept analysis · 来自国家科技图书文献中心. 作者. Hao, Fei,Park, Doo-Soon,Min, Geyong ...
本文旨在研究计算智能提取方法,重点研究动态k-团挖掘是社会网络分析中的一个重要问题。k-clique检测问题作为计算机科学的基础问题之一,可以帮助我们了解社交网络中用户的 ...
People also ask
k-Clique detection enables computer scientists and sociologists to analyze social networks' latent structure and thus understand their structural and ...
Feb 2, 2021 · The k-clique problem is identifying the largest complete subgraph of size k on a network, and it has many applications in Social Network ...
The authors' approach to detecting k-balanced trusted cliques in such networks bases the detection algorithm on formal context analysis and constructs ...