Typical testors are useful tools for feature selection and for determining feature relevance in supervised classification problems. Nowadays, computing all typical testors of a training matrix is very expensive; all reported algorithms have exponential complexity depending on the number of columns in the matrix. In this paper, we introduce the faster algorithm BR (Boolean Recursive), called fast-BR algorithm, that is based on elimination of gaps and reduction of columns. Fast-BR algorithm is designed to generate all typical testors from a training matrix, requiring a reduced number of operations. Experimental results using this fast implementation and the comparison with other state-of-the-art related algorithms that generate typical testors are presented.
Abstract. Typical testors are a useful tool for both feature selection and for determining feature relevance in supervised classication problems. Nowadays, generating all typical testors of a training matrix is computationally expensive; all reported algorithms have exponential complexity, depending mainly on the number of columns in the training matrix. For this reason, different approaches such as sequential and parallel algorithms, genetic algorithms and hardware implementations techniques have been developed. In this paper, we introduce a fast implementation of the algorithm CT EXT (which is one of the fastest algorithms reported) based on an accumulative binary tuple, developed for generating all typical testors of a training matrix. The accumulative binary tuple implemented in the CT EXT algorithm, is a useful way to simplifies the search of feature combinations which fulfill the testor property, because its implementation decreases the number of operations involved in the process of generating all typical testors. In addition, experimental results using the proposed fast implementation of the CT EXT algorithm and the comparison with other state of the art algorithms that generated typical testors are presented.
In this paper, we introduce a fast implementation of the CT EXT algorithm for testor property identification, that is based on an accumulative binary tuple. The fast implementation of the CT EXT algorithm (one of the fastest algorithms reported), is designed to generate all the typical testors from a training matrix, requiring a reduced number of operations. Experimental results using this fast implementation and the comparison with other state-of-the-art algorithms that generate typical testors are presented.
As climate change negotiations progress, monitoring biomass and carbon stocks is becoming an important part of the current forest research. Therefore, national governments are interested in developing forest-monitoring strategies using geospatial technology. Among statistical methods for mapping biomass, there is a nonparametric approach called k-nearest neighbor (kNN). We compared four variations of distance metrics of the kNN for the spatially-explicit estimation of aboveground biomass in a portion of the Mexican north border of the intertropical zone. Satellite derived, climatic, and topographic predictor variables were combined with the Mexican National Forest Inventory (NFI) data to accomplish the purpose. Performance of distance metrics applied into the kNN algorithm was evaluated using a cross validation leave-one-out technique. The results indicate that the Most Similar Neighbor (MSN) approach maximizes the correlation between predictor and response variables (r=0.9). Our results are in agreement with those reported in the literature. These findings confirm the predictive potential of the MSN approach for mapping forest variables at pixel level under the policy of Reducing Emission from Deforestation and Forest Degradation (REDD+).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.