scholarly journals Method to Expand the CMAC Model to Composite-Type Model

2020 ◽  
Vol 32 (4) ◽  
pp. 745-752
Author(s):  
Jiro Morimoto ◽  
Makoto Horio ◽  
Yoshio Kaji ◽  
Junji Kawata ◽  
Mineo Higuchi ◽  
...  
Keyword(s):  
Nonlinear Systems ◽  
Training Data ◽  
Type Model ◽  
Linear Measure ◽  
Cerebellar Model Articulation Controller ◽  
Classification Problems ◽  
Learning Time ◽  
Composite Type ◽  
Neural Transmission ◽  
Regression Problems

Neural networks (NNs) are effective for the learning of nonlinear systems, and thus they achieve satisfactory results in various fields. However, they require significant amount of training data and learning time. Notably, the cerebellar model articulation controller (CMAC), which is modeled after the cerebellar neural transmission system, proposed by Albus can effectively reduce learning time, compared with NNs. The CMAC model is often used to learn nonlinear systems that have continuously changing outputs, i.e., regression problems. However, the structure of the CMAC model must be expanded to apply it to classification problems as well. Additionally, the CMAC model finds it difficult to simultaneously classify categories and estimate their proportional linear measure because designated learning algorithms are required for both regression and classification problems. Therefore, we aim to build a composite-type CMAC model that combines classification and regression algorithms to simultaneously classify categories and estimate their proportional linear measures.

scholarly journals DANNP: an efficient artificial neural network pruning tool

2017 ◽  
Vol 3 ◽  
pp. e137 ◽  
Author(s):  
Mona Alshahrani ◽  
Othman Soufan ◽  
Arturo Magana-Mora ◽  
Vladimir B. Bajic
Keyword(s):  
Neural Network ◽  
State Of The Art ◽  
Model Performance ◽  
Training Data ◽  
Classification Problems ◽  
Link Type ◽  
On Line ◽  
Pruning Algorithms ◽  
Artificial Neural ◽  
The Impact

Background Artificial neural networks (ANNs) are a robust class of machine learning models and are a frequent choice for solving classification problems. However, determining the structure of the ANNs is not trivial as a large number of weights (connection links) may lead to overfitting the training data. Although several ANN pruning algorithms have been proposed for the simplification of ANNs, these algorithms are not able to efficiently cope with intricate ANN structures required for complex classification problems. Methods We developed DANNP, a web-based tool, that implements parallelized versions of several ANN pruning algorithms. The DANNP tool uses a modified version of the Fast Compressed Neural Network software implemented in C++ to considerably enhance the running time of the ANN pruning algorithms we implemented. In addition to the performance evaluation of the pruned ANNs, we systematically compared the set of features that remained in the pruned ANN with those obtained by different state-of-the-art feature selection (FS) methods. Results Although the ANN pruning algorithms are not entirely parallelizable, DANNP was able to speed up the ANN pruning up to eight times on a 32-core machine, compared to the serial implementations. To assess the impact of the ANN pruning by DANNP tool, we used 16 datasets from different domains. In eight out of the 16 datasets, DANNP significantly reduced the number of weights by 70%–99%, while maintaining a competitive or better model performance compared to the unpruned ANN. Finally, we used a naïve Bayes classifier derived with the features selected as a byproduct of the ANN pruning and demonstrated that its accuracy is comparable to those obtained by the classifiers trained with the features selected by several state-of-the-art FS methods. The FS ranking methodology proposed in this study allows the users to identify the most discriminant features of the problem at hand. To the best of our knowledge, DANNP (publicly available at www.cbrc.kaust.edu.sa/dannp) is the only available and on-line accessible tool that provides multiple parallelized ANN pruning options. Datasets and DANNP code can be obtained at www.cbrc.kaust.edu.sa/dannp/data.php and https://doi.org/10.5281/zenodo.1001086.

Semi-Supervised Learning

2011 ◽  
pp. 1022-1027
Author(s):  
Tobias Scheffer
Keyword(s):  
Supervised Learning ◽  
Supervised Classification ◽  
Unlabeled Data ◽  
Training Data ◽  
Classification Algorithms ◽  
Classification Problems

For many classification problems, unlabeled training data are inexpensive and readily available, whereas labeling training data imposes costs. Semi-supervised classification algorithms aim at utilizing information contained in unlabeled data in addition to the (few) labeled data.

scholarly journals Learning Diatoms Classification from a Dry Test Slide by Holographic Microscopy

