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...
محفوظ في:
المؤلفون الرئيسيون: | 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 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Many-core needs fine-grained scheduling : a case study of query processing on Intel Xeon Phi processors
بواسطة: Cheng, Xuntao, وآخرون
منشور في: (2020) -
Collective spatial keyword querying
بواسطة: Cao, X., وآخرون
منشور في: (2013) -
Two ellipse-based pruning methods for group nearest neighbor queries
بواسطة: Li, H., وآخرون
منشور في: (2013) -
Harnessing our core competencies
بواسطة: Lugtu, Reynaldo C., Jr.
منشور في: (2023) -
Who should get tested for COVID-19
منشور في: (2021)