Sciweavers

4095 search results - page 110 / 819
» How to test a tree
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 3 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
ACL
2009
13 years 8 months ago
Comparing the Accuracy of CCG and Penn Treebank Parsers
We compare the CCG parser of Clark and Curran (2007) with a state-of-the-art Penn Treebank (PTB) parser. An accuracy comparison is performed by converting the CCG derivations into...
Stephen Clark, James R. Curran
PKDD
2005
Springer
96views Data Mining» more  PKDD 2005»
14 years 3 months ago
Testing Theories in Particle Physics Using Maximum Likelihood and Adaptive Bin Allocation
We describe a methodology to assist scientists in quantifying the degree of evidence in favor of a new proposed theory compared to a standard baseline theory. The figure of merit ...
Bruce Knuteson, Ricardo Vilalta
PRIS
2004
13 years 11 months ago
Neural Network Learning: Testing Bounds on Sample Complexity
Several authors have theoretically determined distribution-free bounds on sample complexity. Formulas based on several learning paradigms have been presented. However, little is kn...
Joaquim Marques de Sá, Fernando Sereno, Lu&...
BMCBI
2008
219views more  BMCBI 2008»
13 years 10 months ago
Classification of premalignant pancreatic cancer mass-spectrometry data using decision tree ensembles
Background: Pancreatic cancer is the fourth leading cause of cancer death in the United States. Consequently, identification of clinically relevant biomarkers for the early detect...
Guangtao Ge, G. William Wong