![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Machine Learning, Volume 42, 2001
Volume 42, Number 1/2, January 2001
- Douglas H. Fisher:
Introduction. 5-7 - Marina Meila, David Heckerman:
An Experimental Comparison of Model-Based Clustering Methods. 9-29 - Mohammed Javeed Zaki
:
SPADE: An Efficient Algorithm for Mining Frequent Sequences. 31-60 - Peter A. Flach
, Nicolas Lachiche
:
Confirmation-Guided Discovery of First-Order Rules with Tertius. 61-95 - Nathalie Japkowicz
:
Supervised Versus Unsupervised Binary-Learning by Feedforward Neural Networks. 97-122 - Adam J. Grove, Dan Roth:
Linear Concepts and Hidden Variables. 123-141 - Inderjit S. Dhillon, Dharmendra S. Modha:
Concept Decompositions for Large Sparse Text Data Using Clustering. 143-175 - Thomas Hofmann:
Unsupervised Learning by Probabilistic Latent Semantic Analysis. 177-196
Volume 42, Number 3, March 2001
- Foster J. Provost, Tom Fawcett
:
Robust Classification for Imprecise Environments. 203-231 - Yoram Gat:
A Learning Generalization Bound with an Application to Sparse-Representation Classifiers. 233-239 - Vladislav Tadic:
On the Convergence of Temporal-Difference Learning with Linear Function Approximation. 241-267 - Jeffrey P. Bradford, Carla E. Brodley:
The Effect of Instance-Space Partition on Significance. 269-286 - Gunnar Rätsch
, Takashi Onoda, Klaus-Robert Müller
:
Soft Margins for AdaBoost. 287-320
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.