In this paper, we present a novel active learning strategy, named dynamic active learning with SVM to improve the effectiveness of learning sample selection in active learning. the algorithm is divided into two steps....
详细信息
In this paper the FP6 Future and Emerging Technologies project ACORNS is introduced. this project aims at simulating embodied language learning, inspired by the memory-prediction theory of intelligence. ACORNS intends...
详细信息
In this paper the FP6 Future and Emerging Technologies project ACORNS is introduced. this project aims at simulating embodied language learning, inspired by the memory-prediction theory of intelligence. ACORNS intends to build a full computational implementation of sensory information processing. ACORNS considers linguistic units as emergent patterns. thus, the research will not only address the issues conventionally investigated in statistical patternrecognition, but also the representations that are formed in memory. the paper discusses details of the memory and processing architecture that will be implemented in ACORNS, and explains how this architecture merges the basic concepts of the Memory-Prediction theory with results form previous research in the field of memory.
the following topics are dealt with: information science; computer architecture; VLSI; image processing; patternrecognition; mobile computing; software engineering; knowledge discovery; agent based systems; data mini...
the following topics are dealt with: information science; computer architecture; VLSI; image processing; patternrecognition; mobile computing; software engineering; knowledge discovery; agent based systems; datamining; data warehousing; distributed computing; middleware architecture; e commerce; software metrics and speech processing.
Estimation of probability density functions based on available data is important problem arising in various fields, such as telecommunications, machinelearning, datamining, patternrecognition and computer vision. I...
详细信息
Estimation of probability density functions based on available data is important problem arising in various fields, such as telecommunications, machinelearning, datamining, patternrecognition and computer vision. In this paper, we consider Kernel-based non-parametric density estimation methods and derive formulae for variable kernel density estimation using generalized, elliptic Gaussian kernels. the proposed technique is verified on simulated data.
this paper studies a support vector machine (SVM) to obtain a decision fusion algorithm for detection of semantic concepts in videos, and its application to films database. Given a movie clip, its spatio-temporal info...
详细信息
this paper studies a support vector machine (SVM) to obtain a decision fusion algorithm for detection of semantic concepts in videos, and its application to films database. Given a movie clip, its spatio-temporal information is captured by audiovisual features. these are then independently inputted to the corresponding matching experts whose outputs are fused at the decision stage by the SVM classifier. Based on our simulation results, this fusion method can attain very high recognition accuracy for detection of various concepts from a collection of Hollywood movies. It requires a very small set of training samples from a large database.
Classification can be promoted by using SVM to acquire hypersurface due to the direct induction of the support vectors. In traditional SVM solution algorithms, objective function is a strictly convex unconstrained opt...
详细信息
Classification can be promoted by using SVM to acquire hypersurface due to the direct induction of the support vectors. In traditional SVM solution algorithms, objective function is a strictly convex unconstrained optimization problem and it is not differentiable, so it can not use the most used optimization method to solve the problem. the undifferential model could be converted into a differential one by using polynomial to approximate the plus function x + . this paper gives the procedure of using cubic spline interpolation and Hermite interpolation method to deduce the quadratic polynomial smoothing the plus function x + , it also presents a new smooth technology using circular arc polynomial. the proposed approach is experimentally evaluated in three datasets that are benchmarks for datamining applications, leading to interesting results.
the key to granular computing (GrC) is to make use of granules in problem solving. Classification is one of important problems in machinelearning and datamining. With view of granular computing, this paper presents ...
详细信息
the key to granular computing (GrC) is to make use of granules in problem solving. Classification is one of important problems in machinelearning and datamining. With view of granular computing, this paper presents a classification approach to granules based on the variable precision rough set (VPRS) model. An algorithm is proposed and a tree structure of granules is given.
In the last decade, the efforts of spoken language processing have achieved significant advances, however, the work with emotional recognition has not progressed so far, and can only achieve 50% to 60% in accuracy. th...
详细信息
In the last decade, the efforts of spoken language processing have achieved significant advances, however, the work with emotional recognition has not progressed so far, and can only achieve 50% to 60% in accuracy. this is because a majority of researchers in this field have focused on the synthesis of emotional speech rather than focusing on automating human emotion recognition. Many research groups have focused on how to improve the performance of the classifier they used for emotion recognition, and few work has been done on data pre-processing, such as the extraction and selection of a set of specifying acoustic features instead of using all the possible ones they had in hand. To work with well-selected acoustic features does not mean to delay the whole job, but this will save much time and resources by removing the irrelative information and reducing the high-dimension data calculation. In this paper, we developed an automatic feature selector based on a RF2TREE algorithm and the traditional C4.5 algorithm. RF2TREE applied here helped us to solve the problems that did not have enough data examples. the ensemble learning technique was applied to enlarge the original data set by building a bagged random forest to generate many virtual examples, and then the new data set was used to train a single decision tree, which selects the most efficient features to represent the speech signals for the emotion recognition. Finally, the output of the selector was a set of specifying acoustic features, produced by RF2TREE and a single decision tree.
Protein mass spectra patternrecognition is a new forum, in which many machinelearning algorithms have been conducted to enhance the chance of early cancer diagnosis. the high-dimensionality-small-sample (HDSS) probl...
详细信息
Protein mass spectra patternrecognition is a new forum, in which many machinelearning algorithms have been conducted to enhance the chance of early cancer diagnosis. the high-dimensionality-small-sample (HDSS) problem of cancer proteomic datasets still requires more sophisticated approaches to improve the classification accuracy. In this study we present a simple ensemble strategy based on measuring the generalizing capability of different subsets of training data and apply it in making final decision. Using a limited number of biomarkers along with 5 classification algorithms, the proposed method achieved a promising performance over a well-known prostate cancer mass spectroscopy dataset.
In the present paper, we describe an evaluation of our rule evaluation support method with constructive meta- learning scheme for post-processing of mined results with rule evaluation models based on objective indices...
详细信息
In the present paper, we describe an evaluation of our rule evaluation support method with constructive meta- learning scheme for post-processing of mined results with rule evaluation models based on objective indices. Postprocessing of mined results is one of the key processes in the datamining process. However, it is difficult for human experts to completely evaluate several thousand of rules from a large dataset with noises. To reduce the costs in such a rule evaluation task, we have developed a rule evaluation support method with rule evaluation models, which learn from objective indices for mined classification rules and evaluations by a human expert for each rule. To enhance the adaptability of rule evaluation models, we introduced a constructive meta-learning scheme to choose proper learning algorithms. then, we performed the case study on the meningitis datamining as an actual problem. In addition, we evaluated the proposed method using the ten rule sets obtained from the ten UCI datasets. the obtained results demonstrate the applicability of the proposed rule evaluation support method.
暂无评论