Application of Machine Learning for Tool Condition Monitoring in Turning

The machining process is primarily used to remove material using cutting tools. Any variation in tool state affects the quality of a finished job and causes disturbances. So, a tool monitoring scheme (TMS) for categorization and supervision of failures has become the utmost priority. To respond, traditional TMS followed by the machine learning (ML) analysis is advocated in this paper. Classification in ML is supervised based learning method wherein the ML algorithm learn from the training data input fed to it and then employ this model to categorize the new datasets for precise prediction of a class and observation. In the current study, investigation on the single point cutting tool is carried out while turning a stainless steel (SS) workpeice on the manual lathe trainer. The vibrations developed during this activity are examined for failure-free and various failure states of a tool. The statistical modeling is then incorporated to trace vital signs from vibration signals. The multiple-binary-rule-based model for categorization is designed using the decision tree. Lastly, various tree-based algorithms are used for the categorization of tool conditions. The Random Forest offered the highest classification accuracy, i.e., 92.6%.

     

Sparse Multicategory Generalized Distance Weighted Discrimination in Ultra-High Dimensions

Distance weighted discrimination (DWD) is an appealing classification method that is capable of overcoming data piling problems in high-dimensional settings. Especially when various sparsity structures are assumed in these settings, variable selection in multicategory classification poses great challenges. In this paper, we propose a multicategory generalized DWD (MgDWD) method that maintains intrinsic variable group structures during selection using a sparse group lasso penalty. Theoretically, we derive minimizer uniqueness for the penalized MgDWD loss function and consistency properties for the proposed classifier. We further develop an efficient algorithm based on the proximal operator to solve the optimization problem. The performance of MgDWD is evaluated using finite sample simulations and miRNA data from an HIV study.     

基于级联卷积神经网络的前列腺磁共振图像分类

针对深度学习训练成本高，以及基于磁共振图像的前列腺癌临床诊断需要大量医学常识且极为耗时的问题，本文提出了一种基于级联卷积神经网络（Convolutional Neural Network，CNN）和磁共振图像的前列腺癌（Prostate Cancer，PCa）自动分类诊断方法，该网络以Faster-RCNN作为前网络，对前列腺区域进行提取分割，用于排除前列腺附近组织器官的干扰；以基于ResNet改进的网络结构CNN40_bottleneck作为后网络，用于对前列腺区域病变进行分类.后网络由瓶颈结构串联组成，其中使用批量标准化（Batch Normalization，BN）、全局平均池化（Global Average Pooling，GAP）进行优化.实验结果证明，本文方法对前列腺癌诊断结果较好，而且缩减了训练时间和参数量，有效降低了训练成本.     

基于U-Net的盐体识别方法

卷积神经网络在计算机视觉领域取得重大突破，利用其强大的图像处理能力，将地下沉积盐体的识别问题转化为图像语义分割问题，应用深度卷积神经网络实现盐体地震图像的像素级语义分割.本文在U-Net基础上，增加网络深度并同时引入批归一化和Dropout处理，使得神经网络模型具有更高的可信度和更强的泛化能力.通过实验发现，在卷积层之后引入批归一化处理，并在池化层和叠加层之后引入Dropout可以稳定提升模型对盐体图像的分割性能.     

排序支持的交互数据分类算法及其应用

交互分类是解决数据复杂分类问题的主要手段之一。在现有的大多交互分类系统中，用户能准确识别数据类别，但在有些分类场景中,类别之间的顺序关系更容易被识别，为此，提出一种排序支持的交互数据分类算法。为提升交互分类精度，引入数据的顺序信息，为降低标记难度，提出候选样本推荐策略。另外,提出一种评估分类算法性能的可视化方法，用包含基本车况、交通违法记录、交通事故记录等信息的车辆数据集进行实验验证，将相关车辆分为高危车辆、中危车辆、低危车辆3类，算法的分类结果模型一致度达近98%，验证了方法的有效性。     

Classify the Higgs decays with the PFN and ParticleNet at electron–positron colliders

Various Higgs factories are proposed to study the Higgs boson precisely and systematically in a model- independent way. In this study, the Particle Flow Network and ParticleNet techniques are used to classify the Higgs decays into multicategories, and the ultimate goal is to realize an "end-to-end" analysis. A Monte Carlo simulation study is performed to demonstrate the feasibility, and the performance looks rather promising. This result could be the basis of a "one-stop" analysis to measure all the branching fractions of the Higgs decays simultaneously.     

