Density Personalized Group Query
Authors: 
Chih-Ya Shen, Shao-Heng Ko, Guang-Siang Lee, Wang-Chien Lee, De-Nian YangAuthors Info & Claims
Chih-Ya Shen, Shao-Heng Ko, Guang-Siang Lee, Wang-Chien Lee, De-Nian YangAuthors Info & ClaimsPages 615 - 628
Abstract
Research on new queries for finding dense subgraphs and groups has been actively pursued due to their many applications, especially in social network analysis and graph mining. However, existing work faces two major weaknesses: i) incapability of supporting personalized neighborhood density, and ii) inability to find sparse groups. To tackle the above issues, we propose a new query, called Density-Customized Social Group Query (DCSGQ), that accommodates the need for personalized density by allowing individual users to flexibly configure their social tightness (and sparseness) for the target group. The proposed DCSGQ is general due to flexible in configuration of neighboring social density in queries. We prove the NP-hardness and inapproximability of DCSGQ, formulate an Integer Program (IP) as a baseline, and propose an efficient algorithm, FSGSel-RR, by relaxing the IP. We then propose a fixed-parameter tractable algorithm with a performance guarantee, named FSGSel-TD, and further combine it with FSGSel-RR into a hybrid approach, named FSGSel-Hybrid, in order to strike a good balance between solution quality and efficiency. Extensive experiments on multiple large real datasets demonstrate the superior solution quality and efficiency of our approaches over existing subgraph and group queries.
References
[1]
A. B. Adcock et al. 2016. Tree decompositions and social graphs. Internet Mathematics 12, 5 (2016), 315--361.
[2]
A. A. Ageev and M. Sviridenko. 2004. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8, 3 (2004), 307--328.
[3]
E. Akbas and P. Zhao. 2017. Truss-based community search: a truss-equivalence based indexing approach. PVLDB 10, 11 (2017), 1298--1309.
[4]
A. Al-Baghdadi and X. Lian. 2020. Topic-based community search over spatial-social networks. Proceedings of the VLDB Endowment 13, 12 (2020), 2104--2117.
[5]
S. Arnborg, D. Corneil, and A. Proskurowski. 1987. Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic Discrete Methods 8, 2 (1987), 277--284.
[6]
S. Arnborg and A. Proskurowski. 1989. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discret. Appl. Math. 23, 1 (1989), 11--24.
[7]
F. Bi et al. 2018. An optimal and progressive approach to online search of top-k influential communities. PVLDB 11, 9 (2018), 1056--1068.
[8]
H. Bodlaender and A. Koster. 2008. Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51, 3 (2008), 255--269.
[9]
H. L. Bodlaender. 1988. Dynamic programming on graphs with bounded treewidth. In ICALP, Vol. 317. 105--118.
[10]
H. L. Bodlaender. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 6 (1996), 1305--1317.
[11]
B. Bollobás and O. Riordan. 2003. Robustness and vulnerability of scale-free random graphs. Internet Mathematics 1, 1 (2003), 1--35.
[12]
D. Boob, Y. Gao, R. Peng, S. Sawlani, C. Tsourakakis, D. Wang, and J. Wang. 2020. Flowless: Extracting densest subgraphs without flow computations. In Proceedings of The Web Conference 2020. 573--583.
[13]
R. Burt. 2004. Structural holes and good ideas. American journal of sociology 110, 2 (2004), 349--399.
[14]
D. S. Callaway et al. 2000. Network robustness and fragility: Percolation on random graphs. Physical review letters 85, 25 (2000), 5468.
[15]
H.-W. Chen, H.-H. Shuai, D.-N. Yang, W.-C. Lee, C. Shi, P. Yu, and M.-S. Chen. 2021. Structure-aware parameter-free group query via heterogeneous information network transformer. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 2075--2080.
[16]
L. Chen, C. Liu, R. Zhou, J. Xu, J. Yu, and J. Li. 2020. Finding effective geo-social group for impromptu activities with diverse demands. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 698--708.
[17]
Y. Chen et al. 2018. Exploring communities in large profiled graphs. IEEE TKDE 31, 8 (2018), 1624--1629.
[18]
Y.-L. Chen, D.-N. Yang, C.-Y. Shen, W.-C. Lee, and M.-S. Chen. 2018. On efficient processing of group and subsequent queries for social activity planning. IEEE Transactions on Knowledge and Data Engineering 31, 12 (2018), 2364--2378.
[19]
E. Chlamtac et al. 2012. Everywhere-sparse spanners via dense subgraphs. In IEEE FOCS. 758--767.
[20]
J. Ding et al. 2018. Improving implicit recommender systems with view data. In IJCAI.
[21]
Y. Fang et al. 2018. On spatial-aware community search. IEEE TKDE 31, 4 (2018), 783--798.
[22]
Y. Fang et al. 2019. Efficient algorithms for densest subgraph discovery. PVLDB 12, 11 (2019), 1719--1732.
[23]
Y. Fang, X. Huang, L. Qin, Y. Zhang, W. Zhang, R. Cheng, and X. Lin. 2020. A survey of community search over big graphs. The VLDB Journal 29, 1 (2020), 353--392.
[24]
Y. Fang, Y. Yang, W. Zhang, X. Lin, and X. Cao. 2020. Effective and efficient community search over large heterogeneous information networks. Proceedings of the VLDB Endowment 13, 6 (2020), 854--867.
[25]
P. Gartland, D. Lokshtanov, M. Pilipczuk, M. Pilipczuk, and P. Rzazewski. 2021. Finding large induced sparse subgraphs in c> t-free graphs in quasipolynomial time. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. 330--341.
[26]
B. Ghosh et al. 2018. The flexible socio spatial group queries. PVLDB 12, 2 (2018), 99--111.
[27]
A. Gionis and C. E. Tsourakakis. 2015. Dense subgraph discovery: KDD 2015 tutorial. In ACM SIGKDD. 2313--2314.
[28]
M. Granovetter. 1973. The strength of weak ties. American journal of sociology 78, 6 (1973), 1360--1380.
[29]
F. Guo, Y. Yuan, G. Wang, L. Chen, X. Lian, and Z. Wang. 2019. Cohesive group nearest neighbor queries over road-social networks. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). IEEE, 434--445.
[30]
F. Guo, Y. Yuan, G. Wang, X. Zhao, and H. Sun. 2021. Multi-attributed community search in road-social networks. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 109--120.
[31]
B.-Y. Hsu, Y.-F. Lan, and C.-Y. Shen. 2018. On automatic formation of effective therapy groups in social networks. IEEE Transactions on Computational Social Systems 5, 3 (2018), 713--726.
[32]
B.-Y. Hsu, C.-Y. Shen, and M.-Y. Chang. 2020. WMEgo: willingness maximization for ego network data extraction in online social networks. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management. 515--524.
[33]
X. Huang et al. 2015. Approximate closest community search in networks. PVLDB 9, 4 (2015), 276--287.
[34]
R. Jin et al. 2009. 3-HOP: a high-compression indexing scheme for reachability query. In ACM SIGMOD. 813--826.
[35]
H. Kim, Y. Choi, K. Park, X. Lin, S.-H. Hong, and W.-S. Han. 2021. Versatile equivalences: Speeding up subgraph query processing and subgraph matching. In Proceedings of the 2021 International Conference on Management of Data. 925--937.
[36]
J. Kim, T. Guo, K. Feng, G. Cong, A. Khan, and F. Choudhury. 2020. Densely connected user community and location cluster search in location-based social networks. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data. 2199--2209.
[37]
Y. Koren and J. Sill. 2013. Collaborative filtering on ordinal user feedback. In IJCAI.
[38]
V. E. Lee et al. 2010. A survey of algorithms for dense subgraph discovery. In Managing and Mining Graph Data. Vol. 40. Springer, 303--336.
[39]
J. Leskovec et al. 2009. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics 6, 1 (2009), 29--123.
[40]
Q. Li, Y. Zhu, and J. Yu. 2020. Skyline cohesive group queries in large road-social networks. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 397--408.
[41]
R.-H. Li et al. 2015. Influential community search in large networks. PVLDB 8, 5 (2015), 509--520.
[42]
Y. Liao, W. Lam, L. Bing, and X. Shen. 2018. Joint modeling of participant influence and latent topics for recommendation in event-based social networks. ACM Transactions on Information Systems (TOIS) 36, 3 (2018), 1--31.
[43]
K.-P. Lin, Y.-W. Chang, C.-Y. Shen, and M.-C. Lin. 2018. Leveraging online word of mouth for personalized app recommendation. IEEE Transactions on Computational Social Systems 5, 4 (2018), 1061--1070.
[44]
Q. Liu, Y. Zhu, M. Zhao, X. Huang, J. Xu, and Y. Gao. 2020. VAC: vertex-centric attributed community search. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 937--948.
[45]
C. Ma, Y. Fang, R. Cheng, L. Lakshmanan, W. Zhang, and X. Lin. 2020. Efficient algorithms for densest subgraph discovery on large directed graphs. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data. 1051--1066.
[46]
S. Maniu et al. 2019. An experimental study of the treewidth of real-world graph data. In ICDT, Vol. 127. 12:1--12:18.
[47]
K. Meeks and A. Scott. 2011. The parameterised complexity of list problems on graphs of bounded treewidth. arXiv preprint arXiv:1110.4077 (2011).
[48]
H. Nagamochi and T. Ibaraki. 1992. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 1-6 (1992), 583--596.
[49]
N. Robertson and P. D. Seymour. 1991. Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory 52, 2 (1991), 153--190.
[50]
A. Sariyüce. 2021. Motif-driven dense subgraph discovery in directed and labeled networks. In Proceedings of the Web Conference 2021. 379--390.
[51]
C.-Y. Shen et al. 2015. Forming online support groups for internet and behavior related addictions. In ACM CIKM. 163--172.
[52]
C.-Y. Shen et al. 2015. Socio-spatial group queries for impromptu activity planning. IEEE TKDE 28, 1 (2015), 196--210.
[53]
C.-Y. Shen et al. 2017. On finding socially tenuous groups for online social networks. In ACM SIGKDD. 415--424.
[54]
C.-Y. Shen et al. 2020. Activity organization for friend-making optimization in online social networks. IEEE TKDE (2020).
[55]
C.-Y. Shen, C. Fotsing, D.-N. Yang, Y.-S. Chen, and W.-C. Lee. 2018. On organizing online soirees with live multi-streaming. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 32.
[56]
C.-Y. Shen, S.-H. Ko, G.-S. Lee, W.-C. Lee, and D.-N. Yang. 2022. Density personalized group query - online full version. https://bit.ly/36QhrvV.
[57]
C.-Y. Shen, D.-N. Yang, W.-C. Lee, and M.-S. Chen. 2016. Spatial-proximity optimization for rapid task group deployment. ACM Transactions on Knowledge Discovery from Data (TKDD) 10, 4 (2016), 1--36.
[58]
S. Sun, X. Sun, Y. Che, Q. Luo, and B. He. 2020. RapidMatch: a holistic approach to subgraph query processing. Proceedings of the VLDB Endowment 14, 2 (2020), 176--188.
[59]
C. E. Tsourakakis. 2015. The k-clique densest subgraph problem. In ACM WWW. 1122--1132.
[60]
C. E. Tsourakakis et al. 2013. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In ACM SIGKDD. 104--112.
[61]
K. Wang et al. 2018. Efficient computing of radius-bounded k-cores. In IEEE ICDE. 233--244.
[62]
K. Wang, W. Zhang, X. Lin, Y. Zhang, L. Qin, and Y. Zhang. 2021. Efficient and effective community search on large-scale bipartite graphs. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 85--96.
[63]
W. Wang, H. Yin, X. Du, W. Hua, Y. Li, and Q. Nguyen. 2019. Online user representation learning across heterogeneous social networks. In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval. 545--554.
[64]
Y. Wang et al. 2017. Query optimal k-plex based community in graphs. Data Science and Engineering 2, 4 (2017), 257--273.
[65]
K. Wright and C. Miller. 2010. A measure of weak-tie/strong-tie support network preference. Communication Monographs 77, 4 (2010), 500--517.
[66]
Y. Wu, J. Zhao, R. Sun, C. Chen, and X. Wang. 2021. Efficient personalized influential community search in large networks. Data Science and Engineering 6, 3 (2021), 310--322.
[67]
C.-H. Yang and C.-Y. Shen. 2022. Enhancing Machine Learning Approaches for Graph Optimization Problems with Diversifying Graph Augmentation. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2191--2201.
[68]
Chen-Hsu Yang, Hong-Han Shuai, Chih-Ya Shen, and Ming-Syan Chen. 2021. Learning to solve task-optimized group search for social internet of things. IEEE Transactions on Knowledge and Data Engineering (2021).
[69]
D.-N. Yang et al. 2012. On socio-spatial group query for location-based social networks. In ACM SIGKDD. 949--957.
[70]
D.-N. Yang, Y.-L. Chen, W.-C. Lee, and M.-S. Chen. 2011. On social-temporal group query with acquaintance constraint. Proceedings of the VLDB Endowment 4, 6 (2011).
[71]
J. Yang and J. Leskovec. 2015. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems 42, 1 (2015), 181--213.
[72]
H. Yin et al. 2017. Local higher-order graph clustering. In ACM SIGKDD. 555--564.
[73]
D. Zhang, J. Yin, X. Zhu, and C. Zhang. 2018. Network representation learning: A survey. IEEE Transactions on Big Data 6, 1 (2018), 3--28.
[74]
F. Zhang et al. 2017. When engagement meets similarity: efficient (k, r)-core computation on social networks. PVLDB 10, 10 (2017), 998--1009.
[75]
T. Zhao, J. McAuley, and I. King. 2014. Leveraging social connections to improve personalized ranking for collaborative filtering. In Proceedings of the 23rd ACM international conference on conference on information and knowledge management. 261--270.
[76]
Q. Zhu et al. 2017. Geo-social group queries with minimum acquaintance constraints. VLDBJ 26, 5 (2017), 709--727.
Recommendations
Personalized hybrid recommendation for group of users
Novel group hybrid method combining collaborative and content-based recommendation.Proposed method improves the quality of recommended items ordering.Proposed method increases the recommendation precision for very Top-N results.Applicable for single ...
Mixture density estimation with group membership functions
The mixture density model has been extensively studied in the field of statistical pattern recognition. And the EM algorithm has been well known as a convenient and efficient tool to iteratively compute the maximum likelihood estimates of mixture model ...
Personalized Query Suggestion Diversification
SIGIR '17: Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information RetrievalQuery suggestions help users refine their queries after they input an initial query. We consider the task of generating query suggestions that are personalized and diversified. We propose a personalized query suggestion diversification model (PQSD), ...
Comments
Information & Contributors
Information
Published In
Publisher
VLDB Endowment
Publication History
Published: 01 December 2022
Published in PVLDB Volume 16, Issue 4
Check for updates
Badges
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 79Total Downloads
- Downloads (Last 12 months)43
- Downloads (Last 6 weeks)6
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in