Sciweavers

306 search results - page 21 / 62
» Mining tree queries in a graph
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
14 years 9 months ago
Progressive Keyword Search in Relational Databases
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 2 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 8 months ago
Decision tree modeling with relational views
Data mining is a useful decision support technique that can be used to discover production rules in warehouses or corporate data. Data mining research has made much effort to appl...
Fadila Bentayeb, Jérôme Darmont
JSS
2008
139views more  JSS 2008»
13 years 7 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung