Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing
Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing
复制标题
DOI：
--
复制
发表时间：
2006-04
期刊：
影响因子：
--
通讯作者：
G. Gorrell
中科院分区：
文献类型：
--
作者：
G. Gorrell
基于广义Hebbian算法的算法描述，允许奇异值分解的数据集学习的基础上提出的单观察对串行。该算法具有最小的内存需求，因此在自然语言领域很有趣，在那里经常使用非常大的数据集，数据集很快变得棘手。该技术被证明是学习单词和字母bigram对从文本的任务。
An algorithm based on the Generalized Hebbian Algorithm is described that allows the singular value decomposition of a dataset to be learned based on single observation pairs presented serially. The algorithm has minimal memory requirements, and is therefore interesting in the natural language domain, where very large datasets are often used, and datasets quickly become intractable. The technique is demonstrated on the task of learning word and letter bigram pairs from text.