- 博客(3)
- 资源 (12)
- 收藏
- 关注
RSS订阅原创 C++程序/项目内存泄漏检查（valgrind）
valgrind --tool=memcheck --leak-check=yes --show-reachable=yes --log-file=leak.log ./bin/main
2019-03-19 18:53:31
561
原创 makefile嵌套编译
这里用一个很很简单的别人的例子这里说明:项目目录如下：根目录makefileall: gbdt ffm-train ffm-predictgbdt: #编译 solvers/gbdt 目录下的makefile make -C solvers/gbdt ln -sf solvers/gbdt/gbdtffm-train: #编译 solvers/libffm-...
2019-03-09 18:19:05
463
原创 【语义相似度】基于词典的语义相似度算法调研
1、算法汇总2、数学原理：参考文献：[1]基于WordNet的语义相似性度量及其在查询推荐中的应用研究[2]基于熵的WordNet概念IC模型
2019-03-05 10:48:26
706
5
词向量-开山之作2_Distributed Representations of Sentences and Documents.pdf
Many machine learning algorithms require the
input to be represented as a fixed-length feature
vector. When it comes to texts, one of the most
common fixed-length features is bag-of-words.
Despite their popularity, bag-of-words features
have two major weaknesses: they lose the ordering of the words and they also ignore semantics
of the words. For example, “powerful,” “strong”
and “Paris” are equally distant. In this paper, we
propose Paragraph Vector, an unsupervised algorithm that learns fixed-length feature representations from variable-length pieces of texts, such as
sentences, paragraphs, and documents. Our algorithm represents each document by a dense vector which is trained to predict words in the document. Its construction gives our algorithm the
potential to overcome the weaknesses of bag-ofwords models. Empirical results show that Paragraph Vectors outperform bag-of-words models
as well as other techniques for text representations. Finally, we achieve new state-of-the-art results on several text classification and sentiment
analysis tasks
2019-07-29
词向量-开山之作1-Efficient estimation of word representations in vector space.pdf
词向量开山之作第一篇，讲述作者第一次提出词向量。在自然语言处理任务中，首先需要考虑词如何在计算机中表示。通常，有两种表示方式：one-hot representation和distribution representation。
2019-07-29
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人