Search

Near-Infrared Spectroscopy (NIRS) has shown to be helpful in the study of rice, tea, cocoa, and other foods due to its versatility and reduced sample treatment. However, the high complexity of the data produced by NIR sensors makes necessary pre-treatments such as feature selection techniques that produce compact profiles. Supervised and unsupervised techniques have been tested, creating different subsets of features for classification, which affect the performance of the classifiers based on such compact profiles. In this sense, we propose and test a new covering array feature selection (CAFS) algorithm coupled to the naïve Bayes classifier (NBC) to discriminate among Amazonian cacao nibs from six cacao clones. The CAFS wrapper approach looks for the wavebands that maximize the F 1 -score, and then, are more relevant for classification. For this purpose, cacao pods of six varieties were collected, and their grains were extracted and processed (fermented, dried, roasted, and milled) to obtain cacao nibs. Then from each clone NIR spectral profiles in the range of 1100-2500 nm were extracted, and relevant wavebands were selected using the proposed CAFS algorithm. For comparison, two standard feature selection techniques were implemented the multi-cluster feature selection MCFS and the eigenvector centrality feature selection ECFS. Then, based on the different selected variables, three NBCs were built and compared among them through statistical metrics. The results showed that using the wavebands selected by CAFS, the NBC performed an average accuracy of 99.63%; being this superior to the 94.92% and 95.79% for ECFS and MCFS respectively. These results showed that the wavebands selected by the proposed CAFS algorithm allowed obtaining a better fit concerning other feature selection methods reported in the literature., Competing Interests: Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (Copyright © 2021 Elsevier B.V. All rights reserved.)

The reuse of business processes (BPs) requires similarities between them to be suitably identified. Various approaches have been introduced to address this problem, but many of them feature a high computational cost and a low level of automation. This paper presents a clustering algorithm that groups business processes retrieved from a multimodal search system (based on textual and structural information). The algorithm is based on Incremental Covering Arrays (ICAs) with different alphabets to determine the possible number of groups to be created for each row of the ICA. The proposed algorithm also incorporates Balanced Bayesian Information Criterion to determine the optimal number of groups and the best solution for each query. Experimental evaluation shows that the use of ICAs with strength four (4) and different alphabets reduces the number of solutions needed to be evaluated and optimizes the number of clusters. The proposed algorithm outperforms other algorithms in various measures (precision, recall, and F-measure) by between 12% and 88%. Friedman and Wilcoxon non-parametric tests gave a 90-95% significance level to the obtained results. Better options of repository search for BPs help companies to reuse them. By thus reusing BPs, managers and analysts can more easily get to know the evolution and trajectory of the company processes, a situation that could be expected to lead to improved managerial and commercial decision making., Competing Interests: The authors have declared that no competing interests exist.

Software test suites based on the concept of interaction testing are very useful for testing software components in an economical way. Test suites of this kind may be created using mathematical objects called covering arrays. A covering array, denoted by CA(N; t, k, v), is an N × k array over [Formula: see text] with the property that every N × t sub-array covers all t-tuples of [Formula: see text] at least once. Covering arrays can be used to test systems in which failures occur as a result of interactions among components or subsystems. They are often used in areas such as hardware Trojan detection, software testing, and network design. Because system testing is expensive, it is critical to reduce the amount of testing required. This paper addresses the Optimal Shortening of Covering ARrays (OSCAR) problem, an optimization problem whose objective is to construct, from an existing covering array matrix of uniform level, an array with dimensions of (N - δ) × (k - Δ) such that the number of missing t-tuples is minimized. Two applications of the OSCAR problem are (a) to produce smaller covering arrays from larger ones and (b) to obtain quasi-covering arrays (covering arrays in which the number of missing t-tuples is small) to be used as input to a meta-heuristic algorithm that produces covering arrays. In addition, it is proven that the OSCAR problem is NP-complete, and twelve different algorithms are proposed to solve it. An experiment was performed on 62 problem instances, and the results demonstrate the effectiveness of solving the OSCAR problem to facilitate the construction of new covering arrays.

For k ∈ ℤ + , define Σ k as the set of integers {0, 1, …, k - 1}. Given an integer n and a string t of length m ≥ n over Σ k , we count the number of times that each one of the k n distinct strings of length n over Σ k occurs as a subsequence of t . Our algorithm makes only one scan of t and solves the problem in time complexity mk n -1 and space complexity m + k n . These are very close to best possible.

SAGRAD (Simulated Annealing GRADient), a Fortran 77 program for computing neural networks for classification using batch learning, is discussed. Neural network training in SAGRAD is based on a combination of simulated annealing and Møller's scaled conjugate gradient algorithm, the latter a variation of the traditional conjugate gradient method, better suited for the nonquadratic nature of neural networks. Different aspects of the implementation of the training process in SAGRAD are discussed, such as the efficient computation of gradients and multiplication of vectors by Hessian matrices that are required by Møller's algorithm; the (re)initialization of weights with simulated annealing required to (re)start Møller's algorithm the first time and each time thereafter that it shows insufficient progress in reaching a possibly local minimum; and the use of simulated annealing when Møller's algorithm, after possibly making considerable progress, becomes stuck at a local minimum or flat area of weight space. Outlines of the scaled conjugate gradient algorithm, the simulated annealing procedure and the training process used in SAGRAD are presented together with results from running SAGRAD on two examples of training data.