Sciweavers

2382 search results - page 17 / 477
» Generating Seeded Trees from Data Sets
Sort
View
136
Voted
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 8 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
126
Voted
ICRA
2009
IEEE
163views Robotics» more  ICRA 2009»
15 years 10 months ago
3D tree reconstruction from laser range data
— We present a method for reconstructing 3D models of tree branch structure from laser range data. Our approach is probabilistic, and uses a generative model of a tree to guide a...
Jonathan Binney, Gaurav S. Sukhatme
ACL
1996
15 years 5 months ago
Generating an LTAG out of a Principle-based Hierarchical Representation
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
Marie-Hélène Candito
BMCBI
2006
119views more  BMCBI 2006»
15 years 4 months ago
Utilization of two sample t-test statistics from redundant probe sets to evaluate different probe set algorithms in GeneChip stu
Background: The choice of probe set algorithms for expression summary in a GeneChip study has a great impact on subsequent gene expression data analysis. Spiked-in cRNAs with know...
Zihua Hu, Gail R. Willsky
127
Voted
FLAIRS
2007
15 years 6 months ago
A Distance-Based Over-Sampling Method for Learning from Imbalanced Data Sets
Many real-world domains present the problem of imbalanced data sets, where examples of one classes significantly outnumber examples of other classes. This makes learning difficu...
Jorge de la Calleja, Olac Fuentes