Sensors ◽  
2020 ◽  
Vol 20 (21) ◽  
pp. 6353
Author(s):  
Pasquale Memmolo ◽  
Pierluigi Carcagnì ◽  
Vittorio Bianco ◽  
Francesco Merola ◽  
Andouglas Goncalves da Silva Junior ◽  
...  
Keyword(s):  
Data Augmentation ◽  
Imaging Modality ◽  
Training Data ◽  
Classification Problems ◽  
Deep Convolutional Neural Networks ◽  
Live Diatoms ◽  
Freshwater Habitats ◽  
Commercial Glass ◽  
Holographic Microscopy

Diatoms are among the dominant phytoplankters in marine and freshwater habitats, and important biomarkers of water quality, making their identification and classification one of the current challenges for environmental monitoring. To date, taxonomy of the species populating a water column is still conducted by marine biologists on the basis of their own experience. On the other hand, deep learning is recognized as the elective technique for solving image classification problems. However, a large amount of training data is usually needed, thus requiring the synthetic enlargement of the dataset through data augmentation. In the case of microalgae, the large variety of species that populate the marine environments makes it arduous to perform an exhaustive training that considers all the possible classes. However, commercial test slides containing one diatom element per class fixed in between two glasses are available on the market. These are usually prepared by expert diatomists for taxonomy purposes, thus constituting libraries of the populations that can be found in oceans. Here we show that such test slides are very useful for training accurate deep Convolutional Neural Networks (CNNs). We demonstrate the successful classification of diatoms based on a proper CNNs ensemble and a fully augmented dataset, i.e., creation starting from one single image per class available from a commercial glass slide containing 50 fixed species in a dry setting. This approach avoids the time-consuming steps of water sampling and labeling by skilled marine biologists. To accomplish this goal, we exploit the holographic imaging modality, which permits the accessing of a quantitative phase-contrast maps and a posteriori flexible refocusing due to its intrinsic 3D imaging capability. The network model is then validated by using holographic recordings of live diatoms imaged in water samples i.e., in their natural wet environmental condition.

scholarly journals CharTeC-Net: An Efficient and Lightweight Character-Based Convolutional Network for Text Classification

2020 ◽  
Vol 2020 ◽  
pp. 1-7 ◽  
Author(s):  
Aboubakar Nasser Samatin Njikam ◽  
Huan Zhao
Keyword(s):  
Text Classification ◽  
Building Block ◽  
Large Scale ◽  
State Of The Art ◽  
Building Blocks ◽  
Training Data ◽  
Superior Performance ◽  
Classification Problems ◽  
Computationally Efficient ◽  
Convolutional Network

This paper introduces an extremely lightweight (with just over around two hundred thousand parameters) and computationally efficient CNN architecture, named CharTeC-Net (Character-based Text Classification Network), for character-based text classification problems. This new architecture is composed of four building blocks for feature extraction. Each of these building blocks, except the last one, uses 1 × 1 pointwise convolutional layers to add more nonlinearity to the network and to increase the dimensions within each building block. In addition, shortcut connections are used in each building block to facilitate the flow of gradients over the network, but more importantly to ensure that the original signal present in the training data is shared across each building block. Experiments on eight standard large-scale text classification and sentiment analysis datasets demonstrate CharTeC-Net’s superior performance over baseline methods and yields competitive accuracy compared with state-of-the-art methods, although CharTeC-Net has only between 181,427 and 225,323 parameters and weighs less than 1 megabyte.

An Algorithm of Edge Detection Based on FSVM

2013 ◽  
Vol 321-324 ◽  
pp. 1046-1050
Author(s):  
Ai Ping Cai
Keyword(s):  
Target Identification ◽  
Main Idea ◽  
Detection Algorithm ◽  
Training Data ◽  
Classification Model ◽  
Detection Methods ◽  
Support Vector ◽  
Classification Problems ◽  
Tracking Motion ◽  
Image Edge

The support vector machine (SVM) has been shown to be an efficient approach for a variety of classification problems. It has also been widely used in target identification and tracking, motion analysis, image segmentation technology. Traditional detection methods mostly exist pseudo-edge and poor anti-noise capability. Under these circumstances, developing an efficient method is necessary. In this paper, we propose a new detection algorithm based on FSVM, the main idea is to train classified sample and give all training data a degree of membership, increase punishment to the wrong sub-sample. Then training and testing the FSVM classification model. Finally, extract edge of the image by using FSVM classification model. Experimental results show that the new algorithm can detect a clear image edge and have a good anti-noise nature.

scholarly journals Kernel-Based Ensemble Learning in Python

Information ◽  
2020 ◽  
Vol 11 (2) ◽  
pp. 63 ◽  
Author(s):  
Benjamin Guedj ◽  
Bhargav Srinivasa Desikan
Keyword(s):  
Numerical Experiments ◽  
Learning Strategy ◽  
Learning Algorithm ◽  
Real Life ◽  
Training Data ◽  
Smoothing Kernel ◽  
Regression Problems ◽  
Classification And Regression ◽  
Synthetic Datasets ◽  
Python Package

