scholarly journals Template-Based Math Word Problem Solvers with Recursive Neural Networks

2019 ◽  
Vol 33 ◽  
pp. 7144-7151 ◽  
Author(s):  
Lei Wang ◽  
Dongxiang Zhang ◽  
Jipeng Zhang ◽  
Xing Xu ◽  
Lianli Gao ◽  
...  
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Word Problem ◽  
Large Space ◽  
Wide Margin ◽  
Recursive Neural Networks ◽  
Recursive Neural Network ◽  
Operator Nodes ◽  
Problem Solvers ◽  
New Framework

The design of automatic solvers to arithmetic math word problems has attracted considerable attention in recent years and a large number of datasets and methods have been published. Among them, Math23K is the largest data corpus that is very helpful to evaluate the generality and robustness of a proposed solution. The best performer in Math23K is a seq2seq model based on LSTM to generate the math expression. However, the model suffers from performance degradation in large space of target expressions. In this paper, we propose a template-based solution based on recursive neural network for math expression construction. More specifically, we first apply a seq2seq model to predict a tree-structure template, with inferred numbers as leaf nodes and unknown operators as inner nodes. Then, we design a recursive neural network to encode the quantity with Bi-LSTM and self attention, and infer the unknown operator nodes in a bottom-up manner. The experimental results clearly establish the superiority of our new framework as we improve the accuracy by a wide margin in two of the largest datasets, i.e., from 58.1% to 66.9% in Math23K and from 62.8% to 66.8% in MAWPS.

Exploration of Forecasting the State of Metal Oxide Volt-Sensitive Protectors Based on Improve Recursive Neural Networks

2014 ◽  
Vol 472 ◽  
pp. 398-403
Author(s):  
Shuang De Zhang ◽  
Long Zhou ◽  
Hai Ping Guo
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Metal Oxide ◽  
The State ◽  
Forecast Method ◽  
Recursive Neural Networks ◽  
Recursive Neural Network

In this paper, a method is put forward to forecast the MOVs state based on the improve recursive neural network. The result indicates that recursive network is more adapted to the state forecast of MOV. Because the running state of MOV is closely related to the system voltage and the environment, the state forecast method affected by multi-factors should be further considered.

scholarly journals Predicting Customer Turnover Using Recursive Neural Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Abdullah Jafari Chashmi ◽  
Vahid Rahmati ◽  
Behrouz Rezasoroush ◽  
Masumeh Motevalli Alamoti ◽  
Mohsen Askari ◽  
...  
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Learning Algorithm ◽  
Customer Relationship ◽  
Loyalty Programs ◽  
Recurrent Nerve ◽  
The Neural Network ◽  
Recursive Neural Networks ◽  
The Neural Networks ◽  
A Company

The most valuable asset for a company is its customers’ base. As a result, customer relationship management (CRM) is an important task that drives companies. By identifying and understanding the valuable customer segments, appropriate marketing strategies can be used to enhance customer satisfaction and maintain loyalty, as well as increase company retention. Predicting customer turnover is an important tool for companies to stay competitive in a fast-growing market. In this paper, we use the recurrent nerve sketch to predict rejection based on the time series of the lifetime of the customer. In anticipation, a key aspect of identifying key triggers is to turn off. To overcome the weakness of recurrent neural networks, the research model of the combination of LRFMP with the neural network has been used. In this paper, it was found that clustering by LRFMP can be used to perform a more comprehensive analysis of customers’ turnover. In this solution, LRFMP is used to execute customer segregation. The objective is to provide a new framework for LRFMP for macrodata and macrodata analysis in order to increase the problem of business problem solving and customer depreciation. The results of the research show that the neural networks are capable of predicting the LRFMP precursors of the customers in an effective way. This model can be used in advocacy systems for advertising and loyalty programs management. In the previous research, the LRFM and RFM algorithms along with the neural network and the machine learning algorithm, etc., have been used, and in the proposed solution, the use of the LRFMP algorithm increases the accuracy of the desired.

scholarly journals Multi-Document Abstractive Summarization using Recursive Neural Network

2020 ◽  
Vol 9 (7) ◽  
pp. 364-370
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Text Summarization ◽  
Similarity Matrix ◽  
Text Documents ◽  
Short Text ◽  
Current State ◽  
Recursive Neural Networks ◽  
Semantic Concepts ◽  
Abstractive Summarization

Text summarization is an area of research with a goal to provide short text from huge text documents. Extractive text summarization methods have been extensively studied by many researchers. There are various type of multi document ranging from different formats to domains and topic specific. With the application of neural networks for text generation, interest for research in abstractive text summarization has increased significantly. This approach has been attempted for English and Telugu languages in this article. Recurrent neural networks are a subtype of recursive neural networks which try to predict the next sequence based on the current state and considering the information from previous states. The use of neural networks allows generation of summaries for long text sentences as well. The work implements semantic based filtering using a similarity matrix while keeping all stop-words. The similarity is calculated using semantic concepts and Jiang Similarity and making use of a Recurrent Neural Network (RNN) with an attention mechanism to generate summary. ROUGE score is used for measuring the performance of the applied method on Telugu and English langauges .

