Optimal Pattern Recognition Procedures. Substantiation of Inductive Inference Procedures

Proceeding from a probabilistic approach, the authors conclude that Bayesian approach is the basis for creation of inductive inference procedures. These procedures are analyzed on Markovian chains and Bayesian networks.     

Self-learning inductive inference machines

Self-knowledge is a concept that is present in several philosophies. In this article, we consider the issue of whether or not a learning algorithm can in some sense possess self-knowledge. The question is answered affirmatively. Self-learning inductive inference algorithms are taken to be those that learn programs for their own algorithms, in addition to other functions.
La connaissance de soi est un concept qui se retrouve dans plusieurs philosophies. Dans cet article, les auteurs s'interrogent à savoir si un algorithme d' apprentissage peut dans une certaine mesure posséder la connaissance de soi. lis apportent une reponse positive a cette question. Les algorithmes d'inference inductive autodidactes sont ceux qui font l'apprentissage de programmes pour leurs propres algorithmes, en plus d' autres fonctions.     

Optimal pattern recognition procedures and their application

Results on Bayesian classification procedures, optimal on structures such as Markov chain and independent features, are reviewed. Numerical results of predicting protein secondary structure based on Bayesian classification procedures on non-stationary Markov chains are discussed. Complementarity relations for encoding bases in one DNA strand are presented. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 41–54, November–December 2007.     

Predicting protein secondary structure based on Bayesian classification procedures on Markovian chains

The paper discusses numerical results of predicting protein secondary structure using Bayesian classification procedures based on nonstationary Markovian chains. A new approach is used, based on the classification of pairs of states for pairs of neighboring amino acids. It improves the prediction accuracy as compared with that of the classification of the state of one amino acid. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 59–64, March–April 2007.     

Confidence measures for predictions in fuzzy inductive reasoning

This paper deals with the assessment of the reliability of predictions made in the context of the fuzzy inductive reasoning methodology. The reliability of predictions is assessed by means of two separate confidence measures, a proximity measure and a similarity measure. A time series and a single-input/single-output system are used as two different applications to study the viability of these confidence measures.     

Bayesian inference in disputed authorship: A case study of cognitive errors and a new system for decision support

Bayesian inference provides a formal framework for assessing the odds of hypotheses in light of evidence. This makes Bayesian inference applicable to a wide range of diagnostic challenges in the field of chance discovery, including the problem of disputed authorship that arises in electronic commerce, counter-terrorism and other forensic applications. For example, when two documents are so similar that one is likely to be a hoax written from the other, the question is: Which document is most likely the source and which document is most likely the hoax? Here I review a Bayesian study of disputed authorship performed by a biblical scholar, and I show that the scholar makes critical errors with respect to several issues, namely: Causal Basis, Likelihood Judgment and Conditional Dependency. The scholar’s errors are important because they have a large effect on his conclusions and because similar errors often occur when people, both experts and novices, are faced with the challenges of Bayesian inference. As a practical solution, I introduce a graphical system designed to help prevent the observed errors. I discuss how this decision support system applies more generally to any problem of Bayesian inference, and how it differs from the graphical models of Bayesian Networks.     

Efficiency of the Bayesian Classification Procedure: The Discrete Case

An upper-bound estimate of the error of the Bayesian procedure of solution of classification problems depending on the volume of training samples is given. The suboptimality of the Bayesian approach is proved and the complexity of the class of problems considered is determined.     

Computer diagnosis of goiters. V. The input

A scheme in which model construction and operation are considered as distinct processes has been designed for the differential diagnosis of goiters. The influence of classification and observation errors and of the recognition method on the diagnostic accuracy has been determined.     

小数据集条件下的多态系统贝叶斯网络参数学习

针对贝叶斯网络中多父节点条件概率分布参数学习问题,提出了一种适用于多态节点、模型不精确、样本信息不充分情形的参数学习方法.该方法利用因果机制独立假设,分解条件概率分布,使条件概率表的规模表现为父节点个数和状态数的线性形式;利用Leaky Noisy-MAX模型量化了多态系统模型未含因素对参数学习的影响;从小样本数据集中获取模型参数并合成条件概率表.结果表明,该方法能提高参数学习效率与精度.     

基于智能语音的翻译机器人自动化控制系统设计

为提升自动控制效果,加快翻译速率,设计基于智能语音的翻译机器人自动化控制系统。采集外界智能语音信号,利用A/D转换器得到数字信号,启动语音唤醒模块激活翻译机器人,听写模式识别复杂语音信号,命令模式识别简单语音信号,得到语言文本识别结果,通过深度学习关键词检测方法提取关键词作为翻译机器人的自动化控制指令,通过单片机识别自动化控制指令。实验结果表明,该系统可有效采集外界智能语音信号,提取智能语音信号的关键词,完成翻译机器人自动化控制。     

基于局部化原理和概率模型的LVQ改进算法

利用局部化原理和概率模型的优化方法，提出一种LVQ改进算法——基于局部化原理和概率模型的LVQ算法(Localization principle and Probability based LVQ，LoPLVQ)．与传统LVQ算法相比，不仅缩短训练时间，而且具有较高的识别率．实验结果表明改进算法可用来解决大规模的模式识别问题．     

