Who should be invited to my party: A size-constrained k-core problem in social networks
In this paper, we investigate the problem of a size-constrained k-core group query (SCCGQ) in social networks, taking both user closeness and network topology into consideration. More specifically, SCCGQ intends to find a group of h users that has the highest social closeness while being a k-core. S...
Saved in:
Main Authors: | MA, Yu-Liang, YUAN, Ye, ZHU, Feida, WANG, Guo-Ren, XIAO, Jing, WANG, Jian-Zong |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2019
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/4841 https://ink.library.smu.edu.sg/context/sis_research/article/5844/viewcontent/s11390_019_1905_0.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
Many-core needs fine-grained scheduling : a case study of query processing on Intel Xeon Phi processors
由: Cheng, Xuntao, et al.
出版: (2020) -
Collective spatial keyword querying
由: Cao, X., et al.
出版: (2013) -
Two ellipse-based pruning methods for group nearest neighbor queries
由: Li, H., et al.
出版: (2013) -
Harnessing our core competencies
由: Lugtu, Reynaldo C., Jr.
出版: (2023) -
Who should get tested for COVID-19
出版: (2021)