Authenticity green coffee bean species and geographical origin using near-infrared spectroscopy combined with chemometrics

To prevent the adulteration of agricultural resources and provide a solution to enhance the green coffee bean supply chain, authentication using the near-infrared spectroscopy (NIRS) technique was investigated. Partial least square with discrimination analysis (PLS-DA) models combined with various preprocessing methods were built from NIR spectra of 153 Vietnamese green coffee samples. The model combined with the standard normal variate and the first order of derivative yielded excellent performance in predicting coffee species with the error cross-validation of 0.0261. PLS-DA model of mean centre and first-order derivative spectra also yielded good performance in verifying geographical indication of green coffee with the error of 0.0656. By contrast, the predicting abilities of post-harvest methods were poor. The overall results showed a high potential of the NIRS in online authentication practices.     

Automatic design for shop scheduling strategies based on hyper-heuristics: A systematic review

Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed.     

Identifying catalyst layer compositions of proton exchange membrane fuel cells through machine-learning-based approach

Membrane electrode assembly (MEA) is considered a key component of a proton exchange membrane fuel cell (PEMFC). However, developing a new MEA to meet desired properties, such as operation under low-humidity conditions without a humidifier, is a time- and cost-consuming process. This study employs a machine-learning-based approach using K-nearest neighbor (KNN) and neural networks (NN) in the MEA development process by identifying a suitable catalyst layer (CL) recipe in MEA. Minimum redundancy maximum relevance and principal component analysis were implemented to specify the most important predictor and reduce the data dimension. The number of predictors was found to play an essential role in the accuracy of the KNN and NN models although the predictors have self-correlations. The KNN model with a K of 7 was found to minimize the model loss with a loss of 11.9%. The NN model constructed by three corresponding hidden layers with nine, eight, and nine nodes can achieve the lowest error of 0.1293 for the Pt catalyst and 0.031 for PVA as a good additive blending in the CL of the MEA. However, even if the error is low, the prediction of PVA seems to be inaccurate, regardless of the model structure. Therefore, the KNN model is more appropriate for CL recipe prediction.     

Predicting Prostephanus truncatus (Horn) (Coleoptera: Bostrichidae) populations and associated grain damage in smallholder farmers’ maize stores: A machine learning approach

Prostephanus truncatus is a notorious pest of stored-maize grain and its spread throughout sub-Saharan Africa has led to increased levels of grain storage losses. The current study developed models to predict the level of P. truncatus infestation and associated damage of maize grain in smallholder farmer stores. Data were gathered from grain storage trials conducted in Hwedza and Mbire districts of Zimbabwe and correlated with weather data for each site. Insect counts of P. truncatus and other common stored grain insect pests had a strong correlation with time of year with highest recorded numbers from January to May. Correlation analysis showed insect-generated grain dust from boring and feeding activity to be the best indicator of P. truncatus presence in stores (r = 0.70), while a moderate correlation (r = 0.48) was found between P. truncatus numbers and storage insect parasitic wasps, and grain damage levels significantly correlated with the presence of Tribolium castaneum (r = 0.60). Models were developed for predicting P. truncatus infestation and grain damage using parameter selection algorithms and decision-tree machine learning algorithms with 10-fold cross-validation. The P. truncatus population size prediction model performance was weak (r = 0.43) due to the complicated sampling and detection of the pest and eight-week long period between sampling events. The grain damage prediction model had a stronger correlation coefficient (r = 0.93) and is a good estimator for in situ stored grain insect damage. The models were developed for use under southern African climatic conditions and can be improved with more input data to create more precise models for building decision-support tools for smallholder maize-based production systems.     

基于梯度提升决策树的车轮轮缘厚度磨耗预测

轮对在列车走行过程中起着导向、承受以及传递载荷的作用，其踏面及轮缘磨耗对地铁列车运行安全性和钢轨的寿命都将产生重要影响。根据地铁列车车轮磨耗机理，分析车轮尺寸数据特点，针对轮缘厚度这一型面参数，基于梯度提升决策树算法构建轮缘厚度磨耗预测模型。在该模型的基础上，任意选取某轮对数据进行验证分析，结果表明：基于梯度提升决策树的轮对磨耗预测模型具有较好的预测精度，可预测出1~6个月的轮缘厚度变化趋势范围，预测时间范围较长，可为地铁维保部门对轮对的维修方式由状态修转为预防修提供指导性建议。     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.     

