2,019 Hits in 3.7 sec

A Parallel Approach for Frequent Subgraph Mining in a Single Large Graph Using Spark

Fengcai Qiao, Xin Zhang, Pei Li, Zhaoyun Ding, Shanshan Jia, Hui Wang
2018 Applied Sciences  
In this paper, we propose SSIGRAM (Spark based Single Graph Mining), a Spark based parallel frequent subgraph mining algorithm in a single large graph.  ...  Frequent subgraph mining (FSM) plays an important role in graph mining, attracting a great deal of attention in many areas, such as bioinformatics, web data mining and social networks.  ...  A CAM is also a suboptimal CAM. A proper suboptimal CAM is denoted as a suboptimal CAM that is not the CAM of the graph it represents.  ... 
doi:10.3390/app8020230 fatcat:2hufr5r2ebcn7nb5hc4fnbllhi

Page 3130 of Mathematical Reviews Vol. , Issue 82g [page]

1982 Mathematical Reviews  
Polynomial equivalence of the graph isomorphism problem and the LD isomorphism problem is proved.  ...  In this paper we show that deciding isomorphism of general graphs is as hard as deciding isomorphism of special graphs (e.g., regular, antisymmetric pseudoregular, or antisymmetric regular graphs) and  ... 

Fast Suboptimal Algorithms for the Computation of Graph Edit Distance [chapter]

Michel Neuhaus, Kaspar Riesen, Horst Bunke
2006 Lecture Notes in Computer Science  
The suboptimality of our methods mainly results in larger inter-class distances, while intra-class distances remain low, which makes the proposed methods very well applicable to distance-based graph classification  ...  Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching.  ...  Genetic algorithms offer an efficient way to cope with large search spaces, but are non-deterministic and suboptimal.  ... 
doi:10.1007/11815921_17 fatcat:cyov4lyjove2zdq6673u7s5ara


2004 International journal of pattern recognition and artificial intelligence  
A recent paper posed the question: "Graph Matching: What are we really talking about?".  ...  The second taxonomy considers the types of common applications of graph-based techniques in the Pattern Recognition and Machine Vision field.  ...  In a successive paper by the same authors 134 a more efficient, suboptimal algorithm is presented.  ... 
doi:10.1142/s0218001404003228 fatcat:ntikshcxqvb4pcp64aonyvmije

Frequent Graph Patterns [chapter]

Jun Huan
2016 Encyclopedia of Database Systems  
There are three key concepts in mining graph databases: (i) labeled graph, (ii) subgraph isomorphism, and (iii) graph support value.  ...  With the previous definition, a graph database is a set of labeled graphs. Definition 2 if there exists a 1-1 mapping f: V 0 ! V such that 8v 2 V 0 ; oe 0 .  ...  Given a subgraph isomorphism f, the image of the domain V 0 (f(V 0 ))is an embedding of G 0 in G. Figure 1 shows a graph database of three labeled graphs. The mapping (isomorphism) q 1 !  ... 
doi:10.1007/978-1-4899-7993-3_168-2 fatcat:34kwotaocfggtfayjlayrwyegm

Local Structure Comparison of Proteins [chapter]

Jun Huan, Jan Prins, Wei Wang
2006 Advances in Computers  
We present a new algorithm for this problem that uses a graph-based representation of protein structure and finds recurring subgraphs among a group of protein graphs.  ...  It is an active topic in bioinformatics research, integrating computer science concepts in computational geometry and graph theory with empirical observations and physical principles from biochemistry.  ...  We denote a proper suboptimal CAM as a suboptimal CAM that is not the CAM of the graph it represents. Several suboptimal CAMs (the matrices with dotted boundaries) are shown in Fig. 15 .  ... 
doi:10.1016/s0065-2458(06)68005-4 fatcat:5dsp5xan5jccplavjamkklld4i

An Entropy Heuristic to Optimize Decision Diagrams for Index-driven Search in Biological Graph Databases

