An autoassociative neural network model of paired-associate learning

Hebbian heteroassociative learning is inherently asymmetric. Storing a forward association, from item A to item B, enables recall of B (given A), but does not permit recall of A (given B). Recurrent networks can solve this problem by associating A to B and B back to A. In these recurrent networks, the forward and backward associations can be differentially weighted to account for asymmetries in recall performance. In the special case of equal strength forward and backward weights, these recurrent networks can be modeled as a single autoassociative network where A and B are two parts of a single, stored pattern. We analyze a general, recurrent neural network model of associative memory and examine its ability to fit a rich set of experimental data on human associative learning. The model fits the data significantly better when the forward and backward storage strengths are highly correlated than when they are less correlated. This network-based analysis of associative learning supports the view that associations between symbolic elements are better conceptualized as a blending of two ideas into a single unit than as separately modifiable forward and backward associations linking representations in memory.     

On the effect of noise on the moore-penrose generalized inverse associative memory

Monte Carlo simulations of the continuous Moore-Penrose generalized inverse associative memory (Kohonen [l]) have shown that the noise-to-signal ratio is improved on recall in the autoassociative case as long as the number of vector pairs stored is less than the number of components per vector. In the heteroassociative case, however, the noise-to-signal ratio may actually be greatly increased upon recall, particularly as the number of vector pairs stored approaches the number of components per vector. The increase in output noise-to-signal ratio in the heteroassociative case is found to be due to the fact that the inverse of the product of the key vector matrix with its transpose may increase without bound in spite of the fact that the key vectors are linearly independent.     

A sequential dynamic heteroassociative memory for multistep pattern recognition and one-to-many association

Bidirectional associative memories (BAMs) have been widely used for auto and heteroassociative learning. However, few research efforts have addressed the issue of multistep vector pattern recognition. We propose a model that can perform multi step pattern recognition without the need for a special learning algorithm, and with the capacity to learn more than two pattern series in the training set. The model can also learn pattern series of different lengths and, contrarily to previous models, the stimuli can be composed of gray-level images. The paper also shows that by adding an extra autoassociative layer, the model can accomplish one-to-many association, a task that was exclusive to feedforward networks with context units and error backpropagation learning.     

Autoassociative–heteroassociative neural networks

The Autoassociative–Heteroassociative Neural Network (A-HNN) is a unique integration of autoassociative and heteroassociative neural network mappings to provide a functional approximation of two variables from one. This new architecture provides three features: the autoassociative mapping enables a stability metric for assessing the robustness or accuracy of the heteroassociative mapping; the A-HNN generates the inverse of the encoding portion of an associated autoassociative neural network (AANN); and, empirically, the use of input data as target vectors (the autoassociative mapping) improves training performance of the network.     

Automatic Setting of Article Format Through Neural Networks

The automatic format-setting of journal articles for reducing the workload of computer users involves two processes: automatic acquisition of article format and automatic recall of article formal. Several neural networks have been explored to implement the two processes. The advantages and disadvantages of these neural networks are evaluated in comparison with capabilities of conventional computer programs. A heteroassociative back-propagation network has been developed for the automatic acquisition process. This network excels over computer programs because of its abilities in learning and generalizing implicit knowledge from examples. A bidirectional associative memory network, a Boltzman network, and an autoassociative back-propagation network have been investigated for the automatic recall process. None of them excel over computer programs in terms of recall accuracy.     

融合物品信息的社会化推荐算法

大多数社会化推荐算法仅考虑约束用户的特征向量并未限制物品的特征向量对推荐系统性能的影响,针对这一问题,提出了一种融合物品信息的社会化推荐算法。该算法先通过用户与物品的交互图构建物品相似性网络,在此基础上采用随机游走和SkipGram的方法构造出隐性物品相似性网络,再通过图神经网络的方法学习物品隐性相似性网络、社交网络和用户物品交互图,得到用户和物品编码的特征向量,最后在矩阵分解的基础上同时对用户和物品的特征向量做进一步约束,采用迭代更新的方式获取用户和物体最终的特征向量。为验证推荐算法的性能,在FilmTrust、Ciao和Douban数据集上进行实验验证。实验结果表明,所提出的ISGCF算法与经典的推荐算法相比,推荐效果更好,有效地缓解了冷启动问题。     

Volume quadric hologram-based associative memories

The class of associative memories based on volume nonlinearly recorded holograms is represented. It is shown that the quadratic nonlinearity of an amplitude response of a volume hologram recorded with a combined reference wave imparts to the hologram specific phase conjugate properties, which can be used for implementation of error-correcting auto- and heteroassociative memories. Within the quadric hologram approximation, we elaborate and demonstrate the architectures both for self-conjugate autoassociative reconstruction with a true tone rendering and for crosstalk-free heteroassociative reconstruction of complex optical singals accumulated at one carrier without interference.     