STEAM教育跨学科思维评价研究——基于化学师范生的实证分析

跨学科思维是个体在解决复杂问题时,基于学科知识间的内在联系寻找问题解决方案的思维方式。基于SOLO分类理论和STEM教育的“融合斜面”构建跨学科思维评价框架,采用NVivo12分析软件依据“STEAM金字塔结构框架”对93位化学师范生的STEAM项目的任务分解资料进行编码和统计,分析化学师范生跨学科思维发展水平。以期为进一步寻求化学师范生跨学科思维高水平发展的策略提供参考。     

Classification of nasopharyngeal cell lines (C666-1, CNE2, NP69) via Raman spectroscopy and decision tree

Researchers have demonstrated that Raman spectroscopy can be used for characterization of tumor cells with excellent spatial resolution. However, performance evaluation of different algorithms in classifying multiclass of Raman spectra has not been reported yet. In this work, we present Raman spectra of nasopharyngeal carcinoma and nasopharyngeal normal cell lines. Combined with student’s t-test and several multivariate approaches, including decision tree, support vector classification, and linear discriminant analysis, our work shows that the relative content of two histological abnormality sensitive bands at 1449 and 1658 cm⁻¹ in tumor cells is significantly different from that of normal cells (p = 0.0132), and can be a biomarker to classify these cells. This difference is confirmed by importance analyses in the decision tree model. Furthermore, performances of statistical methods are compared with one another to explore the ability in classification. Results show that the decision tree can be more capable for classification between tumorous and normal cell lines with sensitivity and specificity of 99.0% and 96.9%, respectively. Findings of this work further support our previous work and indicate that the decision tree performs more robustly in cell classification. Our work will prove helpful to the early diagnosis of nasopharyngeal carcinoma, and will indicate the decision tree to be the primary algorithm in tumor-cell classification.     

Random forests for functional covariates

We propose a form of random forests that is especially suited for functional covariates. The method is based on partitioning the functions' domain in intervals and using the functions' mean values across those intervals as predictors in regression or classification trees. This approach appears to be more intuitive to applied researchers than usual methods for functional data, while also performing very well in terms of prediction accuracy. The intervals are obtained from randomly drawn, exponentially distributed waiting times. We apply our method to data from Raman spectra on boar meat as well as near‐infrared absorption spectra. The predictive performance of the proposed functional random forests is compared with commonly used parametric and nonparametric functional methods and with a nonfunctional random forest using the single measurements of the curve as covariates. Further, we present a functional variable importance measure, yielding information about the relevance of the different parts of the predictor curves. Our variable importance curve is much smoother and hence easier to interpret than the one obtained from nonfunctional random forests.     

Genetic Bee Colony (GBC) algorithm: A new gene selection method for microarray cancer classification

Naturally inspired evolutionary algorithms prove effectiveness when used for solving feature selection and classification problems. Artificial Bee Colony (ABC) is a relatively new swarm intelligence method. In this paper, we propose a new hybrid gene selection method, namely Genetic Bee Colony (GBC) algorithm. The proposed algorithm combines the used of a Genetic Algorithm (GA) along with Artificial Bee Colony (ABC) algorithm. The goal is to integrate the advantages of both algorithms. The proposed algorithm is applied to a microarray gene expression profile in order to select the most predictive and informative genes for cancer classification. In order to test the accuracy performance of the proposed algorithm, extensive experiments were conducted. Three binary microarray datasets are use, which include: colon, leukemia, and lung. In addition, another three multi-class microarray datasets are used, which are: SRBCT, lymphoma, and leukemia. Results of the GBC algorithm are compared with our recently proposed technique: mRMR when combined with the Artificial Bee Colony algorithm (mRMR-ABC). We also compared the combination of mRMR with GA (mRMR-GA) and Particle Swarm Optimization (mRMR-PSO) algorithms. In addition, we compared the GBC algorithm with other related algorithms that have been recently published in the literature, using all benchmark datasets. The GBC algorithm shows superior performance as it achieved the highest classification accuracy along with the lowest average number of selected genes. This proves that the GBC algorithm is a promising approach for solving the gene selection problem in both binary and multi-class cancer classification.