Nicola Licheri, Elvio Amparone, Vincenzo Bonnici, Rosalba Giugno, Marco Beccuti
2021 International Conference on Information and Knowledge Management  
A key computational task regarding graphs is the search of specific topologies contained in them.  ...  Graphs are a widely used structure for knowledge representation. Their uses range from biochemical to biomedical applications and are recently involved in multi-omics analyses.  ...  subgraph isomorphism algorithm (i.e.  ... 
dblp:conf/cikm/LicheriABGB21 fatcat:wow7wwpiyzbzpo7i2bpxfs3sfm

Comparing stars

Zhiping Zeng, Anthony K. H. Tung, Jianyong Wang, Jianhua Feng, Lizhu Zhou
2009 Proceedings of the VLDB Endowment  
For example, a variety of effective algorithms have been devised to mine graph patterns(e.g., frequent patterns) from graph databases [33] , to index graph databases for efficiently processing graph search  ...  : 1. full graph search: find all graphs gi in D s.t. gi is the same as q [4];  ...  The graph isomorphism from g1 to g is therefore a subgraph isomorphism from g1 to g2, i.e., g1 g2.  ... 
doi:10.14778/1687627.1687631 fatcat:gjpo5ulwljdmpmaae474vke3pm

Efficient subgraph matching using topological node feature constraints

Nicholas Dahm, Horst Bunke, Terry Caelli, Yongsheng Gao
2015 Pattern Recognition  
This paper presents techniques designed to minimise the number of states which are explored during subgraph isomorphism detection.  ...  A set of advanced topological node features, calculated from nneighbourhood graphs, is presented and shown to outperform existing features.  ...  [17] presents a polynomialtime algorithm for graph isomorphism in the general case. Their method is suboptimal, in that some graph pairs are rejected due to unresolved permutations.  ... 
doi:10.1016/j.patcog.2014.05.018 fatcat:5biqdm3szjg6fn64nme47yekfa

Exact and Inexact Graph Matching: Methodology and Applications [chapter]

Kaspar Riesen, Xiaoyi Jiang, Horst Bunke
2010 Managing and Mining Graph Data  
The process of evaluating the similarity of graphs is referred to as graph matching. Two approaches to this task exist, viz. exact and inexact graph matching.  ...  The former approach aims at finding a strict correspondence between two graphs to be matched, while the latter is able to cope with errors and measures the difference of two graphs in a broader sense.  ...  Two fast but suboptimal algorithms for graph edit distance computation are proposed in [59] .  ... 
doi:10.1007/978-1-4419-6045-0_7 dblp:series/ads/RiesenJB10 fatcat:mr2bpz5xwnbiva5x3mxbzqrnhm

Error-tolerant graph matching: A formal framework and algorithms [chapter]

H. Bunke
1998 Lecture Notes in Computer Science  
Then some new optimal algorithms for error-tolerant graph matching are discussed. Under specific conditions, the new algorithms may be significantly more efficient than traditional methods.  ...  cost functions for error-tolerant graph matching.  ...  Standard algorithms for graph matching include graph isomorphism, subgraph isomorphism, and maximum common subgraph search [1, 2] .  ... 
doi:10.1007/bfb0033223 fatcat:sfyjlcxnmjdmxhfhd25mg5rroa

Page 3093 of Mathematical Reviews Vol. , Issue 94f [page]

1994 Mathematical Reviews  
This paper is concerned with the difficult but important issue of efficient embedding algorithms for graphs in the projective plane.  ...  For digraphs with 10000 vertices or more, a two-phase heuristic, which gives a fast but suboptimal solution, is proposed.  ... 

An Application of Boosting to Graph Classification

Taku Kudo, Eisaku Maeda, Yuji Matsumoto
2004 Neural Information Processing Systems  
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural language texts, and bio sequences  ...  Two experiments using natural language data and chemical compounds show that our method achieves comparable or even better performance than SVMs with convolution kernels as well as improves the testing efficiency  ...  Efficient Computation in Boosting At each Boosting iteration, the suboptimal value τ is reset to 0.  ... 
dblp:conf/nips/KudoMM04 fatcat:u7sipv4znzcrlmeuximfoq2ini


2012 International journal of pattern recognition and artificial intelligence  
On the one hand they can be used to improve performance of existing algorithms and, on the other hand, they can be used to develop more efficient graph algorithms.  ...  Some graph distances appear in the literature [20-22], but probably the most well known distance is the Graph Edit Distance [23].  ...  Basic definitions and Graph Edit Distance Error correcting graph isomorphism between graphs Let and be two attributed graphs of order and .  ... 
doi:10.1142/s021800141260004x fatcat:2bplaauyijgp5puvgv3dd3ab6u

An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings

Pierre Le Bodic, Pierre Héroux, Sébastien Adam, Yves Lecourtier
2012 Pattern Recognition  
This problem aims at finding a subgraph isomorphism of a pattern graph S in a target graph G. This isomorphism only considers label substitutions and forbids vertex and edge insertion in G.  ...  This kind of subgraph isomorphism is often needed in pattern recognition problems when graphs are attributed with real values and no exact matching can be found between attributes due to noise.  ...  One the other hand, the complexity issue is tackled by suboptimal optimization techniques.  ... 
doi:10.1016/j.patcog.2012.05.022 fatcat:xhhp2v3dpnfvrecbsvjb7xwb74
« Previous Showing results 1 — 15 out of 2,019 results