基于物品嵌入向量的会话型推荐算法

传统基于会话的推荐算法主要利用点击物品的时序信息进行建模,忽略了挖掘物品的特征信息,且未利用物品之间的相似性。为提升推荐效果,提出一种新的基于会话的推荐算法SR-I2V。通过Skip-gram模型和层次softmax优化方法学习物品的嵌入向量,由意图递进公式对已发生的物品点击提取出意图特征向量,并根据特征向量相似度计算出每个候选项的推荐分数。实验结果表明,与I2I、PoP和S-POP等传统基于会话的推荐算法相比,该算法在Yoochoose和Diginetica两个数据集上的推荐召回率分别提高了至少4.67个百分点和3.97个百分点,平均倒数排名指标也有相应提高。     

A Weighted Voting Model of Associative Memory

This paper presents an analysis of a random access memory (RAM)-based associative memory which uses a weighted voting scheme for information retrieval. This weighted voting memory can operate in heteroassociative or autoassociative mode, can store both real-valued and binary-valued patterns and, unlike memory models, is equipped with a rejection mechanism. A theoretical analysis of the performance of the weighted voting memory is given for the case of binary and random memory sets. Performance measures are derived as a function of the model parameters: pattern size, window size, and number of patterns in the memory set. It is shown that the weighted voting model has large capacity and error correction. The results show that the weighted voting model can successfully achieve high-detection and -identification rates and, simultaneously, low-false-acceptance rates     

关联项目增强的多兴趣序列推荐方法

现有基于多兴趣框架的序列推荐方法仅从用户近期交互序列中学习得到用户多兴趣表示,忽略了数据集中项目间的关联信息。针对这一问题,提出了一种关联项目增强的多兴趣序列推荐方法IAMIRec（item associations aware multi-interest sequential recommendation method）。首先通过数据集中用户交互序列计算得到项目关联集合和对应的项目关联矩阵,然后根据项目关联矩阵通过多头自注意力机制建模用户的近期交互序列,最后使用多兴趣框架学习得到用户的多个兴趣向量并进行top-N推荐。在三个数据集上对该方法进行了测试与分析,IAMIRec在recall、NDCG（normalized discounted cumulative gain）和hit rate指标上的表现均优于相关方法。实验结果说明 IAMIRec可以实现更优的推荐性能,也表明引入项目关联信息可以有效增强用户的多兴趣表示。     

Bipolar spectral associative memories

Nonlinear spectral associative memories are proposed as quantized frequency domain formulations of nonlinear, recurrent associative memories in which volatile network attractors are instantiated by attractor waves. In contrast to conventional associative memories, attractors encoded in the frequency domain by convolution may be viewed as volatile online inputs, rather than nonvolatile, off-line parameters. Spectral memories hold several advantages over conventional associative memories, including decoder/attractor separability and linear scalability, which make them especially well suited for digital communications. Bit patterns may be transmitted over a noisy channel in a spectral attractor and recovered at the receiver by recurrent, spectral decoding. Massive nonlocal connectivity is realized virtually, maintaining high symbol-to-bit ratios while scaling linearly with pattern dimension. For n-bit patterns, autoassociative memories achieve the highest noise immunity, whereas heteroassociative memories offer the added flexibility of achieving various code rates, or degrees of extrinsic redundancy. Due to linear scalability, high noise immunity and use of conventional building blocks, spectral associative memories hold much promise for achieving robust communication systems. Simulations are provided showing bit error rates for various degrees of decoding time, computational oversampling, and signal-to-noise ratio.     

A bidirectional heteroassociative memory for binary and grey-level patterns

Typical bidirectional associative memories (BAM) use an offline, one-shot learning rule, have poor memory storage capacity, are sensitive to noise, and are subject to spurious steady states during recall. Recent work on BAM has improved network performance in relation to noisy recall and the number of spurious attractors, but at the cost of an increase in BAM complexity. In all cases, the networks can only recall bipolar stimuli and, thus, are of limited use for grey-level pattern recall. In this paper, we introduce a new bidirectional heteroassociative memory model that uses a simple self-convergent iterative learning rule and a new nonlinear output function. As a result, the model can learn online without being subject to overlearning. Our simulation results show that this new model causes fewer spurious attractors when compared to others popular BAM networks, for a comparable performance in terms of tolerance to noise and storage capacity. In addition, the novel output function enables it to learn and recall grey-level patterns in a bidirectional way.     

