Direct neighborhood discriminant analysis for face recognition.
Cheng, Miao, Fang, Bin, Tang, Yuan Yan, Wen, Jing (2008)
Mathematical Problems in Engineering
Similarity:
Cheng, Miao, Fang, Bin, Tang, Yuan Yan, Wen, Jing (2008)
Mathematical Problems in Engineering
Similarity:
Roman Świniarski (2001)
International Journal of Applied Mathematics and Computer Science
Similarity:
The paper presents an application of rough sets and statistical methods to feature reduction and pattern recognition. The presented description of rough sets theory emphasizes the role of rough sets reducts in feature selection and data reduction in pattern recognition. The overview of methods of feature selection emphasizes feature selection criteria, including rough set-based methods. The paper also contains a description of the algorithm for feature selection and reduction based on...
Ch. Aswani Kumar (2009)
Computer Science and Information Systems
Similarity:
Jan Rybka, Artur Janicki (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper describes a study of emotion recognition based on speech analysis. The introduction to the theory contains a review of emotion inventories used in various studies of emotion recognition as well as the speech corpora applied, methods of speech parametrization, and the most commonly employed classification algorithms. In the current study the EMO-DB speech corpus and three selected classifiers, the k-Nearest Neighbor (k-NN), the Artificial Neural Network (ANN) and Support Vector...
Lin, Chia-Hung, Chen, Jian-Liung, Gaing, Zwe-Lee (2010)
Mathematical Problems in Engineering
Similarity:
Marek Zaremba (2010)
Control and Cybernetics
Similarity:
Zhao Zhang, Ning Ye (2010)
Computer Science and Information Systems
Similarity:
Liming Yuan, Jiafeng Liu, Xianglong Tang (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Koychev, Ivan (2007)
Serdica Journal of Computing
Similarity:
This paper addresses the task of learning classifiers from streams of labelled data. In this case we can face the problem that the underlying concepts can change over time. The paper studies two mechanisms developed for dealing with changing concepts. Both are based on the time window idea. The first one forgets gradually, by assigning to the examples weight that gradually decreases over time. The second one uses a statistical test to detect changes in concept and then optimizes the...
Michał Woźniak, Bartosz Krawczyk (2012)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper presents a significant modification to the AdaSS (Adaptive Splitting and Selection) algorithm, which was developed several years ago. The method is based on the simultaneous partitioning of the feature space and an assignment of a compound classifier to each of the subsets. The original version of the algorithm uses a classifier committee and a majority voting rule to arrive at a decision. The proposed modification replaces the fairly simple fusion method with a combined classifier,...
Karol Grudziński (2010)
Control and Cybernetics
Similarity: