An incremental model selection algorithm based on cross-validation for finding the architecture of a Hidden Markov model on hand gesture data sets
AuthorYıldız, Olcay Taner
MetadataShow full item record
CitationUlaş, A. & Yıldız, O. T. (2009). An incremental model selection algorithm based on cross-validation for finding the architecture of a hidden markov model on hand gesture data sets. Paper presented at the 8th International Conference on Machine Learning and Applications, 170-177. doi:10.1109/ICMLA.2009.91
In a multi-parameter learning problem, besides choosing the architecture of the learner, there is the problem of finding the optimal parameters to get maximum performance. When the number of parameters to be tuned increases, it becomes infeasible to try all the parameter sets, hence we need an automatic mechanism to find the optimum parameter setting using computationally feasible algorithms. In this paper, we define the problem of optimizing the architecture of a Hidden Markov Model (HMM) as a state space search and propose the MSUMO (Model Selection Using Multiple Operators) framework that incrementally modifies the structure and checks for improvement using cross-validation. There are five variants that use forward/backward search, single/multiple operators, and depth-first/breadth-first search. On four hand gesture data sets, we compare the performance of MSUMO with the optimal parameter set found by exhaustive search in terms of expected error and computational complexity.
Source8th International Conference on Machine Learning and Applications
Showing items related by title, author, creator and subject.
Calculating the VC-dimension of decision trees Yıldız, Olcay Taner; Aslan, Özlem; Alpaydın, Ahmet İbrahim Ethem (IEEE, 2009)We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree with binary features depends on (i) the ...
Extension of conventional co-training learning strategies to three-view and committee-based learning strategies for effective automatic sentence segmentation Dalva, Doğan; Güz, Ümit; Gürkan, Hakan (IEEE, 2018)The objective of this work is to develop effective multi-view semi-supervised machine learning strategies for sentence boundary classification problem when only small sets of sentence boundary labeled data are available. ...
Cost-conscious comparison of supervised learning algorithms over multiple data sets Ulaş, Aydın; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim Ethem (Elsevier Sci Ltd, 2012-04)In the literature, there exist statistical tests to compare supervised learning algorithms on multiple data sets in terms of accuracy but they do not always generate an ordering. We propose Multi(2)Test, a generalization ...