文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Frequent subgraph mining in outerplanar graphs
侵权投诉

Frequent subgraph mining in outerplanar graphs

Abstract. In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time

FrequentSubgraphMininginOuterplanarGraphs

Tam´asHorv´ath1,2,JanRamon3,andStefanWrobel2,1

Dept.ofComputerScienceIII,UniversityofBonn,Germany

2FraunhoferIAIS,SanktAugustin,Germany

Dept.ofComputerScience,KatholiekeUniversiteitLeuven,Belgium13

Abstract.Inrecentyearstherehasbeenanincreasedinterestinfrequentpatterndiscoveryinlargedatabasesofgraphstructuredobjects.Whilethefrequentcon-nectedsubgraphminingproblemfortreedatasetscanbesolvedinincrementalpolynomialtime,itbecomesintractableforarbitrarygraphdatabases.Existingapproacheshavethereforeresortedtovariousheuristicstrategiesandrestrictionsofthesearchspace,buthavenotidenti edapracticallyrelevanttractablegraphclassbeyondtrees.Inthispaper,wede netheclassofsocalledtenuousouterpla-nargraphs,astrictgeneralizationoftrees,developafrequentsubgraphminingalgorithmfortenuousouterplanargraphsthatworksinincrementalpolynomialtime,andevaluatethealgorithmempiricallyontheNCImoleculargraphdataset.1Introduction

Thediscoveryoffrequentpatternsinadatabaseisoneofthecentraltasksconsideredindatamining.Inadditiontobeinterestingintheirownright,frequentpatternscanalsobeusedasfeaturesforpredictivedataminingtasks(see,e.g.,[5]).Foralongtime,workonfrequentpatterndiscoveryhasconcentratedonrelativelysimplenotionsofpatternsandelementsinthedatabaseastheyaretypicallyusedforthediscoveryofassociationrules(simplesetsofatomicitems).Inrecentyears,however,duetothesigni canceofapplicationareassuchastheanalysisofchemicalmoleculesorgraphstructuresintheWWW,therehasbeenanincreasedinterestinalgorithmsthatcanperformfrequentpatterndiscoveryindatabasesofstructuredobjectssuchastreesorarbitrarygraphs.Whilethefrequentpatternproblemfortreescanbesolvedinincrementalpoly-nomialtime,i.e.,intimepolynomialinthecombinedsizeoftheinputandthesetoffrequenttreepatternssofarcomputed,thefrequentpatternproblemforgraphstruc-tureddatabasesinthegeneralcasecannotbesolvedinoutputpolynomialtime,i.e.,intimepolynomialinthecombinedsizeoftheinputandthesetofallfrequentpatterns.Existingapproachestofrequentpatterndiscoveryforgraphshavethereforeresortedtovariousheuristicstrategiesandrestrictionsofthesearchspace(see,e.g.,[4,5,8,17]),buthavenotidenti edapracticallyrelevanttractablegraphclassbeyondtrees.

Inthispaper,wede netheclassofsocalledtenuousouterplanargraphs,whichistheclassofplanargraphsthatcanbeembeddedintheplaneinsuchawaythatallofitsverticeslieontheouterboundary,i.e.canbereachedfromtheoutsidewithoutcrossinganyedges,andwhichhavea xedlimitonthenumberofinsidediagonaledges.This AlongerversionofthispaperhasbeenacceptedtoACMSIGKDD’06.

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email