Abstract:
Community search on various graphs finds query-dependent communities. Intimate-core group (community) search over a weighted graph finds a connected k-core of query nodes with the smallest group weight.
State-of-the-art methods refine an answer from the maximal k-core, which is inefficient for large networks. This paper introduces local exploration k-core search (LEKS), a fast method for finding intimate-core groups in graphs.
We connect query nodes with a small-weighted spanning tree and expand it level by level to a connected k-core, which we refine as an intimate-core group. We also develop a weighted-core index (WC-index) and two new LEKS algorithms for expansion and refinement to support intimate group search over large weighted graphs.
We propose a WC-index-based expansion to efficiently find an intimate-core group graph using a two-level expansion of k-breadth and 1-depth. Two graph removal strategies are coarse-grained refinement for large graphs and fine-grained refinement for small graphs. Our methods work in real-world networks with ground-truth communities.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
