Word Embeddings through Hellinger PCA 通过 Hellinger PCA 方法的词嵌入 Abstract Word embeddingsresulting from neural language models have been shown to be a great asset for alarge variety of NLP tasks. However, such architecture might be difficult andtime-consuming to ...
Toward a Paradigm Shift in Social Computing: The ACP Approach 实现社会计算的模式转换: ACP 方法 In a sense, socialcomputing is a new research field with a long history. Its origins trace backto the beginning of modern computing and landmark work such as Vannevar Bush’sM ...
Word Embedding Revisited: A New Representation Learning and ExplicitMatrix Factorization Perspective 重返词嵌入:一个新的表示学习和明确矩阵分解的角度 Recentlysignificant advances have been witnessed in the area of distributed wordrepresentations based on neural networks, w ...
Distributed Representations of Sentences and Documents 句子和文档的分布式表示 Abstract Many machinelearning algorithms require the input to be represented as a fixed-lengthfeature vector. When it comes to texts, one of the most common fixed-lengthfeatures is bag- ...
Don’t count, predict! A systematiccomparison of context-counting vs. context-predicting semantic vectors 别统计,预测!上下文统计 VS 上下文预测语义向量的一个系统地比较 Abstract Context-predictingmodels (more commonly known as embeddings or neural language models) are thenew kids on ...
Natural Language Processing (Almost) from Scratch ( Introduction ) Will a computer program ever be able to convert a piece of English textinto a programmer friendly data structure that describes the meaning of thenatural language text? Unfortunately, no consensus has emerged abo ...
A Unified Architecture for Natural Language Processing: Deep NeuralNetworks with Multitask Learning 一个自然语言处理的统一的架构:面向多种任务的深度神经网络 Abstract We describe asingle convolutional neural network architecture that, given a sentence,out ...
An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms 基于邻居的协同过滤的 设计选择 的一个实验分析 Abstract. Collaborative filtering systems predict a user’s interest in new items based on the recommendat ...
Algorithms for Graph Partitioning on the Planted Partition Model 植入性分割模型的图划分算法 ABSTRACT: The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cro ...