default search action
Machine Learning, Volume 58, 2005
Volume 58, Number 1, January 2005
- Geoffrey I. Webb, Janice R. Boughton, Zhihai Wang:
Not So Naive Bayes: Aggregating One-Dependence Estimators. 5-24 - Geoffrey I. Webb, Kai Ming Ting:
On the Application of ROC Analysis to Predict Classification Performance Under Varying Class Distributions. 25-32 - Tom Fawcett, Peter A. Flach:
A Response to Webb and Ting's On the Application of ROC Analysis to Predict Classification Performance Under Varying Class Distributions. 33-38 - Johannes Fürnkranz, Peter A. Flach:
ROC 'n' Rule Learning - Towards a Better Understanding of Covering Algorithms. 39-77 - G. Niklas Norén, Roland Orre:
Case Based Imprecision Estimates for Bayes Classifiers with the Bayesian Bootstrap. 79-94
Volume 58, Number 2-3, February 2005
- Eamonn J. Keogh:
Guest Editorial. 103-105 - Magnus Lie Hetland, Pål Sætrom:
Evolutionary Rule Mining in Time Series Databases. 107-125 - Ingo Mierswa, Katharina Morik:
Automatic Feature Extraction for Classifying Audio Data. 127-149 - Anthony J. Bagnall, Gareth J. Janacek:
Clustering Time Series with Clipped Data. 151-178 - Mohammed Waleed Kadous, Claude Sammut:
Classification of Multivariate Time Series and Structured Data Using Constructive Induction. 179-216 - Kyrre M. Begnum, Mark Burgess:
Principle Components and Importance Ranking of Distributed Anomalies. 217-230 - Yutao Shou, Nikos Mamoulis, David W. Cheung:
Fast and Exact Warping of Time Series Using Adaptive Segmental Approximations. 231-267 - Yoshiki Tanaka, Kazuhisa Iwamoto, Kuniaki Uehara:
Discovery of Time-Series Motif from Multi-Dimensional Data Based on MDL Principle. 269-300 - Michail Vlachos, George Kollios, Dimitrios Gunopulos:
Elastic Translation Invariant Matching of Trajectories. 301-334
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.