Vision Robot Path Control Based on Artificial Intelligence Image Classification and Sustainable Ultrasonic Signal Transformation Technology

The unsupervised algorithm of artificial intelligence (AI), named ART (Adaptive Resonance Theory), is used to first roughly classify an image, that is, after the image is processed by the edge filtering technology, the image window is divided into 25 square areas of 5 rows and 5 columns, and then, according to the location of the edge of the image, it determines whether the robot should go straight (represented by S), turn around (represented by A), stop (T), turn left (represented by L), or turn right (represented by R). Then, after sustainable ultrasonic signal acquisition and transformation into digital signals are completed, the sustainable supervised neural network named SGAFNN (Supervised Gaussian adaptive fuzzy neural network) will perform an optimal path control that can accurately control the traveling speed and turning of the robot to avoid hitting walls or obstacles. Based on the above, this paper proposes the use of the ART operation after image processing to judge the rough direction, followed by the use of the ultrasonic signal to carry out the sustainable development of artificial intelligence and to carry out accurate speed and direction SGAFNN control to avoid obstacles. After simulation and practical evaluations, the proposed method is proved to be feasible and to exhibit good performance.

Similarity Measures for Learning in Lattice Based Biomimetic Neural Networks

This paper presents a novel lattice based biomimetic neural network trained by means of a similarity measure derived from a lattice positive valuation. For a wide class of pattern recognition problems, the proposed artificial neural network, implemented as a dendritic hetero-associative memory delivers high percentages of successful classification. The memory is a feedforward dendritic network whose arithmetical operations are based on lattice algebra and can be applied to real multivalued inputs. In this approach, the realization of recognition tasks, shows the inherent capability of prototype-class pattern associations in a fast and straightforward manner without need of any iterative scheme subject to issues about convergence. Using an artificially designed data set we show how the proposed trained neural net classifies a test input pattern. Application to a few typical real-world data sets illustrate the overall network classification performance using different training and testing sample subsets generated randomly.

Fuzzy Interval Number K-Means Clustering for Region Division of Pork Market

This article proposes a new clustering algorithm named FINK-means. First, this article converts original data into a fuzzy interval number (FIN). Second, it proves the F that denotes the collection of FINs is a lattice. Finally, it introduces a novel metric distance on the lattice F. The contrast experiments about FINK-means, k-means, and FCM algorithm are carried out on two simulated datasets and four public datasets. The results show that the FINK-means algorithm has better clustering performance on three evaluation indexes including the purity, loss cost, and silhouette coefficient. FINK-means is applied to the task of region division of pork market in China based on the daily data of pork price for different provinces of China from August 9, 2017 to August 9, 2018. The results show that regions of pork market in China was divided into five categories, namely very low, low, medium, high, and very high. Every category has been discussed as well. At last, an additional experiment about region division in Canada was carried out to prove the efficiency of FINK-means further.

MUTUAL INFORMATION CLUSTERING FOR EFFICIENT MINING OF FUZZY ASSOCIATION RULES WITH APPLICATION TO GENE EXPRESSION DATA ANALYSIS

Fuzzy association rules can reveal useful dependencies and interactions hidden in large gene expression data sets. However their derivation perplexes very difficult combinatorial problems that depend heavily on the size of these sets. The paper follows a divide and conquer approach to the problem that obtains computationally manageable solutions. Initially we cluster genes that more probably are associated. Thereafter, the fuzzy association rule extraction algorithms confront many but significantly reduced computationally problems that usually can be processed very fast.

The clustering phase is accomplished by means of an approach based on mutual information (MI). This approach uses the mutual information as a similarity measure. However, the numerical evaluation of the MI is subtle. We experiment with the main methods and we compare between them. As the device that implements the mutual information clustering we use a SOM (Self-Organized Map) based approach that is capable of effectively incorporating supervised bias.

After the mutual information clustering phase the fuzzy association rules are extracted locally on a per cluster basis. The paper presents an application of the techniques for mining the gene expression data. However, the presented techniques can easily be adapted and can be fruitful for intelligent exploration of any other similar data set as well.

Granular self-organizing map (grSOM) for structure identification

This work presents a useful extension of Kohonen's Self-Organizing Map (KSOM) for structure identification in linguistic (fuzzy) system modeling applications. More specifically the granular SOM neural model is presented for inducing a distribution of nonparametric fuzzy interval numbers (FINs) from the data. A FIN can represent a local probability distribution function and/or a conventional fuzzy set; moreover, a FIN is interpreted as an information granule. Learning is based on a novel metric distance d(K)(.,.) between FINs. The metric d(K)(.,.) can be tuned nonlinearly by a mass function m(x), the latter attaches a weight of significance to a real number 'x' in a data dimension. Rigorous analysis is based on mathematical lattice theory. A grSOM can cope with ambiguity by processing linguistic (fuzzy) input data and/or intervals. This work presents a simple grSOM variant, namely greedy grSOM, for classification. A genetic algorithm (GA) introduces tunable nonlinearities during training. Extensive comparisons are shown with related work from the literature. The practical effectiveness of the greedy grSOM is demonstrated comparatively in three benchmark classification problems. Statistical evidence strongly suggests that the proposed techniques improve classification performance. In addition, the greedy grSOM induces descriptive decision-making knowledge (fuzzy rules) from the training data.

Extension neural network-type 2 and its applications

