Sciweavers

1326 search results - page 63 / 266
» Approximate Tree Kernels
Sort
View
NIPS
2008
13 years 10 months ago
Regularized Policy Iteration
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
AINA
2008
IEEE
14 years 3 months ago
Exploiting Frequent Episodes in Weighted Suffix Tree to Improve Intrusion Detection System
In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call,...
Min-Feng Wang, Yen-Ching Wu, Meng-Feng Tsai
IJCAI
1993
13 years 10 months ago
Rule-Based Regression
While decision trees have been used primarily for classification, they can also model regression or function approximation. Like classification trees, regression trees often yield...
Sholom M. Weiss, Nitin Indurkhya
RECOMB
2006
Springer
14 years 9 months ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 9 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore