Sciweavers

1107 search results - page 8 / 222
» Multi-instance tree learning
Sort
View
RFIDSEC
2010
14 years 9 months ago
Tree-Based RFID Authentication Protocols Are Definitively Not Privacy-Friendly
Authentication for low-cost Radio-Frequency IDentification (RFID) is a booming research topic. The challenge is to develop secure protocols using lightweight cryptography, yet ensu...
Gildas Avoine, Benjamin Martin 0002, Tania Martin
BMCBI
2011
14 years 6 months ago
Using Stochastic Causal Trees to Augment Bayesian Networks for Modeling eQTL Datasets
Background: The combination of genotypic and genome-wide expression data arising from segregating populations offers an unprecedented opportunity to model and dissect complex phen...
Kyle C. Chipman, Ambuj K. Singh
COLT
2003
Springer
15 years 4 months ago
Learning Random Log-Depth Decision Trees under the Uniform Distribution
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
Jeffrey C. Jackson, Rocco A. Servedio
SIGKDD
2000
96views more  SIGKDD 2000»
14 years 11 months ago
The MP13 Approach to the KDD'99 Classifier Learning Contest
The MP13 method is best summarized as recognition based on voting decision trees using "pipes" in potential space. Keywords Voting; Decision Tree; Potential Space
Vladimir Miheev, Alexei Vopilov, Ivan Shabalin
ICGI
2000
Springer
15 years 2 months ago
Constructive Learning of Context-Free Languages with a Subpansive Tree
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimo...