Results 1  10
of
1,220,228
Web graph similarity for anomaly detection
 Journal of Internet Services and Applications
, 2010
"... Web graphs are approximate snapshots of the web, created by search engines. They are essential to monitor the evolution of the web and to compute global properties like PageRank values of web pages. Their continuous monitoring requires a notion of graph similarity to help measure the amount and sign ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
Web graphs are approximate snapshots of the web, created by search engines. They are essential to monitor the evolution of the web and to compute global properties like PageRank values of web pages. Their continuous monitoring requires a notion of graph similarity to help measure the amount
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
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
, 2002
"... Matching elements of two data schemas or two data instances plays a key role in data warehousing, ebusiness, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (sch ..."
Abstract

Cited by 575 (12 self)
 Add to MetaCart
Matching elements of two data schemas or two data instances plays a key role in data warehousing, ebusiness, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Efficient similarity search in sequence databases
, 1994
"... We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Anot ..."
Abstract

Cited by 505 (21 self)
 Add to MetaCart
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong
Construction of abstract state graphs with PVS
, 1997
"... We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a reasonab ..."
Abstract

Cited by 748 (10 self)
 Add to MetaCart
We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple
Results 1  10
of
1,220,228