Efficient Mining Of Frequent Patterns On Uncertain Graphs

Project Code :TCREPY19_116

Abstract

Efficient Mining of Frequent Patterns on Uncertain Graphs

Abstract

Uncertainty is intrinsic to a wide spectrum of real-life applications, which inevitably applies to graph data. Representative uncertain graphs are seen in bio-informatics, social networks, etc. This paper motivates the problem of frequent sub graph mining on single uncertain graphs, and investigates two different - probabilistic and expected - semantics in terms of support definitions. First, we present an enumeration-evaluation algorithm to solve the problem under probabilistic semantics. By showing the support computation under probabilistic semantics is #P-complete, we develop an approximation algorithm with accuracy guarantee for efficient problem-solving. To enhance the solution, we devise computation sharing techniques to achieve better mining performance. Afterwards, the algorithm is extended in a similar flavour to handle the problem under expected semantics, where checkpoint-based pruning and validation techniques are integrated. Experiment results on real-life datasets confirm the practical usability of the mining algorithms.

NOTE: Without the concern of our team, please don't submit to the college. This Abstract varies based on student requirements.

Block Diagram

Specifications

12/7 Support, Voice Conference, Video On Demand, Remote Connectivity, Customization, Live Chat Support, Toll Free Support

Demo Video

mail-banner
call-banner
contact-banner
Request Video

Related Projects

Final year projects