We propose a new supervised learning algorithm for classification and regression problems where two or more preliminary predictors are available. We introduce KernelCobra, a non-linear learning strategy for combining an arbitrary number of initial predictors. KernelCobra builds on the COBRA algorithm introduced by Biau et al. (2016), which combined estimators based on a notion of proximity of predictions on the training data. While the COBRA algorithm used a binary threshold to declare which training data were close and to be used, we generalise this idea by using a kernel to better encapsulate the proximity information. Such a smoothing kernel provides more representative weights to each of the training points which are used to build the aggregate and final predictor, and KernelCobra systematically outperforms the COBRA algorithm. While COBRA is intended for regression, KernelCobra deals with classification and regression. KernelCobra is included as part of the open source Python package Pycobra (0.2.4 and onward), introduced by Srinivasa Desikan (2018). Numerical experiments were undertaken to assess the performance (in terms of pure prediction and computational complexity) of KernelCobra on real-life and synthetic datasets.

scholarly journals Using Ensembles for Accurate Modelling of Manufacturing Processes in an IoT Data-Acquisition Solution

2020 ◽  
Vol 10 (13) ◽  
pp. 4606
Author(s):  
José Luis Garrido-Labrador ◽  
Daniel Puente-Gabarri ◽  
José Miguel Ramírez-Sanz ◽  
David Ayala-Dulanto ◽  
Jesus Maudes
Keyword(s):  
Prediction Models ◽  
Thermal Evolution ◽  
Machine Learning Techniques ◽  
Limited Information ◽  
Classification Problems ◽  
Machining Processes ◽  
Machining Center ◽  
Learning Techniques ◽  
Regression Problems ◽  
Algorithmic Technique

The development of complex real-time platforms for the Internet of Things (IoT) opens up a promising future for the diagnosis and the optimization of machining processes. Many issues have still to be solved before IoT platforms can be profitable for small workshops with very flexible workloads and workflows. The main obstacles refer to sensor implementation, IoT architecture, and data processing, and analysis. In this research, the use of different machine-learning techniques is proposed, for the extraction of different information from an IoT platform connected to a machining center, working under real industrial conditions in a workshop. The aim is to evaluate which algorithmic technique might be the best to build accurate prediction models for one of the main demands of workshops: the optimization of machining processes. This evaluation, completed under real industrial conditions, includes very limited information on the machining workload of the machining center and unbalanced datasets. The strategy is validated for the classification of the state of a machining center, its working mode, and the prediction of the thermal evolution of the main machine-tool motors: the axis motors and the milling head motor. The results show the superiority of the ensembles for both classification problems under analysis and all four regression problems. In particular, Rotation Forest-based ensembles turned out to have the best performance in the experiments for all the metrics under study. The models are accurate enough to provide useful conclusions applicable to current industrial practice, such as improvements in machine programming to avoid cutting conditions that might greatly reduce tool lifetime and damage machine components.

A Modified Incremental Support Vector Machine for Regression

2011 ◽  
Vol 135-136 ◽  
pp. 63-69 ◽  
Author(s):  
Jian Guo Wang ◽  
Liang Wu Cheng ◽  
Wen Xing Zhang ◽  
Bo Qin
Keyword(s):  
Support Vector Machine ◽  
Predictive Power ◽  
Training Data ◽  
Support Vector ◽  
Mechanical Equipment ◽  
Final Decision ◽  
Data Sets ◽  
Regression Problems ◽  
Traditional Approaches ◽  
Speed And Accuracy

support vector machine (SVM) has been shown to exhibit superior predictive power compared to traditional approaches in many studies, such as mechanical equipment monitoring and diagnosis. However, SVM training is very costly in terms of time and memory consumption due to the enormous amounts of training data and the quadratic programming problem. In order to improve SVM training speed and accuracy, we propose a modified incremental support vector machine (MISVM) for regression problems in this paper. The main concepts are that using the distance from the margin vectors which violate the Karush-Kuhn-Tucker (KKT) condition to the final decision hyperplane to evaluate the importance of each margin vectors, and the margin vectors whose distance is below the specified value are preserved, the others are eliminated. Then the original SVs and the remaining margin vectors are used to train a new SVM. The proposed MISVM can not only eliminate the unimportant samples such as noise samples, but also preserved the important samples. The effectiveness of the proposed MISVMs is demonstrated with two UCI data sets. These experiments also show that the proposed MISVM is competitive with previously published methods.

Sign in / Sign up

Export Citation Format

Share Document