Sciweavers

478 search results - page 18 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
FLAIRS
2007
13 years 9 months ago
Inference of Edge Replacement Graph Grammars
We describe an algorithm and experiments for inference of edge replacement graph grammars. This method generates candidate recursive graph grammar productions based on isomorphic ...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
ICDAR
2007
IEEE
13 years 8 months ago
Example-Based Logical Labeling of Document Title Page Images
This paper presents a flexible and effective examplebased approach for labeling title pages which can be used for automated extraction of bibliographic data. The labels of intere...
Joost van Beusekom, Daniel Keysers, Faisal Shafait...
ISAAC
2004
Springer
103views Algorithms» more  ISAAC 2004»
14 years 3 days ago
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
Ulrik Brandes, Jürgen Lerner
ISMIS
2003
Springer
13 years 12 months ago
Similarity Graphs
Abstract. The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the iss...
Rasmus Knappe, Henrik Bulskov, Troels Andreasen
ICASSP
2011
IEEE
12 years 10 months ago
Similarity learning for semi-supervised multi-class boosting
In semi-supervised classification boosting, a similarity measure is demanded in order to measure the distance between samples (both labeled and unlabeled). However, most of the e...
Q. Y. Wang, Pong Chi Yuen, Guo-Can Feng