C4.5: programs for machine learning
C4.5: programs for machine learning
Local discriminant bases and their applications
Journal of Mathematical Imaging and Vision - Special issue on mathematical imaging
Finding patterns in time series: a dynamic programming approach
Advances in knowledge discovery and data mining
Improved boosting algorithms using confidence-rated predictions
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
MultiBoosting: A Technique for Combining Boosting and Wagging
Machine Learning
Boosting a Strong Learner: Evidence Against the Minimum Margin
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Learning Comprehensible Descriptions of Multivariate Time Series
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Local feature extraction and its applications using a library of bases
Local feature extraction and its applications using a library of bases
A brief introduction to boosting
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Learning Classification RBF Networks by Boosting
MCS '01 Proceedings of the Second International Workshop on Multiple Classifier Systems
Recurrent Boosting for Classification of Natural and Synthetic Time-Series Data
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Design of multiple classifier systems for time series data
MCS'05 Proceedings of the 6th international conference on Multiple Classifier Systems
Hi-index | 0.00 |
A supervised classification method for temporal series, even multivariate, is presented. It is based on boosting very simple classifiers, which consists only of one literal. The proposed predicates are based in similarity functions (i.e., euclidean and dynamic time warping) between time series. The experimental validation of the method has been done using different datasets, some of them obtained from the UCI repositories. The results are very competitive with the reported in previous works. Moreover, their comprehensibility is better than in other approaches with similar results, since the classifiers are formed by a weighted sequence of literals.