404 search results - page 45 / 81 » Correlation search in graph databases |
DATAMINE
2000
13 years 8 months ago
2000
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
EC
2007
13 years 8 months ago
2007
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...
ICDAR
2011
IEEE
12 years 8 months ago
2011
IEEE
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
CIKM
2009
Springer
14 years 8 hour ago
2009
Springer
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...