The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Learning from tree-structured data has received increasing interest with the rapid growth of tree-encodable data in the World Wide Web, in biology, and in other areas. Our kernel function measures the similarity between two trees by counting the number of shared sub-patterns called tree q-grams, and runs, in effect, in linear time with respect to the number of tree nodes. We apply our kernel function with a support vector machine (SVM) to classify biological data, the glycans of several blood components. The experimental results show that our kernel function performs as well as one exclusively tailored to glycan properties.
Ryan Johnson, Ippokratis Pandis
CIDR 2013
George Saon
SLT 2014
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Rangachari Anand, Kishan Mehrotra, et al.
IEEE Transactions on Neural Networks