2695 search results - page 123 / 539 » Learning Graph Matching |
109
Voted
COLT
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
129
click to vote
ILP
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
112
Voted
CIMCA
2005
IEEE
15 years 8 months ago
2005
IEEE
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
126
click to vote
ICDM
2002
IEEE
15 years 7 months ago
2002
IEEE
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...
117
Voted
ICIAP
1999
ACM
15 years 6 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...