Search results for "Training set"
showing 10 items of 68 documents
Real-Time Body Gestures Recognition Using Training Set Constrained Reduction
2017
Gesture recognition is an emerging cross-discipline research field, which aims at interpreting human gestures and associating them to a well-defined meaning. It has been used as a mean for supporting human to machine interaction in several applications of robotics, artificial intelligence, and machine learning. In this paper, we propose a system able to recognize human body gestures which implements a constrained training set reduction technique. This allows the system for a real-time execution. The system has been tested on a publicly available dataset of 7,000 gestures, and experimental results have highlighted that at the cost of a little decrease in the maximum achievable recognition ac…
Active Learning Methods for Efficient Hybrid Biophysical Variable Retrieval
2016
Kernel-based machine learning regression algorithms (MLRAs) are potentially powerful methods for being implemented into operational biophysical variable retrieval schemes. However, they face difficulties in coping with large training data sets. With the increasing amount of optical remote sensing data made available for analysis and the possibility of using a large amount of simulated data from radiative transfer models (RTMs) to train kernel MLRAs, efficient data reduction techniques will need to be implemented. Active learning (AL) methods enable to select the most informative samples in a data set. This letter introduces six AL methods for achieving optimized biophysical variable estimat…
Sparse kernel methods for high-dimensional survival data
2008
Abstract Sparse kernel methods like support vector machines (SVM) have been applied with great success to classification and (standard) regression settings. Existing support vector classification and regression techniques however are not suitable for partly censored survival data, which are typically analysed using Cox's proportional hazards model. As the partial likelihood of the proportional hazards model only depends on the covariates through inner products, it can be ‘kernelized’. The kernelized proportional hazards model however yields a solution that is dense, i.e. the solution depends on all observations. One of the key features of an SVM is that it yields a sparse solution, dependin…
Training label cleaning with ant colony optimization for classification of remote sensing imagery
2015
This paper presents an original approach for improving performances of the supervised classifiers in remote sensing imagery by proposing a technique to refine a given training set using Ant Colony Optimization (ACO). The new method called ACO-Training Label Cleaning (ACO-TLC) applies ACO model for selection of the significant training samples from a given set of labeled vectors in order to optimize the quality of a supervised classifier. This means to retain the most informative samples and to remove the uncertain or misclassified training samples, which lead to classification errors. As a result of the selection process, we can obtain a purified training set. The proposed model is implemen…
Computer-Aided Diagnosis System with Backpropagation Artificial Neural Network—Improving Human Readers Performance
2016
This article presents the results of a study into possibility of artificial neural networks (ANNs) to classify cancer changes in mammographic images. Today’s Computer-Aided Detection (CAD) systems cannot detect 100 % of pathological changes. One of the properties of an ANN is generalized information —it can identify not only learned data but also data that is similar to training set. The combination of CAD and ANN could give better result and help radiologists to take the right decision.
Quantitative palaeotemperature estimates based on fossil chydorid ephippia: calibration and validation of a novel method for northern lakes
2015
To fully utilize palaeolimnological archives for tracking past environmental changes, methodological advances are necessary. We present a novel method to quantitatively reconstruct past summer air temperatures based on fossil chydorid (Cladocera: Chydoridae) ephippia assemblages. We examined a 76-lake training set from Finland for chydorid ephippia distribution to develop a transfer function for summer air temperatures. Subsequently, we tested its usability in downcore reconstructions by inferring Holocene temperatures from Lake Arapisto in southern Finland. Significant climate-related variation was found in the distribution and abundance of chydorid ephippia in the training set. A transfer…
Estimation of significant solvent concentration ranges and its application to the enhancement of the accuracy of gradient predictions.
2004
Abstract The solvent concentration range actually useful for gradient predictions is significantly narrower than the total range scanned in a gradient run. This range, called “solvent informative range” (SIR), if known with the highest accuracy, allows to predict gradient retention times ( t g ) with minimal error. The small size of the SIR supports the application of the linear solvent strength theory (LSST). Furthermore, LSST allows a closed-form solution to the integral required to predict gradient retention times, which eliminates numerical integration, needed with other retention models. A methodology that calculates the SIR by applying error analysis, and uses it to improve the accura…
Ultimate Order Statistics-Based Prototype Reduction Schemes
2013
Published version of a chapter in the book: AI 2013: Advances in Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-319-03680-9_42 The objective of Prototype Reduction Schemes (PRSs) and Border Identification (BI) algorithms is to reduce the number of training vectors, while simultaneously attempting to guarantee that the classifier built on the reduced design set performs as well, or nearly as well, as the classifier built on the original design set. In this paper, we shall push the limit on the field of PRSs to see if we can obtain a classification accuracy comparable to the optimal, by condensing the information in the data set into a single tr…
Feature Selection for Ensembles of Simple Bayesian Classifiers
2002
A popular method for creating an accurate classifier from a set of training data is to train several classifiers, and then to combine their predictions. The ensembles of simple Bayesian classifiers have traditionally not been a focus of research. However, the simple Bayesian classifier has much broader applicability than previously thought. Besides its high classification accuracy, it also has advantages in terms of simplicity, learning speed, classification speed, storage space, and incrementality. One way to generate an ensemble of simple Bayesian classifiers is to use different feature subsets as in the random subspace method. In this paper we present a technique for building ensembles o…
Ensemble Feature Selection Based on the Contextual Merit
2001
Recent research has proved the benefits of using ensembles of classifiers for classification problems. Ensembles constructed by machine learning methods manipulating the training set are used to create diverse sets of accurate classifiers. Different feature selection techniques based on applying different heuristics for generating base classifiers can be adjusted to specific domain characteristics. In this paper we consider and experiment with the contextual feature merit measure as a feature selection heuristic. We use the diversity of an ensemble as evaluation function in our new algorithm with a refinement cycle. We have evaluated our algorithm on seven data sets from UCI. The experiment…