scholarly journals Syntactically Meaningful and Transferable Recursive Neural Networks for Aspect and Opinion Extraction

2020 ◽  
Vol 45 (4) ◽  
pp. 705-736
Author(s):  
Wenya Wang ◽  
Sinno Jialin Pan
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Syntactic Structure ◽  
Feature Learning ◽  
Single Domain ◽  
Fine Grained ◽  
Adversarial Network ◽  
Dependency Tree ◽  
Recursive Neural Networks ◽  
Syntactic Relations

In fine-grained opinion mining, extracting aspect terms (a.k.a. opinion targets) and opinion terms (a.k.a. opinion expressions) from user-generated texts is the most fundamental task in order to generate structured opinion summarization. Existing studies have shown that the syntactic relations between aspect and opinion words play an important role for aspect and opinion terms extraction. However, most of the works either relied on predefined rules or separated relation mining with feature learning. Moreover, these works only focused on single-domain extraction, which failed to adapt well to other domains of interest where only unlabeled data are available. In real-world scenarios, annotated resources are extremely scarce for many domains, motivating knowledge transfer strategies from labeled source domain(s) to any unlabeled target domain. We observe that syntactic relations among target words to be extracted are not only crucial for single-domain extraction, but also serve as invariant “pivot” information to bridge the gap between different domains. In this article, we explore the constructions of recursive neural networks based on the dependency tree of each sentence for associating syntactic structure with feature learning. Furthermore, we construct transferable recursive neural networks to automatically learn the domain-invariant fine-grained interactions among aspect words and opinion words. The transferability is built on an auxiliary task and a conditional domain adversarial network to reduce domain distribution difference in the hidden spaces effectively in word level through syntactic relations. Specifically, the auxiliary task builds structural correspondences across domains by predicting the dependency relation for each path of the dependency tree in the recursive neural network. The conditional domain adversarial network helps to learn domain-invariant hidden representation for each word conditioned on the syntactic structure. In the end, we integrate the recursive neural network with a sequence labeling classifier on top that models contextual influence in the final predictions. Extensive experiments and analysis are conducted to demonstrate the effectiveness of the proposed model and each component on three benchmark data sets.

Application of an Improved Recurrent Neural Network in Network Security Situation Prediction

2014 ◽  
Vol 951 ◽  
pp. 173-176
Author(s):  
Jun Ping Cai ◽  
Lei Qu ◽  
Gang Chen ◽  
Jun Yang
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Network Security ◽  
Network Topology ◽  
High Efficiency ◽  
High Accuracy ◽  
Data Traffic ◽  
Network Load ◽  
Nonlinear Complexity ◽  
Recursive Neural Networks

The expansion of the network becomes size, network mode is diversification, network topology structure becomes more complex, the data traffic rises rapidly in the network, causes the network load increases, attack, fault and other unexpected network security events are more severe. Neural network to deal with nonlinear, complexity advantage of this paper, network security situation prediction based on improved recursive neural networks, experimental results show that the high efficiency of the method, results are compared with the actual values, low error, high accuracy.

scholarly journals Neural Relation Extraction within and across Sentence Boundaries

2019 ◽  
Vol 33 ◽  
pp. 6513-6520 ◽  
Author(s):  
Pankaj Gupta ◽  
Subburam Rajaram ◽  
Hinrich Schütze ◽  
Thomas Runkler
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Binary Relation ◽  
State Of The Art ◽  
Relation Extraction ◽  
Shared Task ◽  
Single Sentence ◽  
Winning Team ◽  
Recursive Neural Networks ◽  
Better Than

Past work in relation extraction mostly focuses on binary relation between entity pairs within single sentence. Recently, the NLP community has gained interest in relation extraction in entity pairs spanning multiple sentences. In this paper, we propose a novel architecture for this task: inter-sentential dependency-based neural networks (iDepNN). iDepNN models the shortest and augmented dependency paths via recurrent and recursive neural networks to extract relationships within (intra-) and across (inter-) sentence boundaries. Compared to SVM and neural network baselines, iDepNN is more robust to false positives in relationships spanning sentences. We evaluate our models on four datasets from newswire (MUC6) and medical (BioNLP shared task) domains that achieve state-of-the-art performance and show a better balance in precision and recall for inter-sentential relationships. We perform better than 11 teams participating in the BioNLP shared task 2016 and achieve a gain of 5.2% (0.587 vs 0.558) in F1 over the winning team. We also release the crosssentence annotations for MUC6.

scholarly journals Dynamic Compositionality in Recursive Neural Networks with Structure-Aware Tag Representations

