289 search results - page 6 / 58 » Node similarity in the citation graph |
SIGIR
2010
ACM
13 years 11 months ago
2010
ACM
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
ICOIN
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...