An efficient algorithm for finding frequent and diverse subgraph patterns in PPI networks Online publication date: Mon, 26-Jan-2015
by Wubin Ma; Mingxing Liu; Hongbin Huang; Deng Su
International Journal of Sensor Networks (IJSNET), Vol. 16, No. 4, 2014
Abstract: Finding frequent subgraph patterns in uncertain graph databases become an important problem with applications. The main difficulty in solving the problem is finding frequent subgraph patterns from the large number of candidate graph and testing large number of subgraph isomorphism from the graphs that contain a given pattern. The traditional method of finding frequent subgraph patterns cannot distinguish the diverse patterns of uncertain graph database. In this paper, we propose a method named mining uncertain and diverse subgraph pattern (MUDSP) in PPI networks. It is used to find the different subgraph pattern including high proportion or high probability pattern. The algorithm is also enables necessary optimisations with respect to pruning index tree. The evaluation of our approach on real-world datasets of uncertain graph databases demonstrates the efficiency with respect to approach of finding diverse pattern.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook