Results 1  10
of
176,402
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
"... With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occurrences of a query graph in a large database graph is an important research topic. Due to the existence of noise (e.g., mi ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
.g., missing edges) in the large database graph, we investigate the problem of approximate subgraph indexing, i.e., finding the occurrences of a query graph in a large database graph with (possible) missing edges. The SAPPER method is proposed to solve this problem. Utilizing the hybrid neighborhood unit
Subgraph matching kernels for attributed graphs
 In ICML
, 2012
"... We propose graph kernels based on subgraph matchings, i.e. structurepreserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be applied to attributed graphs, our approach allows to rate map ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We propose graph kernels based on subgraph matchings, i.e. structurepreserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be applied to attributed graphs, our approach allows to rate
Algorithms for Graph Similarity and Subgraph Matching
, 2011
"... We deal with two independent but related problems, those of graph similarity and subgraph matching, which are both important practical problems useful in several fields of science, engineering and data analysis. For the problem of graph similarity, we develop and test a new framework for solving the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We deal with two independent but related problems, those of graph similarity and subgraph matching, which are both important practical problems useful in several fields of science, engineering and data analysis. For the problem of graph similarity, we develop and test a new framework for solving
Approximating koutconnected Subgraph Problems
 in Lecture Notes in Comput. Sci
, 1998
"... . We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for finding mincost koutconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for finding mincost koutconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained
Ontologybased subgraph querying
 In ICDE
, 2013
"... Abstract — Subgraph querying has been applied in a variety of emerging applications. Traditional subgraph querying based on subgraph isomorphism requires identical label matching, which is often too restrictive to capture the matches that are semantically close to the query graphs. This paper extend ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
of the data graph from an ontology index, and further computes the matches by only accessing the extracted subgraph. (3) In addition, we show that the ontology index can be efficiently updated upon the changes to the data graphs, enabling the framework to cope with dynamic data graphs. (4) We experimentally
Adaptive Least Squares Correlation: A Powerful Image Matching Technique
 South African Journal of Photogrammetry, Remote Sensing and Cartography
, 1985
"... The Adaptive Least Squares Correlation is a very potent and flexible technique for all kinds of data matching problems. Here its application to image matching is outlined. It allows for simultaneous radiometric corrections and local geometrical image shaping, whereby the system parameters are automa ..."
Abstract

Cited by 178 (31 self)
 Add to MetaCart
The Adaptive Least Squares Correlation is a very potent and flexible technique for all kinds of data matching problems. Here its application to image matching is outlined. It allows for simultaneous radiometric corrections and local geometrical image shaping, whereby the system parameters
Neurofuzzy modeling and control
 IEEE Proceedings
, 1995
"... Abstract  Fundamental and advanced developments in neurofuzzy synergisms for modeling and control are reviewed. The essential part of neurofuzzy synergisms comes from a common framework called adaptive networks, which uni es both neural networks and fuzzy models. The fuzzy models under the framew ..."
Abstract

Cited by 231 (1 self)
 Add to MetaCart
Abstract  Fundamental and advanced developments in neurofuzzy synergisms for modeling and control are reviewed. The essential part of neurofuzzy synergisms comes from a common framework called adaptive networks, which uni es both neural networks and fuzzy models. The fuzzy models under the framework of adaptive networks is called ANFIS (AdaptiveNetworkbased Fuzzy Inference System), which possess certain advantages over neural networks. We introduce the design methods for ANFIS in both modeling and control applications. Current problems and future directions for neurofuzzy approaches are also addressed. KeywordsFuzzy logic, neural networks, fuzzy modeling, neurofuzzy modeling, neurofuzzy control, ANFIS. I.
The Generalized Subgraph Problem: Complexity, Approximability and Polyhedra
, 2003
"... This paper is concerned with a problem on networks which we call the Generalized Subgraph Problem (GSP). The GSP is defined on an undirected graph where the vertex set is partitioned into clusters. The task is to find a subgraph which touches at most one vertex in each cluster so as to maximize the ..."
Abstract
 Add to MetaCart
This paper is concerned with a problem on networks which we call the Generalized Subgraph Problem (GSP). The GSP is defined on an undirected graph where the vertex set is partitioned into clusters. The task is to find a subgraph which touches at most one vertex in each cluster so as to maximize
On the approximability of some degreeconstrained subgraph problems
, 2011
"... In this article we provide hardness results and approximation algorithms for the following three natural degreeconstrained subgraph problems, which take as input an undirected graph G = (V, E). Let d ≥ 2 be a fixed integer. The Maximum ddegreebounded Connected Subgraph (MDBCSd) problem takes as a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this article we provide hardness results and approximation algorithms for the following three natural degreeconstrained subgraph problems, which take as input an undirected graph G = (V, E). Let d ≥ 2 be a fixed integer. The Maximum ddegreebounded Connected Subgraph (MDBCSd) problem takes
Results 1  10
of
176,402