删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

Target Community Detection With User's Preference and Attribute Subspace

本站小编 Free考研/2020-04-17

寮€閫氭湰绔橵IP锛氫竴涓囩鑰冪爺涓撲笟璇捐棰戦殢渚跨湅锛屾瘡鏈笉鍒颁竴鍒嗛挶锛佺粷瀵瑰垝绠楋紒
547鎵€闄㈡牎鑰冪爺鑰冨崥1130绉嶆寚瀹氭暀鏉愮殑鍗冧綑绉嶉厤濂楅搴撱€佽棰戯紝娑电洊鑻辫銆佺粡娴庛€佽瘉鍒搞€侀噾铻嶃€佺悊宸ャ€佺鐞嗐€佺ぞ浼氥€佽储浼氥€佹暀鑲插績鐞嗐€佷腑鏂囥€佽壓鏈€佹柊闂讳紶鎾€佹硶瀛︺€佸尰瀛︺€佽绠楁満銆佸巻鍙层€佸湴鐞嗐€佹斂娌汇€佸摬瀛︺€佷綋鑲茬被绛�28绫诲绉戯紒
文献详情
Target Community Detection With User's Preference and Attribute Subspace
文献类型:期刊
通讯作者:Ma, HF (reprint author), Northwest Normal Univ, Coll Comp Sci & Engn, Lanzhou 730070, Gansu, Peoples R China.; Ma, HF (reprint author), Guangxi Normal Univ, Guangxi Key Lab Multisource Informat Min & Secur, Guilin 541004, Peoples R China.
期刊名称:IEEE ACCESS影响因子和分区
年:2019
卷:7
页码:46583-46594
ISSN:2169-3536
关键词:Target community detection; user's preference; attribute subspace; entropy
所属部门:信息学院
摘要:Community detection in the network has become an invaluable tool to explore and reveal the internal organization of nodes. In particular, the target community detection focuses on discovering the "local'' links within and connecting to the target community related to user's preference, which refers to a limited number of nodes in the whole network. A few works in the literature discuss the target community detection. In this paper, we propose a target community detection with user's preference a ...More
Community detection in the network has become an invaluable tool to explore and reveal the internal organization of nodes. In particular, the target community detection focuses on discovering the "local'' links within and connecting to the target community related to user's preference, which refers to a limited number of nodes in the whole network. A few works in the literature discuss the target community detection. In this paper, we propose a target community detection with user's preference and attribute subspace. Our method utilizes not only network structure but also node attributes within a certain subspace to quantify both internal consistency and external separability, which is able to capture a user preferred target community. First, the similarity between nodes is calculated via both attributes and structures, and the center node set of the target community can be obtained by extending the sample node given by the user with its neighbors. Second, an attribute subspace calculation method with entropy weights is established based on the center node set, and the attribute subspace of the target community can thus be deduced. Finally, the target community quality, which is the combination of internal connectivity and external separability, is defined, based on which the target community with a user's preference can be detected. The experimental results on both synthetic network and real-world network datasets demonstrated the efficiency and effectiveness of the proposed algorithm. ...Hide

DOI:10.1109/ACCESS.2019.2909736
百度学术:Target Community Detection With User's Preference and Attribute Subspace
语言:外文
被引频次:
1
基金:National Natural Science Foundation of ChinaNational Natural Science Foundation of China [61762078, 61363058, 61663004]; Research Fund of the Guangxi Key Lab of Multi-Source Information Mining and Security [MIMS18-08]
作者其他论文



Multi-representation adaptation network for cross-domain image classification.Zhu, Yongchun, Zhuang, Fuzhen, Wang, Jindong, et al. .NEURAL NETWORKS. 2019, 119, 214-221.
An economic Semantic Web platform.Du, Xiaoyong;Hu, He;Li, Man,等.5th International Conference on Grid and Cooperative Computing (GCC 2006).2006,49-53.
An ontology-based and cooperative annotation system.Wu, Wenjuan;Du, Xiaoyong;Hu, He,等.4th IFIP International Conference on Intelligent Information Processing.2006,228,537-542.
经济学知识网格的构建.杜小勇;李曼;胡鹤,等.华中科技大学学报(自然科学版).2006,34(z1),17-20.
Extracting domain-relevant term using wikipedia based on random walk model.Wu, Wenjuan;Liu, Tao;Hu, He,等.2012,68-75.

相关话题/文献 外文

涓€鏉ザ鑼剁殑閽卞氨鍙互涔板埌鑰冪爺涓撲笟璇捐祫鏂欙紒
2涓囩鑰冪爺鐢靛瓙涔︼紙棰樺簱銆佽棰戙€佸叏濂楄祫鏂欙級鍙婂巻骞寸湡棰橈紝娑电洊547鎵€闄㈡牎4涓囦綑涓€冪爺鑰冨崥涓撲笟绉戠洰銆佽€冪爺鍏叡璇撅紙鏀挎不鑻辫鏁板锛夈€�40绉嶄笓涓氱澹紙閲戣瀺纭曞+銆丮BA銆佸浗闄呭晢鍔$澹€佹柊闂讳紶鎾澹€佺ぞ浼氬伐浣滅澹瓑锛夈€�28绫诲悓绛夊鍔涚敵纭曚笓涓氥€�1130绉嶇粡鍏告暀鏉愩€