Gray-scale morphological associative memories

Neural models of associative memories are usually concerned with the storage and the retrieval of binary or bipolar patterns. Thus far, the emphasis in research on morphological associative memory systems has been on binary models, although a number of notable features of autoassociative morphological memories (AMMs) such as optimal absolute storage capacity and one-step convergence have been shown to hold in the general, gray-scale setting. In this paper, we make extensive use of minimax algebra to analyze gray-scale autoassociative morphological memories. Specifically, we provide a complete characterization of the fixed points and basins of attractions which allows us to describe the storage and recall mechanisms of gray-scale AMMs. Computer simulations using gray-scale images illustrate our rigorous mathematical results on the storage capacity and the noise tolerance of gray-scale morphological associative memories (MAMs). Finally, we introduce a modified gray-scale AMM model that yields a fixed point which is closest to the input pattern with respect to the Chebyshev distance and show how gray-scale AMMs can be used as classifiers.     

时滞杂交双向联想记忆神经网络的全局指数稳定性

在近十几年里，已提出了一类与双向联想记忆相联系的神经网络模型，这些模型推广了单层自联想Hebbian相关器为两层异联想模式匹配器，因而，这类网络在模式识别、信号与图像处理等领域中有广阔的应用前景．研究了带离散时滞杂交双向联想记忆神经网络的收敛特性，利用Halanay型不等式获得了网络全局指数稳定性的充分条件，所得结果是与时滞无关的；已证明利用Halanay型不等式获得的结果改进了由Lyapunov方法获得的结果，而且获得的结果容易判定，并且给出了一个数值例子以说明所得结论的正确性．     

基于支持向量机和输出编码的文本分类器研究

介绍了一种支持向量机与输出编码相结合的文本分类器算法 ,采用一对多、一对一和纠错编码三种编码方式以及相似度计算的海明码距、边界损失方法进行文本分类和测试 ,表明一对多编码与边界损失相似度计算相结合的分类器系统具有最高的查全率和查准率。     

A neural network for visual pattern recognition

A model of a neural network is presented that offers insight into the brain's complex mechanisms as well as design principles for information processors. The model has properties and abilities that most modern computers and pattern recognizers do not possess; pattern recognition, selective attention, segmentation, and associative recall. When a composite stimulus consisting of two or more patterns is presented, the model pays selective attention to each of the patterns one after the other, segments a pattern from the rest, and recognizes it separately in contrast to earlier models. This model has perfect associative recall, even for deformed patterns, without regard to their positions. It can be trained to recognize any set of patterns     

融合社交信息的矩阵分解改进推荐算法

矩阵分解的推荐模型具有推荐精度高和易扩展等特点,已成为目前融合社交信息构建推荐系统的主要模型,但在分解过程中,用户偏好矩阵和物品特征矩阵初始赋值的随机性影响了推荐的性能,忽略了物品以及用户之间隐含的联系与区别。为此,提出一种基于社交信息的矩阵分解改进算法。将评分值分别与社交信息和物品的特征属性相结合,构建用户相似网络与物品相似网络,同时应用社区划分充分挖掘用户、物品之间的潜在关系,并按不同类型节点的近邻差异性,通过建立核心、非核心节点的偏好向量与特征向量得到矩阵分解初始矩阵。在公开数据集上的实验结果表明,该算法的推荐性能优于MF、SR2等同类型算法,运行迭代次数明显降低。     

基于模式关联的一对多联想记忆方法

在现有的多模块一对多联想记忆模型中,由于所处理的记忆模式集合本身的特点以及记忆模式之间的关联被忽视,使得构造出来的模型结构复杂,难以实际应用.针对这一不足,提出一种基于模式关联的实现方法.以该方法构造出的多模块一对多联想记忆模型结构简单,易于硬件实现,使得多模块一对多联想记忆模型具有了实际应用的可能.     

结合评分比例因子及项目属性的协同过滤算法

针对传统的协同过滤算法存在用户评分矩阵稀疏及未考虑项目属性之间关系的问题,提出了结合评分比例因子及项目属性的协同过滤算法。首先利用评分矩阵得出项目之间的共同与非共同评分用户数量比矩阵,以此增加项目共同评分用户的影响度,减少用户—项目评分矩阵的稀疏性对项目相似度计算带来的误差;然后对项目属性量化得出其对项目相似度的影响权重,提高项目相似度计算的准确性,根据以上两点提出了一种结合评分比例因子及项目属性权重作为项目相似度权重的算法。实验结果表明,该算法在召回率和准确率上相比现有的方法分别提高了5.1%和4.7%,适用于电商类网站的个性化推荐。