scholarly journals FAST NON-NEGATIVE LEAST-SQUARES LEARNING IN THE RANDOM NEURAL NETWORK

2016 ◽  
Vol 30 (3) ◽  
pp. 379-402 ◽  
Author(s):  
Stelios Timotheou
Keyword(s):  
Neural Network ◽  
Least Squares ◽  
Supervised Learning ◽  
Neural Model ◽  
Management Problem ◽  
Biologically Inspired ◽  
Solution Quality ◽  
Learning Capacity ◽  
Random Neural Network ◽  
Learning Capabilities

The random neural network is a biologically inspired neural model where neurons interact by probabilistically exchanging positive and negative unit-amplitude signals that has superior learning capabilities compared to other artificial neural networks. This paper considers non-negative least squares supervised learning in this context, and develops an approach that achieves fast execution and excellent learning capacity. This speedup is a result of significant enhancements in the solution of the non-negative least-squares problem which regard (a) the development of analytical expressions for the evaluation of the gradient and objective functions and (b) a novel limited-memory quasi-Newton solution algorithm. Simulation results in the context of optimizing the performance of a disaster management problem using supervised learning verify the efficiency of the approach, achieving two orders of magnitude execution speedup and improved solution quality compared to state-of-the-art algorithms.

A Biologically Inspired Evolving Spiking Neural Model with Rank-Order Population Coding and a Taste Recognition System Case Study

2011 ◽  
pp. 136-155 ◽  
Author(s):  
S. Soltic ◽  
N. Kasabov
Keyword(s):  
Neural Network ◽  
Adaptive Learning ◽  
Rank Order ◽  
Neural Model ◽  
Recognition System ◽  
Population Coding ◽  
Spiking Neural Network ◽  
Biologically Inspired ◽  
Information Encoding ◽  
Evolving Spiking Neural Network

The human brain has an amazing ability to recognize hundreds of thousands of different tastes. The question is: can we build artificial systems that can achieve this level of complexity? Such systems would be useful in biosecurity, the chemical and food industry, security, in home automation, etc. The purpose of this chapter is to explore how spiking neurons could be employed for building biologically plausible and efficient taste recognition systems. It presents an approach based on a novel spiking neural network model, the evolving spiking neural network with population coding (ESNN-PC), which is characterized by: (i) adaptive learning, (ii) knowledge discovery and (iii) accurate classification. ESNN-PC is used on a benchmark taste problem where the effectiveness of the information encoding, the quality of extracted rules and the model’s adaptive properties are explored. Finally, applications of ESNN-PC in recognition of the increasing interest in robotics and pervasive computing are suggested.

Oil Saturation Log Prediction Using Neural Network in New Steamflood Area

2020 ◽  
Author(s):  
A. Syahputra
Keyword(s):  
Neural Network ◽  
Water Saturation ◽  
Prediction Method ◽  
Neural Model ◽  
Training Model ◽  
Acquisition Time ◽  
Oil Saturation ◽  
Full Field ◽  
Remaining Oil ◽  
Observation Wells

Surveillance is very important in managing a steamflood project. On the current surveillance plan, Temperature and steam ID logs are acquired on observation wells at least every year while CO log (oil saturation log or SO log) every 3 years. Based on those surveillance logs, a dynamic full field reservoir model is updated quarterly. Typically, a high depletion rate happens in a new steamflood area as a function of drainage activities and steamflood injection. Due to different acquisition time, there is a possibility of misalignment or information gaps between remaining oil maps (ie: net pay, average oil saturation or hydrocarbon pore thickness map) with steam chest map, for example a case of high remaining oil on high steam saturation interval. The methodology that is used to predict oil saturation log is neural network. In this neural network method, open hole observation wells logs (static reservoir log) such as vshale, porosity, water saturation effective, and pay non pay interval), dynamic reservoir logs as temperature, steam saturation, oil saturation, and acquisition time are used as input. A study case of a new steamflood area with 16 patterns of single reservoir target used 6 active observation wells and 15 complete logs sets (temperature, steam ID, and CO log), 19 incomplete logs sets (only temperature and steam ID) since 2014 to 2019. Those data were divided as follows ~80% of completed log set data for neural network training model and ~20% of completed log set data for testing the model. As the result of neural model testing, R2 is score 0.86 with RMS 5% oil saturation. In this testing step, oil saturation log prediction is compared to actual data. Only minor data that shows different oil saturation value and overall shape of oil saturation logs are match. This neural network model is then used for oil saturation log prediction in 19 incomplete log set. The oil saturation log prediction method can fill the gap of data to better describe the depletion process in a new steamflood area. This method also helps to align steam map and remaining oil to support reservoir management in a steamflood project.

scholarly journals Multi-Scale Aggregation Graph Neural Networks Based on Feature Similarity for Semi-Supervised Learning

Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 403
Author(s):  
Xun Zhang ◽  
Lanyan Yang ◽  
Bin Zhang ◽  
Ying Liu ◽  
Dong Jiang ◽  
...  
Keyword(s):  
Neural Network ◽  
Supervised Learning ◽  
Structured Data ◽  
Similarity Matrix ◽  
Scale Feature ◽  
Multi Scale ◽  
Adjacent Node ◽  
Feature Similarity ◽  
The Mean ◽  
Graph Neural Networks

The problem of extracting meaningful data through graph analysis spans a range of different fields, such as social networks, knowledge graphs, citation networks, the World Wide Web, and so on. As increasingly structured data become available, the importance of being able to effectively mine and learn from such data continues to grow. In this paper, we propose the multi-scale aggregation graph neural network based on feature similarity (MAGN), a novel graph neural network defined in the vertex domain. Our model provides a simple and general semi-supervised learning method for graph-structured data, in which only a very small part of the data is labeled as the training set. We first construct a similarity matrix by calculating the similarity of original features between all adjacent node pairs, and then generate a set of feature extractors utilizing the similarity matrix to perform multi-scale feature propagation on graphs. The output of multi-scale feature propagation is finally aggregated by using the mean-pooling operation. Our method aims to improve the model representation ability via multi-scale neighborhood aggregation based on feature similarity. Extensive experimental evaluation on various open benchmarks shows the competitive performance of our method compared to a variety of popular architectures.

Sign in / Sign up

Export Citation Format

Share Document