# 机器学习::文本特征提取（TF-IDF） - 第一部分I

Read the first part of this tutorial:文本特征提取（TF-IDF） - 第一部分

This post is a延续of the first part where we started to learn the theory and practice about text feature extraction and vector space model representation. I really recommend you阅读第一部分of the post series in order to follow this second post.

### 介绍

In the first post, we learned how to use theterm-frequency以表示在矢量空间的文本信息。然而，与术语频率方法的主要问题是，它大大加快了频繁的条款和规模下降，这比高频方面经验更丰富罕见的条款。基本的直觉是，在许多文件中经常出现的一个术语不太好鉴别，真正有意义的（至少在许多实验测试）;这里最重要的问题是：你为什么会在例如分类问题，强调术语，是在你的文档的整个语料库几乎礼物？

The tf-idf weight comes to solve this problem. What tf-idf gives is how important is a word to a document in a collection, and that’s why tf-idf incorporates local and global parameters, because it takes in consideration not only the isolated term but also the term within the document collection. What tf-idf then does to solve that problem, is to scale down the frequent terms while scaling up the rare terms; a term that occurs 10 times more than another isn’t 10 times more important than it, that’s why tf-idf uses the logarithmic scale to do that.

But let’s go back to our definition of the$\ mathrm {TF}（T，d）$这实际上是长期的长期计数$t$在文档中$d$。使用这种简单的词频可能导致我们一样的问题keyword spamming，这是当我们有一个文档中的术语重复以改善上的IR其排名的目的（Information Retrieval）系统，甚至对创建长文档偏见，使他们看起来比他们只是因为手册中出现的高频更重要。

To overcome this problem, the term frequency$\ mathrm {TF}（T，d）$上的矢量空间中的文件的通常也归一化。让我们来看看我们是如何规范这一载体。

### 矢量归

D4：我们可以看到闪亮的阳光，明亮的阳光下。

And the vector space representation using the non-normalized term-frequency of that document was:

$\vec{v_{d_4}} = (0,2,1,0)$

