UM
Optimized and Frequent Subgraphs: How Are They Related?
Rehman, Saif Ur; Asghar, Sohail; Fong, Simon James
2018
Source PublicationIEEE ACCESS
ISSN2169-3536
Volume6Pages:37237-37249
AbstractFrequent subgraph mining (FSM) is one of the most challenging tasks in graph mining. FSM consists of applying the data mining algorithms to extract interesting, unexpected, and useful graph patterns from the graphs. It also aspires to offer a richer apprehension of the given graph data. FSM has been applied to many domains, such as graphical data management and knowledge discovery, social network analysis, Bioinformatics, and security. In this context, a large number of techniques have been suggested to deal with the graph data, with the objective to extract the frequently occurring graph patterns. Such patterns are called frequent subgraph patterns (FSPs). FSPs are extracted using the traditional support threshold parameter. However, there exists no specialized scheme to decide the discovered FSPs are optimized as well. Thus, the aim of this paper is to suggest an optimization strategy to uncover the association between the frequent and the optimized subgraph patterns. For exploring the existence of the potential association between the FSPs and the optimized subgraph, a Particle Swarm Optimization technique is suggested. This relationship will be very handy to reduce the FSPs, by choosing those FSPs which were also discovered as optimized FSPs. Different experiments are performed using benchmark graph data sets to validate the existence of the aforementioned relationship between the optimized and the frequent FSPs.
KeywordData mining graph pattern mining social network analysis frequent subgraph patterns optimized graph patterns
DOI10.1109/ACCESS.2018.2846604
URLView the original
Indexed BySCI
Language英语
WOS Research AreaComputer Science ; Engineering ; Telecommunications
WOS SubjectComputer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications
WOS IDWOS:000439698700063
PublisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
The Source to ArticleWOS
全文获取链接
引用统计
Document TypeJournal article
专题University of Macau
推荐引用方式
GB/T 7714
Rehman, Saif Ur,Asghar, Sohail,Fong, Simon James. Optimized and Frequent Subgraphs: How Are They Related?[J]. IEEE ACCESS,2018,6:37237-37249.
APA Rehman, Saif Ur,Asghar, Sohail,&Fong, Simon James.(2018).Optimized and Frequent Subgraphs: How Are They Related?.IEEE ACCESS,6,37237-37249.
MLA Rehman, Saif Ur,et al."Optimized and Frequent Subgraphs: How Are They Related?".IEEE ACCESS 6(2018):37237-37249.
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
Google Scholar
中相似的文章 Google Scholar
[Rehman, Saif Ur]的文章
[Asghar, Sohail]的文章
[Fong, Simon James]的文章
Baidu academic
中相似的文章 Baidu academic
[Rehman, Saif Ur]的文章
[Asghar, Sohail]的文章
[Fong, Simon James]的文章
Bing Scholar
中相似的文章 Bing Scholar
[Rehman, Saif Ur]的文章
[Asghar, Sohail]的文章
[Fong, Simon James]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。