LINC: a motif counting algorithm for uncertain graphs

Ma, Chenhao; Cheng, Reynold; Lakshmanan, Laks V. S.; Grubenmann, Tobias; Fang, Yixiang; Li, Xiaodong

Abstract

In graph applications (e.g., biological and social networks), various analytics tasks (e.g., clustering and community search) are carried out to extract insight from large and complex graphs. Central to these tasks is the counting of the number of motifs, which are graphs with a few nodes. Recently, researchers have developed several fast motif counting algorithms. Most of these solutions assume that graphs are deterministic, i.e., the graph edges are certain to exist. However, due to measurement and statistical prediction errors, this assumption may not hold, and hence the analysis quality can be affected. To address this issue, we examine how to count motifs on uncertain graphs, whose edges only exist probabilistically. Particularly, we propose a solution framework that can be used by existing deterministic motif counting algorithms. We further propose an approximation algorithm. Extensive experiments on real datasets show that our algorithms are more effective and efficient than existing solutions.

Citation

Ma, C., Cheng, R., Lakshmanan, L. V. S., Grubenmann, T., Fang, Y., & Li, X. (2019). LINC: a motif counting algorithm for uncertain graphs. Proceedings of the VLDB Endowment, 13(2), 155-168. https://doi.org/10.14778/3364324.3364330

• Journal Article Type: Article
• Online Publication Date: Oct 1, 2019
• Publication Date: 2019-10
• Deposit Date: Jun 8, 2023
• Journal: Proceedings of the VLDB Endowment
• Print ISSN: 2150-8097
• Publisher: VLDB Endowment
• Peer Reviewed: Peer Reviewed
• Volume: 13
• Issue: 2
• Pages: 155-168
• DOI: https://doi.org/10.14778/3364324.3364330
• Public URL: http://researchrepository.napier.ac.uk/Output/3120936