Identifying step-level complexity in procedures: Integration of natural language processing into the Complexity Index for Procedures—Step level (CIPS)

Task complexity plays an important role in performance and procedure adherence. While studies have attempted to assess the contribution of different aspects of task complexity and their relationship to workers’ performance and procedure adherence, only a few have focused on application-specific measurement of task complexity. Further, generalizable methods of operationalizing task complexity that are used to both write and evaluate a wide range of routine or non-routine procedures is largely absent. This paper introduces a novel framework to quantify the step-level complexity of written procedures based on attributes such as decision complexity, need for judgment, interdependency of instructions, multiplicity of instructions, and excess information. This framework was incorporated with natural language processing and artificial intelligence to create a tool for procedure writers for identifying complex elements in procedures steps. The proposed technique has been illustrated through examples as well as an application to a tool for procedure writers. This method can be used both to support writers when constructing procedures as well as to examine the complexity of existing procedures. Further, the complexity index is applicable across several high-risk industries in which written procedures are prevalent, improving the linguistic complexity of the procedures and thus reducing the likelihood of human errors with procedures associated with complexity.     

Counterfactual inference to predict causal knowledge graph for relational transfer learning by assimilating expert knowledge --Relational feature transfer learning algorithm

Transfer learning (TL) is a machine learning (ML) method in which knowledge is transferred from the existing models of related problems to the model for solving the problem at hand. Relational TL enables the ML models to transfer the relationship networks from one domain to another. However, it has two critical issues. One is determining the proper way of extracting and expressing relationships among data features in the source domain such that the relationships can be transferred to the target domain. The other is how to do the transfer procedure. Knowledge graphs (KGs) are knowledge bases that use data and logic to graph-structured information; they are helpful tools for dealing with the first issue. The proposed relational feature transfer learning algorithm (RF-TL) embodies an extended structural equation modelling (SEM) as a method for constructing KGs. Additionally, in fields such as medicine, economics, and law related to people’s lives and property safety and security, the knowledge of domain experts is a gold standard. This paper introduces the causal analysis and counterfactual inference in the TL domain that directs the transfer procedure. Different from traditional feature-based TL algorithms like transfer component analysis (TCA) and CORelation Alignment (CORAL), RF-TL not only considers relations between feature items but also utilizes causality knowledge, enabling it to perform well in practical cases. The algorithm was tested on two different healthcare-related datasets — sleep apnea questionnaire study data and COVID-19 case data on ICU admission — and compared its performance with TCA and CORAL. The experimental results show that RF-TL can generate better transferred models that give more accurate predictions with fewer input features.     

Failure load prediction and optimisation for adhesively bonded joints enabled by deep learning and fruit fly optimisation

Adhesively bonded joints have been extensively employed in the aeronautical and automotive industries to join thin-layer materials for developing lightweight components. To strengthen the structural integrity of joints, it is critical to estimate and improve joint failure loads effectually. To accomplish the aforementioned purpose, this paper presents a novel deep neural network (DNN) model-enabled approach, and a single lap joint (SLJ) design is used to support research development and validation. The approach is innovative in the following aspects: (i) the DNN model is reinforced with a transfer learning (TL) mechanism to realise an adaptive prediction on a new SLJ design, and the requirement to re-create new training samples and re-train the DNN model from scratch for the design can be alleviated; (ii) a fruit fly optimisation (FFO) algorithm featured with the parallel computing capability is incorporated into the approach to efficiently optimise joint parameters based on joint failure load predictions. Case studies were developed to validate the effectiveness of the approach. Experimental results demonstrate that, with this approach, the number of datasets and the computational time required to re-train the DNN model for a new SLJ design were significantly reduced by 92.00% and 99.57% respectively, and the joint failure load was substantially increased by 9.96%.     

Incremental learning of bidirectional principal components for face recognition

Recently, bidirectional principal component analysis (BDPCA) has been proven to be an efficient tool for pattern recognition and image analysis. Encouraging experimental results have been reported and discussed in the literature. However, BDPCA has to be performed in batch mode, it means that all the training data has to be ready before we calculate the projection matrices. If there are additional samples need to be incorporated into an existing system, it has to be retrained with the whole updated training set. Moreover, the scatter matrices of BDPCA are formulated as the sum of K (samples size) image covariance matrices, this leads to the incremental learning directly on the scatters impossible, thus it presents new challenge for on-line training.In fact, there are two major reasons for building incremental algorithms. The first reason is that in some cases, when the number of training images is very large, the batch algorithm cannot process the entire training set due to large computational or space requirements of the batch approach. The second reason is when the learning algorithm is supposed to operate in a dynamical settings, that all the training data is not given in advance, and new training samples may arrive at any time, and they have to be processed in an on-line manner. Through matricizations of third-order tensor, we successfully transfer the eigenvalue decomposition problem of scatters to the singular value decomposition (SVD) of corresponding unfolded matrices, followed by complexity and memory analysis on the novel algorithm. A theoretical clue for selecting suitable dimensionality parameters without losing classification information is also presented in this paper. Experimental results on FERET and CMU PIE (pose, illumination, and expression) databases show that the IBDPCA algorithm gives a close approximation to the BDPCA method, but using less time.