报告题目：Anchored Vertex Exploration for CommunityEngagement in Social Networks
邀请人：东北大学 2138com太阳集团 王斌 副教授
To solve the AVE problem, we develop a Filter-Verify frameworkby maintaining the intermediate results using multiway tree,and probe the best anchored users in a best search way. To acceleratethe efficiency, we further design a keyword-aware anchoredand follower index, and also develop an index-based efficientalgorithm. The proposed algorithm can greatly reduce the costof computing anchored users and their followers. Additionally, wepresent two bound properties that can guarantee the correctnessof our solution. Finally, we demonstrate the efficiency of ourproposed algorithms and index. We measure the effectiveness ofattributed community-based community engagement model byconducting extensive experiments on five real-world datasets.
Dr Jianxin Li is an A/Professor in the School of IT, Deakin University.His research interests include social computing, query processing and optimization, and big data analytics. He has published 90 high quality research papers in top international conferences and journals, including PVLDB, IEEE ICDE, ACM WWW, AAAI, IEEE ICDM, EDBT, ACM CIKM, IEEE TKDE, VLDB Journal, IEEE TII, and WWW Journal. His professional service can be identified by different roles in academic committees, e.g., the technical program committee members in ACM SIGMOD, PVLDB, AAAI, PAKDD, IEEE ICDM, and ACM CIKM; the journal reviewer in IEEE TKDE, ACM TKDD, WWW Journal and VLDB Journal; the proceeding chairs in DASFAA 2018, ADMA 2016 and ADC 2015; and the program committee chair in ADMA 2019, and the International Workshop on Social Computing 2017 and 2018; the tutorial chair in the 26th International Conference on WWW 2017; and the guest editors in international journals, such as Computational Intelligence, IET Intelligent Transport Systems, Complexity, Data Science and Engineering.