A supervised learning pattern classifier, called the extension neural network (ENN), has been described in a recent paper. In this sequel, the unsupervised learning pattern clustering sibling called the extension neural network type 2 (ENN-2) is proposed. This new neural network uses an extension distance (ED) to measure the similarity between data and the cluster center. It does not require an initial guess of the cluster center coordinates, nor of the initial number of clusters. The clustering process is controlled by a distanced parameter and by a novel extension distance. It shows the same capability as human memory systems to keep stability and plasticity characteristics at the same time, and it can produce meaningful weights after learning. Moreover, the structure of the proposed ENN-2 is simpler and the learning time is shorter than traditional neural networks. Experimental results from five different examples, including three benchmark data sets and two practical applications, verify the effectiveness and applicability of the proposed work.

FINs: lattice theoretic tools for improving prediction of sugar production from populations of measurements

This paper presents novel mathematical tools developed during a study of an industrial-yield prediction problem. The set F of fuzzy interval numbers, or FINs for short, is studied in the framework of lattice theory. A FIN is defined as a mapping to a metric lattice of generalized intervals, moreover it is shown analytically that the set F of FINs is a metric lattice. A FIN can be interpreted as a convex fuzzy set, moreover a statistical interpretation is proposed here. Algorithm CALFIN is presented for constructing a FIN from a population of samples. An underlying positive valuation function implies both a metric distance and an inclusion measure function in the set F of FINs. Substantial advantages, both theoretical and practical, are shown. Several examples illustrate geometrically on the plane both the utility and the effectiveness of novel tools. It is outlined comparatively how some of the proposed tools have been employed for improving prediction of sugar production from populations of measurements for Hellenic Sugar Industry, Greece.

Kernel-based self-organized maps trained with supervised bias for gene expression data analysis

Self-Organized Maps (SOMs) are a popular approach for analyzing genome-wide expression data. However, most SOM based approaches ignore prior knowledge about functional gene categories. Also, Self Organized Map (SOM) based approaches usually develop topographic maps with disjoint and uniform activation regions that correspond to a hard clustering of the patterns at their nodes. We present a novel Self-Organizing map, the Kernel Supervised Dynamic Grid Self-Organized Map (KSDG-SOM). This model adapts its parameters in a kernel space. Gaussian kernels are used and their mean and variance components are adapted in order to optimize the fitness to the input density. The KSDG-SOM also grows dynamically up to a size defined with statistical criteria. It is capable of incorporating a priori information for the known functional characteristics of genes. This information forms a supervised bias at the cluster formation and the model owns the potentiality of revising incorrect functional labels. The new method overcomes the main drawbacks of most of the existing clustering methods that lack a mechanism for dynamical extension on the basis of a balance between unsupervised and supervised drives.

Multilevel Category Structure in the ART-2 Network

Multilevel categorization is investigated within the context of analog activity patterns on the output layer of an ART 2 network. The ART 2 network parameters are analyzed in terms of stable category formation and in terms of the number of nodes in the output layer that can become most active. The resulting activity patterns on the output layer demonstrate a multilevel category structure based on the relative differences between patterns that exist for many different values of the vigilance parameter. We have shown that the information contained in the output analog patterns can be interpreted in several different ways, which is not possible when the category is represented by a single winning node. Also, favorable comparisons are also demonstrated between the category structure emerging from the set of category patterns and principles of categorization in psychology and neurobiology.

Fuzzy lattice neurocomputing (FLN) models

In this work it is shown how fuzzy lattice neurocomputing (FLN) emerges as a connectionist paradigm in the framework of fuzzy lattices (FL-framework) whose advantages include the capacity to deal rigorously with: disparate types of data such as numeric and linguistic data, intervals of values, 'missing' and 'don't care' data. A novel notation for the FL-framework is introduced here in order to simplify mathematical expressions without losing content. Two concrete FLN models are presented, namely 'sigma-FLN' for competitive clustering, and 'FLN with tightest fits (FLNtf)' for supervised clustering. Learning by the sigma-FLN, is rapid as it requires a single pass through the data, whereas learning by the FLNtf, is incremental, data order independent, polynomial theta(n3), and it guarantees maximization of the degree of inclusion of an input in a learned class as explained in the text. Convenient geometric interpretations are provided. The sigma-FLN is presented here as fuzzy-ART's extension in the FL-framework such that sigma-FLN widens fuzzy-ART's domain of application to (mathematical) lattices by augmenting the scope of both of fuzzy-ART's choice (Weber) and match functions, and by enhancing fuzzy-ART's complement coding technique. The FLNtf neural model is applied to four benchmark data sets of various sizes for pattern recognition and rule extraction. The benchmark data sets in question involve jointly numeric and nominal data with 'missing' and/or 'don't care' attribute values, whereas the lattices involved include the unit-hypercube, a probability space, and a Boolean algebra. The potential of the FL-framework in computing is also delineated.

Estimation of the stapes-bone thickness in the stapedotomy surgical procedure using a machine-learning technique

Stapedotomy is a surgical procedure aimed at the treatment of hearing impairment due to otosclerosis. The treatment consists of drilling a hole through the stapes bone in the inner ear in order to insert a prosthesis. Safety precautions require knowledge of the nonmeasurable stapes thickness. The technical goal herein has been the design of high-level controls for an intelligent mechatronics drilling tool in order to enable the estimation of stapes thickness from measurable drilling data. The goal has been met by learning a map between drilling features, hence no model of the physical system has been necessary. Learning has been achieved as explained in this paper by a scheme, namely the d-sigma Fuzzy Lattice Neurocomputing (d sigma-FLN) scheme for classification, within the framework of fuzzy lattices. The successful application of the d sigma-FLN scheme is demonstrated in estimating the thickness of a stapes bone "on-line" using drilling data obtained experimentally in the laboratory.