UM  > 科技學院
Performance Evaluation of Frequent Subgraph Discovery Techniques
Rehman, Saif Ur1; Asghar, Sohail2; Zhuang, Yan3; Fong, Simon3
2014
Source PublicationMathematical Problems in Engineering
ISSN1024-123X
Volume2014
Abstract

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.

DOIhttp://doi.org/10.1155/2014/869198
Indexed BySCI
Language英语
WOS Research AreaEngineering ; Mathematics
WOS SubjectEngineering, Multidisciplinary ; Mathematics, Interdisciplinary Applications
WOS IDWOS:000340462500001
PublisherHINDAWI LTD, ADAM HOUSE, 3RD FLR, 1 FITZROY SQ, LONDON, W1T 5HF, ENGLAND
Fulltext Access
Citation statistics
Cited Times [WOS]:2   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionFaculty of Science and Technology
DEPARTMENT OF COMPUTER AND INFORMATION SCIENCE
Corresponding AuthorRehman, Saif Ur; Zhuang, Yan
Affiliation1.UIIT, PMAS Arid Agriculture University, Rawalpindi, Pakistan
2.COMSATS Islamabad, Pakistan
3.Department of Computer and Information Science, University of Macau, Macau
Corresponding Author AffilicationUniversity of Macau
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,2014.
APA Rehman, Saif Ur,Asghar, Sohail,Zhuang, Yan,&Fong, Simon.(2014).Performance Evaluation of Frequent Subgraph Discovery Techniques.Mathematical Problems in Engineering,2014.
MLA Rehman, Saif Ur,et al."Performance Evaluation of Frequent Subgraph Discovery Techniques".Mathematical Problems in Engineering 2014(2014).
Related Services
Recommend this item
Bookmark
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.