PROJECT TITLE :

Efficient and Exact Local Search for Random Walk Based Top-K Proximity Query in Large Graphs

ABSTRACT:

High- proximity question in massive graphs may be a fundamental problem with a wide selection of applications. Varied random walk primarily based measures have been proposed to measure the proximity between totally different nodes. Though these measures are effective, efficiently computing them on giant graphs may be a challenging task. During this paper, we tend to develop an economical and exact native search method, FLoS (Fast Native Search), for high- proximity question in large graphs. FLoS guarantees the exactness of the solution. Moreover, it can be applied to a selection of commonly used proximity measures. FLoS relies on the no native optimum property of proximity measures. We have a tendency to show that several measures don't have any native optimum. Utilizing this property, we tend to introduce several operations to control transition chances and develop tight lower and higher bounds on the proximity values. The lower and upper bounds monotonically converge to the exact proximity value when more nodes are visited. We have a tendency to more extend FLoS to measures having local optimum by utilizing relationship among different measures. We perform comprehensive experiments on real and artificial large graphs to evaluate the potency and effectiveness of the proposed methodology.


Did you like this research project?

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


PROJECT TITLE : TARA: An Efficient Random Access Mechanism for NB-IoT by Exploiting TA Value Difference in Collided Preambles ABSTRACT: The 3rd Generation Partnership Project (3GPP) has specified the narrowband Internet of Things
PROJECT TITLE : ESVSSE Enabling Efficient, Secure, Verifiable Searchable Symmetric Encryption ABSTRACT: It is believed that symmetric searchable encryption, also known as SSE, will solve the problem of privacy in data outsourcing
PROJECT TITLE : ESA-Stream: Efficient Self-Adaptive Online Data Stream Clustering ABSTRACT: A wide variety of big data applications generate an enormous amount of streaming data that is high-dimensional, real-time, and constantly
PROJECT TITLE : Efficient Shapelet Discovery for Time Series Classification ABSTRACT: Recently, it was discovered that time-series shapelets, which are discriminative subsequences, are effective for the classification of time
PROJECT TITLE : Efficient Identity-based Provable Multi-Copy Data Possession in Multi-Cloud Storage ABSTRACT: A significant number of clients currently store multiple copies of their data on a variety of cloud servers. This helps

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

Project Enquiry