73 search results - page 9 / 15 » Substructure Similarity Search in Graph Databases |
ADBIS
2007
Springer
14 years 1 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
JCP
2008
13 years 7 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
MIR
2004
ACM
14 years 26 days ago
2004
ACM
This paper proposes a new approach and algorithm for the similarity measure of video clips. The similarity is mainly based on two bipartite graph matching algorithms: maximum matc...
IBIS
2006
13 years 7 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present a semi-supervised learning method for web page classification, leveraging click logs to augment training data by propagating class labels to unlabeled si...