$\ displaystyle \帽子{v} = \压裂vec {v}} {\ vec {v} {\ | \ \ |_p}$

Where the$\hat{v}$是单位矢量，或者归一化矢量，所述$\ VEC {V}$是个vector going to be normalized and the$\ | \ VEC {V} \ | _p$是矢量的范数（大小，长度）$\ VEC {V}$在里面$L ^ p$space (don’t worry, I’m going to explain it all).

### 勒贝格空间

$\|\vec{u}\| = \sqrt{u^2_1 + u^2_2 + u^2_3 + \ldots + u^2_n}$

$\displaystyle \|\vec{u}\|_p = ( \left|u_1\right|^p + \left|u_2\right|^p + \left|u_3\right|^p + \ldots + \left|u_n\right|^p )^\frac{1}{p}$

$\的DisplayStyle \ | \ VEC【U} \ | _p =（\总和\ limits_ {I = 1} ^ {N} \左| \ VEC {U】_i \右| ^ P）^ \压裂{1} {P}$

$\displaystyle \|\vec{u}\|_1 = ( \left|u_1\right| + \left|u_2\right| + \left|u_3\right| + \ldots + \left|u_n\right|)$

Taxicab geometry versus Euclidean distance: In taxicab geometry all three pictured lines have the same length (12) for the same route. In Euclidean geometry, the green line has length$6 \倍\ SQRT {2} \约8.48$，并且是唯一的最短路径。

Note that you can also use any norm to normalize the vector, but we’re going to use the most common norm, the L2-Norm, which is also the default in the 0.9 release of thescikits.learn。You can also find papers comparing the performance of the two approaches among other methods to normalize the document vector, actually you can use any other method, but you have to be concise, once you’ve used a norm, you have to use it for the whole process directly involving the norm (即所使用的L1范数的单位矢量是不会具有长度1，如果你要以后采取其L2范数）。

### Back to vector normalization

$\hat{v} = \frac{\vec{v}}{\|\vec{v}\|_p} \\ \\ \hat{v_{d_4}} = \frac{\vec{v_{d_4}}}{||\vec{v_{d_4}}||_2} \\ \\ \\ \hat{v_{d_4}} = \frac{(0,2,1,0)}{\sqrt{0^2 + 2^2 + 1^2 + 0^2}} \\ \\ \hat{v_{d_4}} = \frac{(0,2,1,0)}{\sqrt{5}} \\ \\ \small \hat{v_{d_4}} = (0.0, 0.89442719, 0.4472136, 0.0)$

Note that here we have normalized our term frequency document vector, but later we’re going to do that after the calculation of the tf-idf.

### 术语频率 - 逆文档频率（TF-IDF）重量

Train Document Set: d1: The sky is blue. d2: The sun is bright. Test Document Set: d3: The sun in the sky is bright. d4: We can see the shining sun, the bright sun.

Your document space can be defined then as$d = \ {D_1，D_2，\ ldots，D_N \}$where$n$是在你的文集文档的数量，并在我们的情况下，$D_ {火车} = \ {D_1，D_2 \}$$D_{test} = \{d_3, d_4\}$。The cardinality of our document space is defined by$\左| {{D_火车}} \右|= 2$$\左| {{D_测试}} \右|= 2$, since we have only 2 two documents for training and testing, but they obviously don’t need to have the same cardinality.

$\的DisplayStyle \ mathrm {IDF}（T）= \日志{\压裂{\左| d \右|} {1+ \左| \ {d：吨\在d \} \右|}}$

where$\左| \ {d：T \在d \} \右|$是个number of documentswhere the term$t$appears, when the term-frequency function satisfies$\ mathrm {TF}（T，d）\ 0 NEQ$, we’re only adding 1 into the formula to avoid zero-division.

The formula for the tf-idf is then:

$\mathrm{tf\mbox{-}idf}(t) = \mathrm{tf}(t, d) \times \mathrm{idf}(t)$

$M_ {}列车= \begin{bmatrix} 0 & 1 & 1 & 1\\ 0 & 2 & 1 & 0 \end{bmatrix}$

Since we have 4 features, we have to calculate$\ mathrm {IDF}（T_1）$,$\ mathrm {IDF}（T_2）$,$\ mathrm {IDF}（t_3处）$,$\ mathrm {IDF}（T_4）$:

$\ mathrm {IDF}（T_1）= \log{\frac{\left|D\right|}{1+\left|\{d : t_1 \in d\}\right|}} = \log{\frac{2}{1}} = 0.69314718$

$\ mathrm {IDF}（T_2）= \log{\frac{\left|D\right|}{1+\left|\{d : t_2 \in d\}\right|}} = \log{\frac{2}{3}} = -0.40546511$

$\ mathrm {IDF}（t_3处）= \日志{\压裂{\左| d \右|} {1+ \左| \ {d：t_3处\在d \} \右|}} = \日志{\压裂{2} {3}} = -0.40546511$

$\ mathrm {IDF}（T_4）= \日志{\压裂{\左| d \右|} {1+ \左| \ {d：T_4 \在d \} \右|}} = \日志{\压裂{2} {2}} = 0.0$

$\ {VEC {idf_列车}} =（0.69314718，-0.40546511，-0.40546511，0.0）$

$M_ {} IDF= \begin{bmatrix} 0.69314718 & 0 & 0 & 0\\ 0 & -0.40546511 & 0 & 0\\ 0 & 0 & -0.40546511 & 0\\ 0 & 0 & 0 & 0 \end{bmatrix}$

$M_ {TF \ MBOX { - } IDF} = M_ {火车} \倍M_ {IDF}$

Please note that the matrix multiplication isn’t commutative, the result of$A \times B$会比的结果不同$B \times A$，这就是为什么$M_ {} IDF$是对乘法的右侧，以完成每个IDF值到其对应的特征相乘的期望的效果：

${bmatrix} \ \开始mathrm {tf} (t_1 d_1) & \ mathrm {tf}(t_2, d_1) & \mathrm{tf}(t_3, d_1) & \mathrm{tf}(t_4, d_1)\\ \mathrm{tf}(t_1, d_2) & \mathrm{tf}(t_2, d_2) & \mathrm{tf}(t_3, d_2) & \mathrm{tf}(t_4, d_2) \end{bmatrix} \times \begin{bmatrix} \mathrm{idf}(t_1) & 0 & 0 & 0\\ 0 & \mathrm{idf}(t_2) & 0 & 0\\ 0 & 0 & \mathrm{idf}(t_3) & 0\\ 0 & 0 & 0 & \mathrm{idf}(t_4) \end{bmatrix} \\ = \begin{bmatrix} \mathrm{tf}(t_1, d_1) \times \mathrm{idf}(t_1) & \mathrm{tf}(t_2, d_1) \times \mathrm{idf}(t_2) & \mathrm{tf}(t_3, d_1) \times \mathrm{idf}(t_3) & \mathrm{tf}(t_4, d_1) \times \mathrm{idf}(t_4)\\ \mathrm{tf}(t_1, d_2) \times \mathrm{idf}(t_1) & \mathrm{tf}(t_2, d_2) \times \mathrm{idf}(t_2) & \mathrm{tf}(t_3, d_2) \times \mathrm{idf}(t_3) & \mathrm{tf}(t_4, d_2) \times \mathrm{idf}(t_4) \end{bmatrix}$

$M_ {TF \ MBOX { - } IDF} = M_ {火车} \倍M_ {IDF}= \\ \begin{bmatrix} 0 & 1 & 1 & 1\\ 0 & 2 & 1 & 0 \end{bmatrix} \times \begin{bmatrix} 0.69314718 & 0 & 0 & 0\\ 0 & -0.40546511 & 0 & 0\\ 0 & 0 & -0.40546511 & 0\\ 0 & 0 & 0 & 0 \end{bmatrix} \\ = \begin{bmatrix} 0 & -0.40546511 & -0.40546511 & 0\\ 0 & -0.81093022 & -0.40546511 & 0 \end{bmatrix}$

$M_{tf\mbox{-}idf} = \frac{M_{tf\mbox{-}idf}}{\|M_{tf\mbox{-}idf}\|_2}$ $= \begin{bmatrix} 0 & -0.70710678 & -0.70710678 & 0\\ 0 & -0.89442719 & -0.4472136 & 0 \end{bmatrix}$

### 蟒蛇practice

The first step is to create our training and testing document set and computing the term frequency matrix:

from sklearn.feature_extraction.text import CountVectorizer train_set = ("The sky is blue.", "The sun is bright.") test_set = ("The sun in the sky is bright.", "We can see the shining sun, the bright sun.") count_vectorizer = CountVectorizer() count_vectorizer.fit_transform(train_set) print "Vocabulary:", count_vectorizer.vocabulary # Vocabulary: {'blue': 0, 'sun': 1, 'bright': 2, 'sky': 3} freq_term_matrix = count_vectorizer.transform(test_set) print freq_term_matrix.todense() #[[0 1 1 1] #[0 2 1 0]]

从进口sklearn.feature_extraction.text TFIDF TfidfTransformer = TfidfTransformer（NORM = “L2”）tfidf.fit（freq_term_matrix）打印 “IDF：”，tfidf.idf_＃IDF：[0.69314718 -0.40546511 -0.40546511 0]

tf_idf_matrix = tfidf.transform（freq_term_matrix）打印tf_idf_matrix.todense（）＃[[0 -0.70710678 -0.70710678 0]＃[0 -0.89442719 -0.4472136 0]]

I really hope you liked the post, I tried to make it simple as possible even for people without the required mathematical background of linear algebra, etc. In the next Machine Learning post I’m expecting to show how you can use the tf-idf to calculate the cosine similarity.

If you liked it, feel free to comment and make suggestions, corrections, etc.

Cite this article as: Christian S. Perone, "Machine Learning :: Text feature extraction (tf-idf) – Part II," in亚洲金博宝未知领域，03/10/2011，//www.cpetem.com/2011/10/machine-learning-text-feature-extraction-tf-idf-part-ii/

### 参考

Sklearn text feature extraction code

### 更新

2015年3月13日格式化，固定图像的问题。
03 Oct 2011Added the info about the environment used for Python examples

## 103个想法“机器学习::文本特征提取（TF-IDF） - 第二部分”

1. Severtcev 说：

哇！
Perfect intro in tf-idf, thank you very much! Very interesting, I’ve wanted to study this field for a long time and you posts it is a real gift. It would be very interesting to read more about use-cases of the technique. And may be you’ll be interested, please, to shed some light on other methods of text corpus representation, if they exists?
（对不起，糟糕的英语，我正在努力对其进行改进，但仍然有很多工作要做的）

2. 出色的工作基督徒！我期待着阅读的文档分类你的下一个职位，聚类和主题提取朴素贝叶斯，随机梯度下降，Minibatch-K均值和非负矩阵分解

Also, the documentation of scikit-learn is really poor on the text feature extraction part (I am the main culprit…). Don’t hesitate to join the mailing list if you want to give a hand and improve upon the current situation.

1. Great thanks Olivier. I really want to help sklearn, I just have to get some more time to do that, you guys have done a great work, I’m really impressed by the amount of algorithms already implemented in the lib, keep the good work !

3. 我喜欢这个教程的新概念我在这里学习水平较好。
That said, which version of scikits-learn are you using?.
The latest as installed by easy_install seems to have a different module hierarchy (i.e doesn’t find feature_extraction in sklearn). If you could mention the version you used, i will just try out with those examples.

1. Hello Anand, I’m glad you liked it. I’ve added the information about the environment used just before the section “Python practice”, I’m using the scikits.learn 0.9 (released a few weeks ago).

4. siamii 说：

Where’s part 3? I’ve got to submit an assignment on Vector Space Modelling in 4 days. Any hope of putting it up over the weekend?

1. 我没有时间来发布它，因为我没有任何时间来写吧=（

5. 说：

谢谢again for this complete and explicit tutorial and I am waiting for the coming section.

6. 吴季刚 说：

谢谢克里斯tian! a very nice work on vector space with sklearn. I just have one question, suppose I have computed the ‘tf_idf_matrix’, and I would like to compute the pair-wise cosine similarity (between each rows). I was having problem with the sparse matrix format, can you please give an example on that? Also my matrix is pretty big, say 25k by 60k. Thanks a lot!

7. Khalid 说：

Great post… I understand what tf-idf and how to implement it with a concrete example. But I caught 2 things that I’m not sure about:
1-你调用2维矩阵M_train，但它具有D3和D4文件的TF值，所以你应该已经给那矩阵M_test而不是M_train。由于D3和D4是我们的测试文档。
2 - 当你计算IDF值的T2（这是“太阳”），它应该是日志（2/4）。因为文件的数目是2 D3有词“太阳” 1次，D4有它的2倍。这使得3，但是我们也加1到值摆脱0分的问题。这使得4 ...我说得对不对还是我失去了一些东西？
Thank you.

1. 维多利亚 说：

You are correct: these are excellent blog articles, but the author REALLY has a duty/responsibility to go back and correct errors, like this (and others, e.g. Part 1; …): missing training underscores; setting the stop_words parameter; also on my computer, the vocabulary indexing is different.

As much as we appreciate the effort (kudos to the author!), it is also a significant disservice to those who struggle past those (uncorrected) errors in the original material.

1. 维多利亚 说：

re: my ‘you are correct comment’ (above), I should have added:

“… noting also Frédérique Passot’s comment (below) regarding the denominator:

“......我们用的是什么确实是在发生的一个术语，无论任何给定的文档中出现的术语次数的文件数量。在这种情况下，然后，在用于T2（“太阳”）的IDF值分母确实2 + 1（2个文件具有“太阳”术语，1以避免潜在的零分割误差）。“

2. Yeshwant 说：

哈立德，
这是一个很古老的问题的答复。亚洲金博宝不过，我还是想回应沟通一下我从文章中了解。
你的问题2：“当你计算IDF值的T2（这是‘太阳’），它应该是日志（2/4）”
My understanding: The denominator in log term should be (number of documents in which the term appears + 1) and not frequency of the term. The number of documents the term “Sun” appears is 2 (1 time in D3 and 2 times in D4 — totally it appears 3 times in two documents. 3 is frequency and 2 is number of documents). Hence the denominator is 2 + 1 = 3.

8. arzu 说：

thanks… excellent post…

9. 插口 说：

优秀的帖子！
我有一些问题。从上个TF-IDF权重矩阵，我们怎么能拿到各自任期的重要性（例如，这是最重要的用语？）。我们如何利用这个矩阵文件进行分类

10. Thanuj 说：

Thank You So Much. You explained it in such a simple way. It was really useful. Once again thanks a lot.

11. Thanuj 说：

我有同样的疑问，杰克（最后的评论）。从上个TF-IDF权重矩阵，我们怎么能拿到各自任期的重要性（例如，这是最重要的用语？）。我们如何利用这个矩阵来区分文档。

12. tintin 说：

我有个问题..
After the tf-idf operation, we get a numpy array with values. Suppose we need to get the highest 50 values from the array. How can we do that?

1. 阿什温sudhini 说：

high value of f(idf) denotes that the particular vector(or Document) has high local strength and low global strength, in which case you can assume that the terms in it has high significance locally and cant be ignored. Comparing against funtion(tf) where only the term repeats high number of times are the ones given more importance,which most of the times is not a proper modelling technique.

13. 维克拉姆Bakhtiani 说：

Hey ,
感谢名单FR d code..was的确非亚洲金博宝常有帮助！

1.适用于文档聚类，计算反相的术语频率之后，shud我使用任何关联性系数等Jaccards系数，然后应用聚类算法中像k均值或shud我计算反转术语频率后直接适用d k均值到文档向量？

2.您是如何评价倒词频为calcuating文档向量文本聚类？

由于一吨FR第四到来的答复！

14. @Khalid: what you’re pointing out in 1- got me confused too for a minute (M_train vs M_test). I think you are mistaken on your second point, though, because what we are using is really the number of documents in which a term occurs, regardless of the number of times the term occurs in any given document. In this case, then, the denominator in the idf value for t2 (“sun”) is indeed 2+1 (2 documents have the term “sun”, +1 to avoid a potential zero division error).

I’d love to read the third installment of this series too! I’d be particularly interested in learning more about feature selection. Is there an idiomatic way to get a sorted list of the terms with the highest tf.idf scores? How would you identify those terms overall? How would you get the terms which are the most responsible for a high or low cosine similarity (row by row)?

谢谢你的帖子_美好的_！

1. Varghese表示邦妮 说：

Should idf(t2) be log 2/4 ?

15. Matthys Meintjes 说：

Excellent article and a great introduction to td-idf normalization.

你必须解释这些复杂的概亚洲金博宝念非常清晰，结构化的方法。

谢谢！

1. 感谢您的反馈Matthys，我很高兴你喜欢这个系列教程。

1. param 说：

亚洲金博宝很不错的＆infomative教程...。请相关的上传文档聚类过程更多的教程。

16. Laurent 说：

优秀的文章！谢谢基督徒。你做的非常出色。

17. 加文·伊戈尔 说：

Can you provide any reference for doing cosine similarity using tfidf so we have the matrix of tf-idf how can we use that to calculate cosine. Thanks for fantastic article.

18. 薰衣草 说：

非常感谢这和彻底解释整个TF-IDF的事情。

1. 感谢您的反馈，我很高兴你喜欢这个系列教程。

19. Please correct me if i’m worng
与启动后的公式“我们在第一个教程中计算出的频率：”应该不MTEST Mtrain。也开始“这些IDF权重可以由矢量作为表示后：”应该是不idf_test idf_train。

顺便说一句伟大的系列赛，你可以给如何实施分类的简单的方法？

20. 迪夫亚 说：

Excellent it really helped me get through the concept of VSM and tf-idf. Thanks Christian

21. 塞尔吉奥 说：

亚洲金博宝很不错的职位。恭喜！！

显示你的结果，我有个问题：

我读了维基百科：
The tf-idf value increases proportionally to the number of times a word appears in the document, but is offset by the frequency of the word in the corpus, which helps to control for the fact that some words are generally more common than others.

When I read it, I understand that if a word apperars in all documents is less important that a word that only appears in one document:

然而，在结果中，“太阳”或“明亮”是比“天空”最重要的。

I’m not sure of understand it completly.

22. 真棒！解释了TF-IDF非常好。亚洲金博宝热切等待你的下一个职位。

23. awesome work with a clear cut explanation . Even a layman can easily understand the subject..

1. 十分感谢您的反馈拉胡尔！

24. Susan 说：

了不起！我以前熟悉的TF-IDF，但我发现你scikits例子有益，因为我想学习那个包。

1. I’m glad you liked Susan, thanks for the feedback !

25. Thank you for writing such a detailed post. I learn allot.

26. Eugene Chinveeraphan 说：

优秀的帖子！一次偶然的机会找上CountVectorizer更多信息，无意中发现了这一点，但我很高兴我通过两个您的文章（第1部分和第2部分）的读取。

1. Great thanks for the feedback Eugene, I’m really glad you liked the tutorial series.

27. 说：

似乎没有fit_transform（）为你描述..
Any idea why ?
>>> ts
(‘The sky is blue’, ‘The sun is bright’)
>>> V7 = CountVectorizer（）
>>> v7.fit_transform（TS）
<2×2型的稀疏矩阵“”
with 4 stored elements in COOrdinate format>
>>>打印v7.vocabulary_
{u’is’: 0, u’the’: 1}

1. Ash 说：

Actually, there are two small errors in the first Python sample.
1. CountVectorizer should be instantiated like so:
count_vectorizer = CountVectorizer(stop_words='english')
这将确保“是”，“的”等被删除。

2.要打印的词汇，你必须在末尾添加下划线。
打印“词汇：” count_vectorizer.vocabulary_

优秀的教程，只是小事情。hoep它可以帮助别人。

1. 德罗戈 说：

谢谢ash. although the article was rather self explanatory, your comment made the entire difference.

28. 约翰·凯尔文 说：

我喜欢你的文章。

29. 我使用scikit学习v 0.14。有什么原因，我的结果运行完全相同的代码会导致不同的结果？

30. KARTHIK 说：

31. Vijay 说：

它的有用... ..thank你解释非常精心的TD_IDF ..亚洲金博宝

32. Mike 说：

感谢伟大的解释。

I have a question about calculation of the idf(t#).
In the first case, you wrote idf(t1) = log(2/1), because we don’t have such term in our collection, thus, we add 1 to the denominator. Now, in case t2, you wrote log(2/3), why the denominator is equal to 3 and not to 4 (=1+2+1)? In case t3, you write: log(2/3), thus the denominator is equal 3 (=1+1+1). I see here kind of inconsistency. Could you, please, explain, how did calculate the denominator value.

谢谢。

1. 您好迈克，感谢您的反馈意见。你说得对，我只是还没有固定它尚未由于缺乏时间来审查它，并重新计算值。

2. xpsycho 说：

你理解错了，分母你不把这个词的总和每个文档中，你只是总结所有具有词的至少一个aparition的文件。

3. mik 说：

yes, I had the same question…

33. huda 说：

这是一个好职位

34. huda 说：

这是很好的，如果你能提供的方式来知道如何使用FT-IDF中的文档分类。我看到示例（Python代码），但如果有算法是最好的，因为没有所有的人都能理解这种语言。

谢谢

35. Ganesh神 说：

伟大的职位，真正帮助我理解了TF-IDF的概念！

36. 塞缪尔·卡恩 说：

漂亮的文章

37. 尼斯。一种解释有助于正确看待这个事情。是TF-IDF的好办法做聚类（例如，从已知的语料用杰卡德分析或方差相对于平均值设定）？

Keep writing:)

38. 尼普雷姆 说：

Hi Christian,

这让我非常兴奋和幸运，读亚洲金博宝这篇文章。你理解的清晰反映了文件的清晰度。这让我重拾我的信心在机器学习领域。

谢谢a ton for the beautiful explanation.

想从你更多。

谢谢，
Neethu

1. Great thanks for the kind wors Neethu ! I’m very glad you liked the tutorial series.

39. esra'a ok 说：

thank you very very much,very wonderful and useful.

1. 感谢您的反馈Esra'a。

40. 阿恩 说：

Thank you for the good wrap up. You mention a number of papers which compare L1 and L2 norm, I plan to study that a bit more in depth. You still know their names?

41. seher 说：

how can i calculate tf idf for my own text file which is located some where in my pc?

42. Shubham 说：

辉煌的文章。

到目前为止TF-TDF的最简单，最完善的解释，我读过。我真的很喜欢你如何解释数学后面。

43. mehrab 说：

superb article for newbies

1. Dayananda 说：

优良的材质。优秀的！！！

44. 起重机 说：

嗨，伟大的职位！我使用的是TfidVectorizer模块scikit学习产生与规范= L2的TF-IDF矩阵。我把它叫做tfidf_matrix语料的fit_transform后，我一直在检查TfidfVectorizer的输出。我总结了行，但他们并不总和为1的代码是VECT = TfidfVectorizer（use_idf =真，sublunar_tf =真，规范=” L2）。tfidf_matrix = vect.fit_transform（数据）。当我运行tfidf_matrix.sum（轴= 1）的载体是大于1也许我看错矩阵或我误解如何正常化的作品。我希望有人能澄清这一点！谢谢

45. 克里斯 说：

我能问你的时候计算的IDF，例如日志（2/1），你用日志基地10（E）或其他一些价值？我得到不同的计算！

46. Gonzalo G 说：

伟大的教程，刚开始在ML一份新工作，这很清楚，因为它应该是解释的事情。亚洲金博宝

47. Harsimranpal 说：

但是，我需要更多的信息，当你展示实际使用python，你可以为它提供JAVA语言..

48. Sebastian 说：

我有点困惑，为什么TF-IDF在这种情况下，给出了负数？我们如何解读？纠正我，如果我错了，但是当载体为正值，这意味着该组件的大小确定字是该文件中有多么重要。如果是负数，我不知道如何解释它。如果我是采取向量的点积与所有积极的部件和一个负组件，这将意味着，一些部件可能负点积贡献，即使在载体有一个特定的词非常高的重视。亚洲金博宝

49. Hi,
非常感谢您对这个主题这个详细的解释，真是太好了。无论如何，你可以给我一个提示，这可能是我的错误，我不断看到的来源：

freq_term_matrix = count_vectorizer.transform（TEST_SET）
AttributeError的：“矩阵”对象没有属性“变换”

我使用sklearn的版本错误？

50. 莫希特古普塔 说：

Awesome simple and effective explaination.Please post more topics with such awesome explainations.Looking forward for upcoming articles.
谢谢

51. 亚历山德罗 说：

Thank you Chris, you are the only one on the web who was clear about the diagonal matrix.

52. ishpreet 说：

Great tutorial for Tf-Idf. Excellent work . Please add for cosine similarity also:)

53. sherlockatsz 说：

I understood the tf-idf calculation process. But what does that matrix mean and how can we use the tfidf matrix to calculate the similarity confuse me. can you explain that how can we use the tfidf matrix .thanks

54. lightningstrike 说：

THX为你的露骨和详细的解释。

55. Anonymous 说：

谢谢，nice post, I’m trying it out

56. Anonymous 说：

Thank you so much for such an amazing detailed explanation!

57. Akanksha潘德 说：

best explanation.. Very helpful. Can you please tell me how to plot vectors in text classification in svm.. I am working on tweets classification. I am confused please help me.

58. Koushik 说：

我学到了很多东西。由于基督教。期待你的下一个教程。

59. MHR 说：

Hi, I’m sorry if i have mistaken but i could not understand how is ||Vd4||2 = 1.
D4 =的值（0.0，0.89,0.44,0.0），因此归一化将是= SQRT（正方形（0.89）+平方（0.44））= SQRT（0.193）= 0.44

60. 李催情 说：

嗨，这是一个伟大的博客！
如果我需要做双克的情况下，我该如何使用sklearn来完成呢？

61. alireza 说：

it is very great. i love your teach. very very good

62. Ritesh 说：

我没有得到相同的结果，当我执行相同的脚本。
打印（“IDF：”，tfidf.idf_）：IDF：[2.09861229 1. 1.40546511 1]

My python version is: 3.5
Scikit了解的版本是：o.18.1

what does i need to change? what might be the possible error?

谢谢，

1. It can be many things, since you’re using a different Python interpreter version and also a different Scikit-Learn version, you should expect differences in the results since they may have changed default parameters, algorithms, rounding, etc.

1. Ravithej Chikkala 说：

我也越来越：IDF：2.09861229 1 1.40546511 1]