2019 ◽  
Vol 33 ◽  
pp. 6594-6601 ◽  
Author(s):  
Taeuk Kim ◽  
Jihun Choi ◽  
Daniel Edmiston ◽  
Sanghwan Bae ◽  
Sang-goo Lee
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Natural Language ◽  
Sentiment Analysis ◽  
Neural Models ◽  
Sentence Level ◽  
Recursive Neural Networks ◽  
Syntactic Information ◽  
Parse Trees ◽  
By Products

Most existing recursive neural network (RvNN) architectures utilize only the structure of parse trees, ignoring syntactic tags which are provided as by-products of parsing. We present a novel RvNN architecture that can provide dynamic compositionality by considering comprehensive syntactic information derived from both the structure and linguistic tags. Specifically, we introduce a structure-aware tag representation constructed by a separate tag-level tree-LSTM. With this, we can control the composition function of the existing wordlevel tree-LSTM by augmenting the representation as a supplementary input to the gate functions of the tree-LSTM. In extensive experiments, we show that models built upon the proposed architecture obtain superior or competitive performance on several sentence-level tasks such as sentiment analysis and natural language inference when compared against previous tree-structured models and other sophisticated neural models.

SCORING MODELING BASED ON NEURAL NETWORKS FOR DETERMINING A BANK BORROWER'S RATING

2020 ◽  
Vol 2020 (10) ◽  
pp. 54-62
Author(s):  
Oleksii VASYLIEV ◽  
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Network Architecture ◽  
Statistical Data ◽  
Activation Function ◽  
Decision Making Process ◽  
Neural Network Architecture ◽  
Acceptable Accuracy ◽  
The Neural Network ◽  
Sigmoid Activation Function

The problem of applying neural networks to calculate ratings used in banking in the decision-making process on granting or not granting loans to borrowers is considered. The task is to determine the rating function of the borrower based on a set of statistical data on the effectiveness of loans provided by the bank. When constructing a regression model to calculate the rating function, it is necessary to know its general form. If so, the task is to calculate the parameters that are included in the expression for the rating function. In contrast to this approach, in the case of using neural networks, there is no need to specify the general form for the rating function. Instead, certain neural network architecture is chosen and parameters are calculated for it on the basis of statistical data. Importantly, the same neural network architecture can be used to process different sets of statistical data. The disadvantages of using neural networks include the need to calculate a large number of parameters. There is also no universal algorithm that would determine the optimal neural network architecture. As an example of the use of neural networks to determine the borrower's rating, a model system is considered, in which the borrower's rating is determined by a known non-analytical rating function. A neural network with two inner layers, which contain, respectively, three and two neurons and have a sigmoid activation function, is used for modeling. It is shown that the use of the neural network allows restoring the borrower's rating function with quite acceptable accuracy.

Color Space Transformation using Neural Networks

2019 ◽  
Vol 2019 (1) ◽  
pp. 153-158
Author(s):  
Lindsay MacDonald
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Color Space ◽  
Reflectance Spectra ◽  
Network Architectures ◽  
Color Spaces ◽  
Natural Materials ◽  
Space Transformation ◽  
Color Space Transformation

We investigated how well a multilayer neural network could implement the mapping between two trichromatic color spaces, specifically from camera R,G,B to tristimulus X,Y,Z. For training the network, a set of 800,000 synthetic reflectance spectra was generated. For testing the network, a set of 8,714 real reflectance spectra was collated from instrumental measurements on textiles, paints and natural materials. Various network architectures were tested, with both linear and sigmoidal activations. Results show that over 85% of all test samples had color errors of less than 1.0 ΔE2000 units, much more accurate than could be achieved by regression.

Estimating Pigment Concentrations from Spectral Images Using an Encoder‐Decoder Neural Network

2020 ◽  
Vol 64 (3) ◽  
pp. 30502-1-30502-15
Author(s):  
Kensuke Fukumoto ◽  
Norimichi Tsumura ◽  
Roy Berns
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Absorption Coefficient ◽  
Spectral Data ◽  
High Accuracy ◽  
Pigment Concentration ◽  
Scattering Coefficient ◽  
A Value ◽  
Input And Output ◽  
Pigment Concentrations

Abstract A method is proposed to estimate the concentration of pigments mixed in a painting, using the encoder‐decoder model of neural networks. The model is trained to output a value that is the same as its input, and its middle output extracts a certain feature as compressed information about the input. In this instance, the input and output are spectral data of a painting. The model is trained with pigment concentration as the middle output. A dataset containing the scattering coefficient and absorption coefficient of each of 19 pigments was used. The Kubelka‐Munk theory was applied to the coefficients to obtain many patterns of synthetic spectral data, which were used for training. The proposed method was tested using spectral images of 33 paintings, which showed that the method estimates, with high accuracy, the concentrations that have a similar spectrum of the target pigments.

Sign in / Sign up

Export Citation Format

Share Document