UM  > 科技學院
Performance Evaluation of Frequent Subgraph Discovery Techniques
Rehman, Saif Ur1; Asghar, Sohail3; Zhuang, Yan2; Fong, Simon2

Due to rapid development of the Internet technology and new scientific advances, the number of applications that model the data as graphs increases, because graphs have highly expressive power to model a complicated structure. Graph mining is a well-explored area of research which is gaining popularity in the data mining community. A graph is a general model to represent data and has been used in many domains such as cheminformatics, web information management system, computer network, and bioinformatics, to name a few. In graph mining the frequent subgraph discovery is a challenging task. Frequentsubgraph mining is concerned with discovery of those subgraphs from graph dataset which have frequent or multiple instances within the given graph dataset. In the literature a large number of frequent subgraph mining algorithms have been proposed; these included FSG, AGM, gSpan, CloseGraph, SPIN, Gaston, and Mofa. The objective of this research work is to perform quantitative comparison of the above listed techniques. The performances of these techniques have been evaluated through a number of experiments based on three different state-of-the-art graph datasets. This novel work will provide base for anyone who is working to design a new frequent subgraph discovery technique.

Indexed BySCI
WOS Research AreaEngineering ; Mathematics
WOS SubjectEngineering, Multidisciplinary ; Mathematics, Interdisciplinary Applications
WOS IDWOS:000340462500001
Fulltext Access
Citation statistics
Cited Times [WOS]:2   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionFaculty of Science and Technology
Affiliation1.PMAS Arid Agr Univ, UIIT, Rawalpindi, Pakistan
2.Univ Macau, Dept Comp & Informat Sci, Macau, Peoples R China
3.COMSATS Islamabad, Islamabad, Pakistan
Recommended Citation
GB/T 7714
Rehman, Saif Ur,Asghar, Sohail,Zhuang, Yan,et al. Performance Evaluation of Frequent Subgraph Discovery Techniques[J]. MATHEMATICAL PROBLEMS IN ENGINEERING,2014.
APA Rehman, Saif Ur,Asghar, Sohail,Zhuang, Yan,&Fong, Simon.(2014).Performance Evaluation of Frequent Subgraph Discovery Techniques.MATHEMATICAL PROBLEMS IN ENGINEERING.
MLA Rehman, Saif Ur,et al."Performance Evaluation of Frequent Subgraph Discovery Techniques".MATHEMATICAL PROBLEMS IN ENGINEERING (2014).
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Rehman, Saif Ur]'s Articles
[Asghar, Sohail]'s Articles
[Zhuang, Yan]'s Articles
Baidu academic
Similar articles in Baidu academic
[Rehman, Saif Ur]'s Articles
[Asghar, Sohail]'s Articles
[Zhuang, Yan]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Rehman, Saif Ur]'s Articles
[Asghar, Sohail]'s Articles
[Zhuang, Yan]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.