Sciweavers

1661 search results - page 165 / 333
» Decision Tree Fields
Sort
View
TCS
2008
15 years 6 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
ICSE
2009
IEEE-ACM
16 years 7 months ago
The impact of process choice in high maturity environments: An empirical analysis
We present the results of a three year field study of the software development process choices made by project teams at two leading offshore vendors. In particular, we focus on th...
Narayan Ramasubbu, Rajesh Krishna Balan
JAR
2006
106views more  JAR 2006»
15 years 6 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 6 months ago
An inductive database prototype based on virtual mining views
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
Élisa Fromont, Adriana Prado, Bart Goethals...
IDA
2007
Springer
16 years 18 days ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski