Incorporating User Preference for Community Search and Outlier Detection in Attributed Network

被引:0
|
作者
Li Q.-Q. [1 ]
Ma H.-F. [1 ,2 ]
Li J. [1 ]
Li Z.-X. [3 ]
Jiang Y.-B. [1 ]
机构
[1] College of Computer Science and Engineering, Northwest Normal University, Gansu, Lanzhou
[2] Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Science and Technology, Guangxi, Guilin
[3] Guangxi Key Lab of Multi-Source Information Mining & Security, Guangxi Normal University, Guangxi, Guilin
来源
关键词
attribute subspace; attributed network; average partition similarity; community search; outliers;
D O I
10.12263/DZXB.20210370
中图分类号
学科分类号
摘要
Community search aims to search local communities containing query nodes, which is one of the most concerned studies in network analysis task. Most existing community search methods are oriented to simple network and can only detect the community where query nodes are located. They may fail to take user's preferences into account during searching process. To guide the process of community search via user's preferences for finding multi-communities that us⁃ ers are interested in, we propose a community search method that is capable of searching multi-communities with user's preference and simultaneously identify outliers via few given query nodes in attributed network. Clearly, we explicitly mod⁃ el interactions between query nodes with its neighbors and encode similar attributes to highlight the local structure, which could be beneficial for query nodes to mine potential candidates. And we define the average partition similarity on candi⁃ date set of query nodes to infer attribute subspace as user's latent interest. Multi-communities and outliers in the whole net⁃ work are detected via fractional-core and structural constraints. Experiments on real and synthetic network datasets demon⁃ strate the effectiveness of the proposed algorithm. © 2022 Chinese Institute of Electronics. All rights reserved.
引用
收藏
页码:2172 / 2180
页数:8
相关论文
共 25 条
  • [1] JIN D, YOU X X, LI W H, Et al., Incorporating network embedding into Markov random field for better communi⁃ ty detection, Proceedings of the AAAI Conference on Artificial Intelligence, 33, pp. 160-167, (2019)
  • [2] CHEN J, LI R, ZHAO S, Et al., A new clustering cover al⁃ gorithm based on graph representation for community de⁃ tection, Acta Electronica Sinica, 48, 9, pp. 1680-1687, (2020)
  • [3] MATSUGU S, SHIOKAWA H, KITAGAWA H., Fast al⁃ gorithm for attributed community search, Journal of In⁃ formation Processing, 29, pp. 188-196, (2021)
  • [4] PAN J F, DONG Y H, CHEN H H, Et al., The overlapping community discovery algorithm based on compact struc⁃ ture, Acta Electronica Sinica, 47, 1, pp. 145-152, (2019)
  • [5] MA H F, CHEN H B, ZHAO W Z, Et al., Leveraging tag mean partition distance and social structure for overlap⁃ ping microblog user community detection, Acta Elec⁃ tronica Sinica, 46, 11, pp. 2612-2618, (2018)
  • [6] LEE J Y, LEE J., Hidden information revealed by optimal community structure from a protein-complex bipartite net⁃ work improves protein function prediction, PLoS One, 8, 4, (2013)
  • [7] FANG Y X, HUANG X, QIN L, Et al., A survey of commu⁃ nity search over big graphs[J], The VLDB Journal, 29, 1, pp. 353-392, (2020)
  • [8] AGHAALIZADEH S, AFSHORD S T, BOUYER A, Et al., A three-stage algorithm for local community detection based on the high node importance ranking in social net⁃ works, Physica A: Statistical Mechanics and Its Applica⁃ tions, 563, (2021)
  • [9] YU Z Y, CHEN J J, GUO K, Et al., Overlapping communi⁃ ty detection based on influence and seeds extension, Ac⁃ ta Electronica Sinica, 47, 1, pp. 153-160, (2019)
  • [10] AKOGLU L, TONG H H, MEEDER B, Et al., PICS: pa⁃ rameter-free identification of cohesive subgroups in large attributed graphs, Proceedings of the 2012 SIAM In⁃ ternational Conference on Data Mining, pp. 439-450, (2012)