63. 胜利者 说：

完美的介绍！
没有骗人把戏。清晰简单的，随着技术的应。
亚洲金博宝很有帮助
非常感谢你。亚洲金博宝
Keep posting!

64. 亚太区首席技术官Matt南卡尼 说：

为什么| d |= 2，在IDF方程。它不应该是4，因为| d |代表的审议的文件数量，我们有2从测试，2个来自火车。

65. LÊ VĂN HẠNH 说：

这篇文章很有意思。我喜欢这个岗位？

66. 布伦 说：

clear cut and to the point explanations….great

67. Shipika Singh 说：

哎，HII基督教
您的文章是真正帮助我了解从基础TFD-IDF。我在分类的一个项目，其中我使用向量空间模型，这导致在确定类别在我的测试文档应该存在。机器学习的一部分。如果你认为我有关的东西这将是巨大的。我被困在这一点上。
thank you

68. Eshwar S G 说：

看到这个例子就知道如何使用它的文本分类过程。“这个”链接不起作用了。能否请您提供相关链接，例如。

谢谢

69. amanda 说：

这样一个伟大的解释！谢谢！

70. 另类投资 说：

wow, awesome post.Much thanks again. Will read on

71. Android应用下载PC 说：

也就是说，如果你有一个很好的post.Really谢谢！太棒了。

72. togel在线 说：

Wow, great article post.Much thanks again. Awesome.

73. Mobile Computer 说：

74. chocopie 说：

1vbXlh你提出了一个非常美妙的细节，欣赏它的职位。亚洲金博宝

75. 我知道这个网站提供基于高质量的文章或
reviews and additional data, is there any other web page which presents these kinds of
information in quality?

76. Rousse 说：

在第一个例子。IDF（T1），日志（2/1）由计算器= 0.3010。为什么他们获得0.69 ..请有什么不对？