Next Article in Journal
Temporal Convolution Network Based Joint Optimization of Acoustic-to-Articulatory Inversion
Previous Article in Journal
Rocking Curve Imaging Investigation of the Long-Range Distortion Field between Parallel Dislocations with Opposite Burgers Vectors
Article

Cohesive Subgraph Identification in Weighted Bipartite Graphs

School of Computer and Information Engineering, Zhejiang Gongshang University, Hangzhou 310018, China
*
Author to whom correspondence should be addressed.
Academic Editor: Ugo Vaccaro
Received: 8 September 2021 / Revised: 22 September 2021 / Accepted: 24 September 2021 / Published: 28 September 2021
(This article belongs to the Special Issue Cohesive Subgraph Computation over Massive Sparse Networks)
Cohesive subgraph identification is a fundamental problem in bipartite graph analysis. In real applications, to better represent the co-relationship between entities, edges are usually associated with weights or frequencies, which are neglected by most existing research. To fill the gap, we propose a new cohesive subgraph model, (k,ω)-core, by considering both subgraph cohesiveness and frequency for weighted bipartite graphs. Specifically, (k,ω)-core requires each node on the left layer to have at least k neighbors (cohesiveness) and each node on the right layer to have a weight of at least ω (frequency). In real scenarios, different users may have different parameter requirements. To handle massive graphs and queries, index-based strategies are developed. In addition, effective optimization techniques are proposed to improve the index construction phase. Compared with the baseline, extensive experiments on six datasets validate the superiority of our proposed methods. View Full-Text
Keywords: bipartite graph; cohesive subgraph; (k,ω)-core; index construction bipartite graph; cohesive subgraph; (k,ω)-core; index construction
Show Figures

Figure 1

MDPI and ACS Style

Liu, X.; Wang, X. Cohesive Subgraph Identification in Weighted Bipartite Graphs. Appl. Sci. 2021, 11, 9051. https://0-doi-org.brum.beds.ac.uk/10.3390/app11199051

AMA Style

Liu X, Wang X. Cohesive Subgraph Identification in Weighted Bipartite Graphs. Applied Sciences. 2021; 11(19):9051. https://0-doi-org.brum.beds.ac.uk/10.3390/app11199051

Chicago/Turabian Style

Liu, Xijuan, and Xiaoyang Wang. 2021. "Cohesive Subgraph Identification in Weighted Bipartite Graphs" Applied Sciences 11, no. 19: 9051. https://0-doi-org.brum.beds.ac.uk/10.3390/app11199051

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop