Clique-Based Neural Associative Memories with Local Coding and Precoding

2016 ◽  
Vol 28 (8) ◽  
pp. 1553-1573 ◽  
Author(s):  
Asieh Abolpour Mofrad ◽  
Matthew G. Parker ◽  
Zahra Ferdosi ◽  
Mohammad H. Tadayon
Keyword(s):  
Neural Network ◽  
Associative Memory ◽  
Coding Theory ◽  
Simple Graph ◽  
Graph Representation ◽  
Associative Memories ◽  
Additive Codes ◽  
Partial Error ◽  
Pattern Retrieval ◽  
Local Coding

Techniques from coding theory are able to improve the efficiency of neuroinspired and neural associative memories by forcing some construction and constraints on the network. In this letter, the approach is to embed coding techniques into neural associative memory in order to increase their performance in the presence of partial erasures. The motivation comes from recent work by Gripon, Berrou, and coauthors, which revisited Willshaw networks and presented a neural network with interacting neurons that partitioned into clusters. The model introduced stores patterns as small-size cliques that can be retrieved in spite of partial error. We focus on improving the success of retrieval by applying two techniques: doing a local coding in each cluster and then applying a precoding step. We use a slightly different decoding scheme, which is appropriate for partial erasures and converges faster. Although the ideas of local coding and precoding are not new, the way we apply them is different. Simulations show an increase in the pattern retrieval capacity for both techniques. Moreover, we use self-dual additive codes over field [Formula: see text], which have very interesting properties and a simple-graph representation.

Neural network associative memories with local coding

2015 ◽  
Author(s):  
Asieh Abolpour Mofrad ◽  
Zahra Ferdosi ◽  
Matthew G. Parker ◽  
Mohammad H. Tadayon
Keyword(s):  
Neural Network ◽  
Associative Memories ◽  
Local Coding

Real-Time Associative Memory–Based Rear-End Collision Warning System

2017 ◽  
Vol 2621 (1) ◽  
pp. 1-9 ◽  
Author(s):  
Donghoun Lee ◽  
Sehyun Tak ◽  
Sungjin Park ◽  
Hwasoo Yeo
Keyword(s):  
Neural Network ◽  
Real Time ◽  
Associative Memory ◽  
Intelligent Transportation System ◽  
Warning System ◽  
Time Interval ◽  
Associative Memories ◽  
Collision Warning ◽  
Sampling Ratio ◽  
Artificial Neural Network Ann

In the intelligent transportation system field, there has been a growing interest in developing collision warning systems based on artificial neural network (ANN) techniques in an effort to address several issues associated with parametric approaches. Previous ANN-based collision warning algorithms were generally based on predetermined associative memories derived before driving. Because collision risk is highly related to the current traffic situation, such as traffic state transition from free flow to congestion, however, updating associative memory in real time should be considered. To improve further the performance of the warning system, a systemic architecture is proposed to implement the multilayer perceptron neural network–based rear-end collision warning system (MCWS), which updates the associative memory with the vehicle distance sensor and smartphone data in a cloud computing environment. For the practical use of the proposed MCWS, its collision warning accuracy is evaluated with respect to various time intervals for updating the associative memories and market penetration rates. Results show that the MCWS exhibits a steady improvement in its warning performance as the time interval decreases, whereas the MCWS works more efficiently as the sampling ratio increases overall. When the sampling ratio reaches 50%, the MCWS shows a particularly stable warning accuracy, regardless of the time interval. These findings suggest that the MCWS has great potential to provide an acceptable level of warning accuracy for practical use, as it can obtain the well-trained associative memories reflecting current traffic situations by using information from widespread smartphones.

Nested-Clique Network Model of Neural Associative Memory

2017 ◽  
Vol 29 (6) ◽  
pp. 1681-1695 ◽  
Author(s):  
Asieh Abolpour Mofrad ◽  
Matthew G. Parker
Keyword(s):  
Associative Memory ◽  
Network Model ◽  
Associative Memories ◽  
Learning Capacity ◽  
Retrieval Rate ◽  
Graph Structures ◽  
Clique Graph ◽  
Simulation Results ◽  
Local Coding ◽  
Gb Model

Clique-based neural associative memories introduced by Gripon and Berrou (GB), have been shown to have good performance, and in our previous work we improved the learning capacity and retrieval rate by local coding and precoding in the presence of partial erasures. We now take a step forward and consider nested-clique graph structures for the network. The GB model stores patterns as small cliques, and we here replace these by nested cliques. Simulation results show that the nested-clique structure enhances the clique-based model.

scholarly journals A Study of Associative Memories with Hopfield neural network Model for handwritten character recognition

2018 ◽  
Vol 3 (01) ◽  
Author(s):  
Sandeep Kumar ◽  
Manu Pratap Singh
Keyword(s):  
Neural Network ◽  
Associative Memory ◽  
Network Model ◽  
Neural Network Model ◽  
Character Recognition ◽  
Hopfield Neural Network ◽  
Recurrent Network ◽  
Associative Memories ◽  
Bidirectional Associative Memory ◽  
Content Addressable Memory

Neural network is the most important model which has been studied in past decades by several researchers. Hopfield model is one of the network model proposed by J.J. Hopfield that describes the organization of neurons in such a way that they function as associative memory or also called content addressable memory. This is a recurrent network similar to recurrent layer of the hamming network but which can effectively perform the operation of both layer hamming network. The design of recurrent network has always been interesting problems to research and a lot of work is going on present application. In present paper we will discuss about the design of Hopfield Neural Network (HNNs), bidirectional associative memory (BAMs) and multidirectional associative memory (MAMs) for handwritten characters recognition. Recognized characters are Hindi alphabets.

An associative memory based on an electronic neural network architecture

1987 ◽  
Vol 34 (7) ◽  
pp. 1553-1556 ◽  
Author(s):  
R.E. Howard ◽  
D.B. Schwartz ◽  
J.S. Denker ◽  
R.W. Epworth ◽  
H.P. Graf ◽  
...  
Keyword(s):  
Neural Network ◽  
Associative Memory ◽  
Network Architecture ◽  
Neural Network Architecture

scholarly journals Research of Personalized Recommendation Technology Based on Knowledge Graphs

2021 ◽  
Vol 11 (15) ◽  
pp. 7104
Author(s):  
Xu Yang ◽  
Ziyi Huan ◽  
Yisong Zhai ◽  
Ting Lin
Keyword(s):  
Neural Network ◽  
Hot Spot ◽  
Experimental Results ◽  
Graph Representation ◽  
Personalized Recommendation ◽  
Knowledge Graph ◽  
Learning Technology ◽  
Data Set ◽  
Model Based ◽  
Knowledge Graphs

Nowadays, personalized recommendation based on knowledge graphs has become a hot spot for researchers due to its good recommendation effect. In this paper, we researched personalized recommendation based on knowledge graphs. First of all, we study the knowledge graphs’ construction method and complete the construction of the movie knowledge graphs. Furthermore, we use Neo4j graph database to store the movie data and vividly display it. Then, the classical translation model TransE algorithm in knowledge graph representation learning technology is studied in this paper, and we improved the algorithm through a cross-training method by using the information of the neighboring feature structures of the entities in the knowledge graph. Furthermore, the negative sampling process of TransE algorithm is improved. The experimental results show that the improved TransE model can more accurately vectorize entities and relations. Finally, this paper constructs a recommendation model by combining knowledge graphs with ranking learning and neural network. We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-BPR) and the neural network recommendation model based on knowledge graphs(KG-NN). The semantic information of entities and relations in knowledge graphs is embedded into vector space by using improved TransE method, and we compare the results. The item entity vectors containing external knowledge information are integrated into the BPR model and neural network, respectively, which make up for the lack of knowledge information of the item itself. Finally, the experimental analysis is carried out on MovieLens-1M data set. The experimental results show that the two recommendation models proposed in this paper can effectively improve the accuracy, recall, F1 value and MAP value of recommendation.

scholarly journals A Novel Chaotic Neural Network Using Memristive Synapse with Applications in Associative Memory

2012 ◽  
Vol 2012 ◽  
pp. 1-19 ◽  
Author(s):  
Xiaofang Hu ◽  
Shukai Duan ◽  
Lidan Wang
Keyword(s):  
Neural Network ◽  
Associative Memory ◽  
Large Scale ◽  
Cmos Technology ◽  
Chaotic Neural Network ◽  
Circuit Element ◽  
Nanoscale Cmos ◽  
Dynamical Behaviors ◽  
Implementation Scheme ◽  
Further Development

Chaotic Neural Network, also denoted by the acronym CNN, has rich dynamical behaviors that can be harnessed in promising engineering applications. However, due to its complex synapse learning rules and network structure, it is difficult to update its synaptic weights quickly and implement its large scale physical circuit. This paper addresses an implementation scheme of a novel CNN with memristive neural synapses that may provide a feasible solution for further development of CNN. Memristor, widely known as the fourth fundamental circuit element, was theoretically predicted by Chua in 1971 and has been developed in 2008 by the researchers in Hewlett-Packard Laboratory. Memristor based hybrid nanoscale CMOS technology is expected to revolutionize the digital and neuromorphic computation. The proposed memristive CNN has four significant features: (1) nanoscale memristors can simplify the synaptic circuit greatly and enable the synaptic weights update easily; (2) it can separate stored patterns from superimposed input; (3) it can deal with one-to-many associative memory; (4) it can deal with many-to-many associative memory. Simulation results are provided to illustrate the effectiveness of the proposed scheme.

Sign in / Sign up

Export Citation Format

Share Document