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.
Wrobel. Frequent subgraph mining in outerplanar graphs. In Workshop on Mining and Learning with Graphs (MLG 2006), Berlin, Germany, September 2006. Sub...
wang_Managing and Mining Billion-Node Graphs_数学_自然科学_专业资料。2012... Frequent subgraph mini... 暂无评价 12页 免费 Multiway cuts in node .....
Mining Closed Relational Graphs with Connectivity Constraints ? Xifeng Yan? ...frequent highly connected subgraph which can identify recurrent groups and ...
Denote by Q the subgraph of G induced by X, and note that the ...V. Fomin. Approximation of pathwidth of outerplanar graphs. J. Algorithms, ...
Important problems in graph mining ? FSG: Frequent Subgraph Mining Algorithm 2 Motivation ? Graphs are very useful for modeling variety of entities and ...
Subgraph Isomorphism in Planar Graphs and Related Problems We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of ...
1 Introduction Mining Closed Relational Graphs with Connectivity Constraints 1...frequent highly connected subgraph which can identify recurrent groups and ...
A LINEAR ALGORITHM TO RECOGNIZE MAXIMAL GENERALIZED OUTERPLANAR GRAPHS Abstract...be 3-connected and a maximal 3-connected subgraph is called a 3-component...
The densest k-subgraph problem on clique graphs M. Liazi1? , I. Milis2 , F. Pascual3 and V. Zissimopoulos1 1 Department of Informatics and ...
wise search Simulate Apriori for frequent pattern discovery June 12, 2012 Mining and Searching Graphs in Graph Databases 11 Frequent Subgraph Mining Approaches...
热门文档