Sciweavers

711 search results - page 40 / 143
» Matching Hierarchical Structures Using Association Graphs
Sort
View
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 9 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
PAKDD
2011
ACM
253views Data Mining» more  PAKDD 2011»
12 years 10 months ago
Balance Support Vector Machines Locally Using the Structural Similarity Kernel
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
Jianxin Wu
BMCBI
2008
145views more  BMCBI 2008»
13 years 7 months ago
Directed acyclic graph kernels for structural RNA analysis
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
Kengo Sato, Toutai Mituyama, Kiyoshi Asai, Yasubum...
ASP
2003
Springer
14 years 25 days ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 2 months ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...