3 citations · 7 across the 7 of their papers we have counts for
7 papers
Uncovering the Local Hidden Community Structure in Social Networks
Meng Wang, Boyu Li, Kun He +1
Hidden community is a useful concept proposed recently for social network analysis. To handle the rapid growth of network scale, in this work, we explore the detection of hidden co…
Streaming Local Community Detection through Approximate Conductance
Yanhao Yang, Meng Wang, David Bindel +1
Community is a universal structure in various complex networks, and community detection is a fundamental task for network analysis. With the rapid growth of network scale, networks…
A New Entity Extraction Method Based on Machine Reading Comprehension
Xiaobo Jiang, Kun He, Jiajun He +1
Entity extraction is a key technology for obtaining information from massive texts in natural language processing. The further interaction between them does not meet the standards…
Adaptive Simulated Annealing with Greedy Search for the Circle Bin Packing Problem
Yong Yuan, Kevin Tole, Fei Ni +3
We introduce a new bin packing problem, termed the circle bin packing problem with circular items (CBPP-CI). The problem involves packing all the circular items into multiple ident…
Structure Amplification on Multi-layer Stochastic Block Models
Xiaodong Xin, Kun He, Jialu Bao +2
Much of the complexity of social, biological, and engineered systems arises from a network of complex interactions connecting many basic components. Network analysis tools have bee…
Link Prediction and Unlink Prediction on Dynamic Networks
Christina Muro, Boyu Li, Kun He
Link prediction on dynamic networks has been extensively studied and widely applied in various applications. However, temporal unlink prediction, which also plays an important role…
Tight bounds for popping algorithms
Heng Guo, Kun He
We sharpen run-time analysis for algorithms under the partial rejection sampling framework. Our method yields improved bounds for: the cluster-popping algorithm for approximating a…