Search results for "ComputingMethodologies_PATTERNRECOGNITION"
showing 10 items of 296 documents
<title>Expanding context against weighted voting of classifiers</title>
2000
In the paper we propose a new method to integrate the predictions of multiple classifiers for Data Mining and Machine Learning tasks. The method assumes that each classifier stands in it's own context, and the contexts are partially ordered. The order is defined by monotonous quality function that maps each context to the value from the interval [0,1]. The classifier that has the context with better quality is supposed to predict better than the classifier from worse quality. The objective is to generate the opinion of `virtual' classifier that stands in the context with quality equal to 1. This virtual classifier must have the best accuracy of predictions due to the best context. To do thi…
Diversity in search strategies for ensemble feature selection
2005
Ensembles of learnt models constitute one of the main current directions in machine learning and data mining. Ensembles allow us to achieve higher accuracy, which is often not achievable with single models. It was shown theoretically and experimentally that in order for an ensemble to be effective, it should consist of base classifiers that have diversity in their predictions. One technique, which proved to be effective for constructing an ensemble of diverse base classifiers, is the use of different feature subsets, or so-called ensemble feature selection. Many ensemble feature selection strategies incorporate diversity as an objective in the search for the best collection of feature subse…
Semisupervised kernel orthonormalized partial least squares
2012
This paper presents a semisupervised kernel orthonormalized partial least squares (SS-KOPLS) algorithm for non-linear feature extraction. The proposed method finds projections that minimize the least squares regression error in Hilbert spaces and incorporates the wealth of unlabeled information to deal with small size labeled datasets. The method relies on combining a standard RBF kernel using labeled information, and a generative kernel learned by clustering all available data. The positive definiteness of the kernels is proven, and the structure and information content of the derived kernels is studied. The effectiveness of the proposed method is successfully illustrated in standard UCI d…
Semisupervised Kernel Feature Extraction for Remote Sensing Image Analysis
2014
This paper presents a novel semisupervised kernel partial least squares (KPLS) algorithm for nonlinear feature extraction to tackle both land-cover classification and biophysical parameter retrieval problems. The proposed method finds projections of the original input data that align with the target variable (labels) and incorporates the wealth of unlabeled information to deal with low-sized or underrepresented data sets. The method relies on combining two kernel functions: the standard radial-basis-function kernel based on labeled information and a generative, i.e., probabilistic, kernel directly learned by clustering the data many times and at different scales across the data manifold. Th…
Noise Robustness Analysis of Point Cloud Descriptors
2013
In this paper, we investigate the effect of noise on 3D point cloud descriptors. Various types of point cloud descriptors have been introduced in the recent years due to advances in computing power, which makes processing point cloud data more feasible. Most of these descriptors describe the orientation difference between pairs of 3D points in the object and represent these differences in a histogram. Earlier studies dealt with the performances of different point cloud descriptors; however, no study has ever discussed the effect of noise on the descriptors performances. This paper presents a comparison of performance for nine different local and global descriptors amidst 10 varying levels o…
Semi-Supervised Remote Sensing Image Classification based on Clustering and the Mean Map Kernel
2008
This paper presents a semi-supervised classifier based on the combination of the expectation-maximization (EM) algorithm for Gaussian mixture models (GMM) and the mean map kernel. The proposed method uses the most reliable samples in terms of maximum likelihood to compute a kernel function that accurately reflects the similarity between clusters in the kernel space. The proposed method improves classification accuracy in situations where the available labeled information does not properly describe the classes in the test image.
New Tools for Streamlined In Vivo Homing Peptide Identification
2021
In vivo peptide-phage display is an unbiased technique for mapping of the vascular diversity and identification of homing peptides. This chapter is intended to serve as a structured practical guide to execute in vivo T7 phage biopanning and data analysis experiments. We discuss experimental designs and protocols with emphasis on application of high-throughput sequencing-based technologies for streamlined in vivo biopanning and validation of homing peptides.
Computational cluster validation for microarray data analysis: experimental assessment of Clest, Consensus Clustering, Figure of Merit, Gap Statistic…
2008
Abstract Background Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analysis and Classification, in particular with regard to the prediction of the number of clusters in a dataset, usually established via internal validation measures. Despite the wealth of internal measures available in the literature, new ones have been recently proposed, some of them specifically for microarray data. Results We consider five such measures: Clest, Consensus (Consensus Clustering), FOM (Figure of Merit), Gap (Gap Statistics) and ME (Model Explorer), in addition to the classic WCSS (Within Cluster…
Data-Driven Interactive Multiobjective Optimization Using a Cluster-Based Surrogate in a Discrete Decision Space
2019
In this paper, a clustering based surrogate is proposed to be used in offline data-driven multiobjective optimization to reduce the size of the optimization problem in the decision space. The surrogate is combined with an interactive multiobjective optimization approach and it is applied to forest management planning with promising results. peerReviewed
Principal Component and Neural Network Analyses of Face Images: What Can Be Generalized in Gender Classification?
1998
We present an overview of the major findings of the principal component analysis (pca) approach to facial analysis. In a neural network or connectionist framework, this approach is known as the linear autoassociator approach. Faces are represented as a weighted sum of macrofeatures (eigenvectors or eigenfaces) extracted from a cross-product matrix of face images. Using gender categorization as an illustration, we analyze the robustness of this type of facial representation. We show that eigenvectors representing general categorical information can be estimated using a very small set of faces and that the information they convey is generalizable to new faces of the same population and to a l…