Accurate ensemble pruning with PL-bagging

Ensemble pruning deals with the selection of base learners prior to combination in order to improve prediction accuracy and efficiency. In the ensemble literature, it has been pointed out that in order for an ensemble classifier to achieve higher prediction accuracy, it is critical for the ensemble classifier to consist of accurate classifiers which at the same time diverse as much as possible. In this paper, a novel ensemble pruning method, called PL-bagging, is proposed. In order to attain the balance between diversity and accuracy of base learners, PL-bagging employs positive Lasso to assign weights to base learners in the combination step. Simulation studies and theoretical investigation showed that PL-bagging filters out redundant base learners while it assigns higher weights to more accurate base learners. Such improved weighting scheme of PL-bagging further results in higher classification accuracy and the improvement becomes even more significant as the ensemble size increases. The performance of PL-bagging was compared with state-of-the-art ensemble pruning methods for aggregation of bootstrapped base learners using 22 real and 4 synthetic datasets. The results indicate that PL-bagging significantly outperforms state-of-the-art ensemble pruning methods such as Boosting-based pruning and Trimmed bagging.     

Fault handling in large water networks with online dictionary learning

Fault detection and isolation in water distribution networks is an active topic due to the nonlinearities of flow propagation and recent increases in data availability due to sensor deployment. Here, we propose an efficient two-step data driven alternative: first, we perform sensor placement taking the network topology into account; second, we use incoming sensor data to build a network model through online dictionary learning. Online learning is fast and allows tackling large networks as it processes small batches of signals at a time. This brings the benefit of continuous integration of new data into the existing network model, either in the beginning for training or in production when new data samples are gathered. The proposed algorithms show good performance in our simulations on both small and large-scale networks.     

A gradient boosting decision tree approach for insider trading identification: An empirical model evaluation of China stock market

Insider trading is a kind of criminal behavior in stock market by using nonpublic information. In recent years, it has become the major illegal activity in China’s stock market. In this study, a combination approach of GBDT (Gradient Boosting Decision Tree) and DE (Differential Evolution) is proposed to identify insider trading activities by using data of relevant indicators. First, insider trading samples occurred from year 2007 to 2017 and corresponding non-insider trading samples are collected. Next, the proposed method is trained by the GBDT, and initial parameters of the GBDT are optimized by the DE. Finally, out-of-samples are classified by the trained GBDT–DE model and its performances are evaluated. The experiment results show that our proposed method performed the best for insider trading identification under time window length of ninety days, indicating the relevant indicators under 90-days time window length are relatively more useful. Additionally, under all three time window lengths, relative importance result shows that several indicators are consistently crucial for insider trading identification. Furthermore, the proposed approach significantly outperforms other benchmark methods, demonstrating that it could be applied as an intelligent system to improve identification accuracy and efficiency for insider trading regulation in China stock market.     

A hybrid multiple feature construction approach for classification using Genetic Programming

The purpose of feature construction is to create new higher-level features from original ones. Genetic Programming (GP) was usually employed to perform feature construction tasks due to its flexible representation. Filter-based approach and wrapper-based approach are two commonly used feature construction approaches according to their different evaluation functions. In this paper, we propose a hybrid feature construction approach using genetic programming (Hybrid-GPFC) that combines filter’s fitness function and wrapper’s fitness function, and propose a multiple feature construction method that stores top excellent individuals during a single GP run. Experiments on ten datasets show that our proposed multiple feature construction method (Fcm) can achieve better (or equivalent) classification performance than the single feature construction method (Fcs), and our Hybrid-GPFC can obtain better classification performance than filter-based feature construction approaches (Filter-GPFC) and wrapper-based feature construction approaches (Wrapper-GPFC) in most cases. Further investigations on combinations of constructed features and original features show that constructed features augmented with original features do not improve the classification performance comparing with constructed features only. The comparisons with three state-of-art methods show that in majority of cases, our proposed hybrid multiple feature construction approach can achieve better classification performance.