ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...
ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
This paper explores in detail the use of Error Correcting Output Coding (ECOC) for learning text classifiers. We show that the accuracy of a Naive Bayes Classifier over text class...
ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
In manyoptimization and decision problems the objective function can be expressed as a linear combinationof competingcriteria, the weights of whichspecify the relative importanceo...
ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
This paper investigates how the splitting criteria and pruning methods of decision tree learning algorithms are influenced by misclassification costs or changes to the class distr...
ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
Although Bayesian model averaging is theoretically the optimal method for combining learned models, it has seen very little use in machine learning. In this paper we study its app...
ICML
2000
IEEE
15 years 15 days ago
2000
IEEE
The proliferation of hypertext and the popularity of Kleinberg's HITS algorithm have brought about an increased interest in link analysis. While HITS and its older relatives ...