Index-based Intimate-Core Community Search in Large Weighted Graphs


On a number of different kinds of graphs, community search that locates communities dependent on a query has been investigated. Intimate-core group (community) search is an example of community search that is performed over a weighted graph. The goal of this type of community search is to locate a connected k-core that contains all query nodes and has the lowest group weight. However, the existing methods that are considered state-of-the-art begin the process of refining an answer from the maximal k-core, which is practically inefficient for large networks. In this paper, we develop an efficient framework for finding intimate-core groups in graphs. We refer to this as the local exploration k-core search (LEKS) algorithm. After connecting query nodes with a small-weighted spanning tree, which we propose, we expand the tree level by level until we reach a connected k-core, which is then further refined into an intimate-core group. In addition, we develop a weighted-core index (WC-index) and two new algorithms for expansion and refinement phases in LEKS that are based on the WC-index. This is done to support the intimate group search over large weighted graphs. To be more specific, we propose a WC-index-based expansion that makes use of a two-level expansion consisting of k-breadth and 1-depth in order to locate a candidate graph of an intimate-core group in a time-efficient manner. We suggest two approaches to the removal of graphs: the first, coarse-grained refinement, is intended for large graphs and can delete a batch of nodes in a few iterations; the second, fine-grained refinement, is intended for small graphs and can remove nodes carefully while achieving high-quality answers. Extensive testing on operational networks containing ground-truth communities has shown that the proposed methods are both effective and efficient.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :Index-Based Densest Clique Percolation Community Search in Networks - 2018ABSTRACT:Community search is very important in graph analysis and will be used in many real applications. Within the literature, various
PROJECT TITLE : Video Dissemination over Hybrid Cellular and Ad Hoc Networks - 2014 ABSTRACT: We study the problem of disseminating videos to mobile users by using a hybrid cellular and ad hoc network. In particular, we formulate
PROJECT TITLE : PSR A Lightweight Proactive Source Routing Protocol For Mobile Ad Hoc Networks - 2014 ABSTRACT: Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networking,
PROJECT TITLE : Joint Routing and Medium Access Control in Fixed Random Access Wireless Multihop Networks - 2014 ABSTRACT: We study cross-layer design in random-access-based fixed wireless multihop networks under a physical
PROJECT TITLE : Cross-Layer Aided Energy-Efficient Opportunistic Routing in Ad Hoc Networks - 2014 ABSTRACT: Most of the nodes in ad hoc networks rely on batteries, which requires energy saving. Hence, numerous energy-efficient

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry