Networked data, notably social network data, often comes with a rich set of annotations, or attributes, such as documents (e.g., tweets) and locations (e.g., check-ins). Community search in such attributed networks has been studied intensively due to its many applications in friends recommendation, event organization, advertising, etc. We study the problem of attribute-constrained co-located community (ACOC) search, which returns a community that satisfies three properties: i) structural cohesiveness: the members in the community are densely connected; ii) spatial co-location: the members are close to each other; and iii) attribute constraint: a set of attributes are covered by the attributes associated with the members. The ACOC problem is shown to be NP-hard. We develop four efficient approximation algorithms with guaranteed error bounds in addition to an exact solution that works on relatively small graphs. Extensive experiments conducted with both real and synthetic data offer insight into the efficiency and effectiveness of the proposed methods, showing that they outperform three adapted state-of-the-art algorithms by an order of magnitude. We also find that the approximation algorithms are much faster than the exact solution and yet offer high accuracy.
|Titel||2020 IEEE 36th International Conference on Data Engineering|
|Status||Udgivet - 2020|
|Begivenhed||36th IEEE International Conference on Data Engineering - Dallas, USA|
Varighed: 20 apr. 2020 → 24 apr. 2020
|Konference||36th IEEE International Conference on Data Engineering|
|Periode||20/04/2020 → 24/04/2020|
|Navn||Proceedings of the International Conference on Data Engineering|