Abstract
The problem of structural diversity search is to find the top-k vertices with the largest structural diversity in a graph. However, when identifying distinct social contexts, existing structural diversity models (e.g., t-sized component, t-core, and t-brace) are sensitive to an input parameter of t. To address this drawback, we propose a parameter-free structural diversity model. Specifically, we propose a novel notation of which automatically models various kinds of social contexts without parameter t. Leveraging on and h-index, the structural diversity score for a vertex is calculated. We study the problem of parameter-free structural diversity search in this paper. An efficient top-k search algorithm with a well-designed upper bound for pruning is proposed. Extensive experiment results demonstrate the parameter sensitivity of existing t-core based model and verify the superiority of our methods.
Original language | English |
---|---|
Title of host publication | Web Information Systems Engineering – WISE 2019 - 20th International Conference, Proceedings |
Editors | Reynold Cheng, Nikos Mamoulis, Yizhou Sun, Xin Huang |
Publisher | Springer |
Pages | 677-693 |
Number of pages | 17 |
ISBN (Print) | 9783030342227 |
DOIs | |
Publication status | Published - 29 Oct 2019 |
Event | 20th International Conference on Web Information Systems Engineering, WISE 2019 - , Hong Kong Duration: 19 Jan 2020 → 22 Jan 2020 https://link.springer.com/book/10.1007/978-3-030-34223-4 https://wise2019.comp.polyu.edu.hk/ |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 11881 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 20th International Conference on Web Information Systems Engineering, WISE 2019 |
---|---|
Country/Territory | Hong Kong |
Period | 19/01/20 → 22/01/20 |
Internet address |
Scopus Subject Areas
- Theoretical Computer Science
- Computer Science(all)