Sciweavers

235 search results - page 19 / 47
» Constructing New and Better Evaluation Measures for Machine ...
Sort
View
ICML
2004
IEEE
16 years 6 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
BMCBI
2010
118views more  BMCBI 2010»
15 years 6 months ago
From learning taxonomies to phylogenetic learning: Integration of 16S rRNA gene data into FAME-based bacterial classification
Background: Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limit...
Bram Slabbinck, Willem Waegeman, Peter Dawyndt, Pa...
JSS
2008
157views more  JSS 2008»
15 years 6 months ago
Can k-NN imputation improve the performance of C4.5 with small software project data sets? A comparative evaluation
Missing data is a widespread problem that can affect the ability to use data to construct effective prediction systems. We investigate a common machine learning technique that can...
Qinbao Song, Martin J. Shepperd, Xiangru Chen, Jun...
ICML
2003
IEEE
16 years 6 months ago
Boosting Lazy Decision Trees
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
Xiaoli Zhang Fern, Carla E. Brodley
ICML
2007
IEEE
16 years 6 months ago
Bottom-up learning of Markov logic network structure
Markov logic networks (MLNs) are a statistical relational model that consists of weighted firstorder clauses and generalizes first-order logic and Markov networks. The current sta...
Lilyana Mihalkova, Raymond J. Mooney