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 |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Many-core needs fine-grained scheduling : a case study of query processing on Intel Xeon Phi processors
by: Cheng, Xuntao, et al.
Published: (2020) -
Collective spatial keyword querying
by: Cao, X., et al.
Published: (2013) -
Two ellipse-based pruning methods for group nearest neighbor queries
by: Li, H., et al.
Published: (2013) -
Harnessing our core competencies
by: Lugtu, Reynaldo C., Jr.
Published: (2023) -
Who should get tested for COVID-19
Published: (2021)