Machine Learning :: Text feature extraction (tf-idf) – Part II

Read the first part of this tutorial:Text feature extraction (tf-idf) – Part I.

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.

Since a lot of people liked the first part of this tutorial, this second part is a little longer than the first.


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.

但是,让我们回到我们的定义\mathrm{tf}(t,d)which is actually the term count of the termtin the documentd. The use of this simple term frequency could lead us to problems likekeyword spamming, which is when we have a repeated term in a document with the purpose of improving its ranking on an IR (Information Retrieval)系统,甚至对创建长文档偏见,使他们看起来比他们只是因为手册中出现的高频更重要。

为了克服这个问题,词频\mathrm{tf}(t,d)of a document on a vector space is usually also normalized. Let’s see how we normalize this vector.

Vector normalization

Suppose we are going to normalize the term-frequency vector\vec{v_{d_4}}that we have calculated in the first part of this tutorial. The documentd4从本教程的第一部分中有这样的文字表示:

d4: We can see the shining sun, the bright sun.

和使用非向量空间表示normalized term-frequency of that document was:

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

To normalize the vector, is the same as calculating theUnit Vectorof the vector, and they are denoted using the “hat” notation:\hat{v}. The definition of the unit vector\hat{v}一个向量的\vec{v}is:

\的DisplayStyle \帽子{V} = \压裂{\ vec的{V}} {\ | \ vec的{V} \ | _p}

Where the\hat{v}is the unit vector, or the normalized vector, the\vec{v}is the vector going to be normalized and the\|\vec{v}\|_p是矢量的范数(大小,长度)\vec{v}in theL^p空间(别担心,我将解释它)。

The unit vector is actually nothing more than a normalized version of the vector, is a vector which the length is 1.

The normalization process (Source:
The normalization process (Source:

But the important question here is how the length of the vector is calculated and to understand this, you must understand the motivation of theL^p空间,也被称为Lebesgue spaces.

Lebesgue spaces


Usually, the length of a vector\vec{u} = (u_1, u_2, u_3, \ldots, u_n)is calculated using theEuclidean norma norm is a function that assigns a strictly positive length or size to all vectors in a vector space-, which is defined by:


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

但是,这不是定义长度的唯一途径,这就是为什么你看到(有时)的数p符合规范的符号,就像在了一起\|\vec{u}\|_p. That’s because it could be generalized as:

\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}

and simplified as:

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

所以,当你阅读有关L2-norm, you’re reading about theEuclidean norm,具有规范p = 2, the most common norm used to measure the length of a vector, typically called “magnitude”; actually, when you have an unqualified length measure (without thep号),你有L2-norm(Euclidean norm).

When you read about aL1-norm, you’re reading about the norm withp=1, defined as:

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

Which is nothing more than a simple sum of the components of the vector, also known as出租汽车距离, also called Manhattan distance.

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 length6 \times \sqrt{2} \approx 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 (a unit vector that used a L1-norm isn’t going to have the length 1 if you’re going to take its L2-norm later).


Now that you know what the vector normalization process is, we can try a concrete example, the process of using the L2-norm (we’ll use the right terms now) to normalize our vector\vec{v_{d_4}} = (0,2,1,0)in order to get its unit vector\hat{v_{d_4}}. To do that, we’ll simple plug it into the definition of the unit vector to evaluate it:

\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)

And that is it ! Our normalized vector\hat{v_{d_4}}has now a L2-norm\|\hat{v_{d_4}}\|_2 = 1.0.


术语频率 - 逆文档频率(TF-IDF)重量

Now you have understood how the vector normalization works in theory and practice, let’s continue our tutorial. Suppose you have the following documents in your collection (taken from the first part of tutorial):

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.

您的文档空间可以那么作为被定义D = \{ d_1, d_2, \ldots, d_n \}wherenis the number of documents in your corpus, and in our case asD_ {火车} = \ {D_1,D_2 \}andD_{test} = \{d_3, d_4\}. The cardinality of our document space is defined by\left|{D_{train}}\right| = 2and\左| {{D_测试}} \右|= 2,因为我们只有2两个用于训练和测试文档,但他们显然并不需要有相同的基数。

Let’s see now, how idf (inverse document frequency) is then defined:

\的DisplayStyle \ mathrm {IDF}(T)= \日志{\压裂{\左| d \右|} {1+ \左| \ {d:吨\在d \} \右|}}

where\left|\{d : t \in d\}\right|is thenumber of documentswhere the termtappears, when the term-frequency function satisfies\mathrm{tf}(t,d) \neq 0, 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)

and this formula has an important consequence: a high weight of the tf-idf calculation is reached when you have a high term frequency (tf) in the given document (local parameter) and a low document frequency of the term in the whole collection (global parameter).

Now let’s calculate the idf for each feature present in the feature matrix with the term frequency we have calculated in the first tutorial:

M_{train} =  \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) = \log{\frac{\left|D\right|}{1+\left|\{d : t_4 \in d\}\right|}} = \log{\frac{2}{2}} = 0.0

These idf weights can be represented by a vector as:

\vec{idf_{train}} = (0.69314718, -0.40546511, -0.40546511, 0.0)

Now that we have our matrix with the term frequency (M_{train}) and the vector representing the idf for each feature of our matrix (\vec{idf_{train}}), we can calculate our tf-idf weights. What we have to do is a simple multiplication of each column of the matrixM_{train}with the respective\vec{idf_{train}}vector dimension. To do that, we can create a squarediagonal matrixcalledM_{idf}with both the vertical and horizontal dimensions equal to the vector\vec{idf_{train}}尺寸:

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_{train} \times M_{idf}

Please note that the matrix multiplication isn’t commutative, the result ofA \times Bwill be different than the result of theB \times A, and this is why theM_{idf}is on the right side of the multiplication, to accomplish the desired effect of multiplying each idf value to its corresponding feature:

\begin{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}

Let’s see now a concrete example of this multiplication:

M_{tf\mbox{-}idf} = M_{train} \times 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}

最后,我们可以将我们的L2归一化处理的M_{tf\mbox{-}idf}矩阵。Please note that this normalization is“row-wise”因为我们要处理矩阵的每一行作为一个分离向量进行归一化,而不是矩阵作为一个整体:

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}

And that is our pretty normalized tf-idf weight of our testing document set, which is actually a collection of unit vectors. If you take the L2-norm of each row of the matrix, you’ll see that they all have a L2-norm of 1.

Python practice

Environment Used:Python v.2.7.2,NumPy的1.6.1,SciPy的v.0.9.0,Sklearn (Scikits.learn) v.0.9.

现在,你在等待的部分!在本节中,我将使用Python的使用,以显示TF-IDF计算的每一步Scikit.learnfeature extraction module.


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]]

Now that we have the frequency term matrix (calledfreq_term_matrix), we can instantiate theTfidfTransformer, which is going to be responsible to calculate the tf-idf weights for our term frequency matrix:

from sklearn.feature_extraction.text import TfidfTransformer tfidf = TfidfTransformer(norm="l2") print "IDF:", tfidf.idf_ # IDF: [ 0.69314718 -0.40546511 -0.40546511 0. ]

请注意,我所指定的标准为L2,这是可选的(实际上默认为L2范数),但我已经添加了参数,使其明确向你表示,它会使用L2范数。还要注意的是,你可以通过访问称为内部属性看IDF计算权重idf_. Now thatfit()method has calculated the idf for the matrix, let’s transform thefreq_term_matrixto the tf-idf weight matrix:

tf_idf_matrix = tfidf.transform(freq_term_matrix) print tf_idf_matrix.todense() # [[ 0. -0.70710678 -0.70710678 0. ] # [ 0. -0.89442719 -0.4472136 0. ]]

And that is it, thetf_idf_matrix其实我们以前M_{tf\mbox{-}idf}矩阵。您可以通过使用达到相同的效果VectorizerScikit的类。学习是一个vectorizer that automatically combines theCountVectorizerand theTfidfTransformer给你。看到this exampleto know how to use it for the text classification process.

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.


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



Wikipedia :: tf-idf


Sklearn text feature extraction code


13 Mar 2015Formating, fixed images issues.
03 Oct 2011Added the info about the environment used for Python examples

103 thoughts to “Machine Learning :: Text feature extraction (tf-idf) – Part II”

  1. Wow!
    (sorry for bad English, I’m working to improve it, but there is still a lot of job to do)

  2. Excellent work Christian! I am looking forward to reading your next posts on document classification, clustering and topics extraction with Naive Bayes, Stochastic Gradient Descent, Minibatch-k-Means and Non Negative Matrix factorization

    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. I like this tutorial better for the level of new concepts i am learning here.
    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. 您好阿南德,我很高兴你喜欢它。我已经增加了大约只用一节“的Python惯例”之前,我使用的是scikits.learn 0.9(发布在几个星期前)环境的信息。

  4. 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?

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

  6. 由于基督教! 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. 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- You called the 2 dimensional matrix M_train, but it has the tf values of the D3 and D4 documents, so you should’ve called that matrix M_test instead of M_train. Because D3 and D4 are our test documents.
    2 - 当你计算IDF值的T2(这是“太阳”),它应该是日志(2/4)。因为文件的数目是2 D3有词“太阳” 1次,D4有它的2倍。这使得3,但是我们也加1到值摆脱0分的问题。这使得4 ...我说得对不对还是我失去了一些东西?
    Thank you.

    1. 你是正确的:这些都是优秀的博客文章,但作者真的有责任/责任回去和纠正错误,这样的(和其他人,例如,第1部分; ...):缺席训练下划线;设置STOP_WORDS参数;还我的电脑上,词汇索引是不同的。


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

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

        ‘… 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).’ “

    2. Khalid,
      This is a response to a very old question. However, I still want to respond to communicate what I understand from the article.
      Your question 2: “When you calculate the idf value for the t2 (which is ‘sun’) it should be log(2/4)”
      我的理解:在数项的分母应该是(一些文件,其中术语出现+ 1),而不是长期的频率。术语“太阳”出现的文件的数目是2(1次在D3和D4中的2倍 - 完全出现3次在两个文件3是频率和2是文件号)。因此,分母为2 + 1 = 3。

  8. 优秀的帖子!
    I have some question. From the last tf-idf weight matrix, how can we get the importance of term respectively(e.g. which is the most important term?). How can we use this matrix to classify documents

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

  10. I have same doubt as Jack(last comment). From the last tf-idf weight matrix, how can we get the importance of term respectively(e.g. which is the most important term?). How can we use this matrix to classify documents.

  11. I have a question..
    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. 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.

  12. Hey ,
    Thanx fr d code..was very helpful indeed !

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

    2. How do u rate inverted term frequency for calcuating document vectors for document clustering ?

    谢谢a ton fr the forth coming reply!

  13. @Khalid:你在1-指出什么让我困惑过了一分钟(M_train VS M_test)。我想你误会了你的第二点,不过,因为我们用的是什么是真正发生的一个术语,无论任何给定的文档中出现的术语次数的文件数量。在这种情况下,那么,在为T2(“太阳”)的IDF值分母确实2 + 1(2个文件具有的术语“太阳”,1以避免潜在的零分割误差)。

    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)?


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

    You have a very clear and structured way of explaining these difficult concepts.


      1. very good & infomative tutorial…. please upload more tutorials related to documents clustering process.

  15. 您可以为使用TFIDF所以我们有TFIDF的矩阵,我们怎么可以用它来计算余弦做余弦相似度任何引用。感谢神奇的物品。

  16. 谢谢so much for this and for explaining the whole tf-idf thing thoroughly.

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

    Btw great series, can you give an simple approach for how to implement classification?

  18. Very good post. Congrats!!

    Showing your results, I have a question:

    I read in the wikipedia:
    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.


    However, in the results, the word “sun” or “bright” are most important than “sky”.

    I’m not sure of understand it completly.

  19. Terrific! I was familiar with tf-idf before but I found your scikits examples helpful as I’m trying to learn that package.

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

    Bookmarking your blog now

  21. 似乎没有fit_transform()为你描述..
    Any idea why ?
    >>> ts
    (‘The sky is blue’, ‘The sun is bright’)
    >>> V7 = CountVectorizer()
    >>> v7.fit_transform(ts)
    <2×2 sparse matrix of type '’
    with 4 stored elements in COOrdinate format>
    >>> print v7.vocabulary_
    {u’is’: 0, u’the’: 1}

    1. Actually, there are two small errors in the first Python sample.
      1. CountVectorizer应该被实例化,如下所示:
      count_vectorizer = CountVectorizer(stop_words='english')

      print "Vocabulary:", count_vectorizer.vocabulary_

      Excellent tutorial, just small things. hoep it helps others.

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

  22. 感谢伟大的解释。

    I have a question about calculation of the idf(t#).
    在第一种情况下,你写的IDF(T1)=日志(2/1),因为我们没有我们收集此类条款,因此,我们添加1分母。现在,在T2的情况下,你写的日志(2/3),所以分母等于3,而不是4(= 1 + 2 + 1)?万一t3时,你写:日志(2/3),从而分母等于3(= 1 + 1 + 1)。我在这里看到的那种不一致性。你能不能,请解释一下,你是怎么计算的分母值。


    1. You got it wrong, in the denominator you don’t put the sum of the term in each document, you just sum all the documents that have at least one aparition of the term.

  23. it is good if you can provide way to know how use ft-idf in classification of document. I see that example (python code) but if there is algorithm that is best because no all people can understand this language.


  24. Nice. An explanation helps put things into perspective. Is tf-idf a good way to do clustering (e.g. use Jaccard analysis or variance against the average set from a known corpus)?

    Keep writing:)

  25. Hi Christian,


    谢谢a ton for the beautiful explanation.

    Would like to read more from you.


  26. 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?

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

  28. Brilliant article.

    By far the easiest and most sound explanation of tf-tdf I’ve read. I really liked how you explained the mathematics behind it.

  29. 嗨,伟大的职位!我使用的是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也许我看错矩阵或我误解如何正常化的作品。我希望有人能澄清这一点!谢谢

  30. Can I ask when you calculated the IDF, for example, log(2/1), did you use log to base 10 (e) or some other value? I’m getting different calculations!

  31. 伟大的教程,刚开始一份新工作在毫升和this explains things very clearly as it should be.

  32. Execellent post….!!! Thanks alot for this article.

    But I need more information, As you show the practical with python, Can you provide it with JAVA language..

  33. 我有点困惑为什么tf-idf negative numbers in this case? How do we interpret them? Correct me if I am wrong, but when the vector has a positive value, it means that the magnitude of that component determines how important that word is in that document. If the it is negative, I don’t know how to interpret it. If I were to take the dot product of a vector with all positive components and one with negative components, it would mean that some components may contribute negatively to the dot product even though on of the vectors has very high importance for a particular word.

  34. 嗨,
    thank you so much for this detailed explanation on this topic, really great. Anyway, could you give me a hint what could be the source of my error that I am keep on seeing:

    freq_term_matrix = count_vectorizer.transform(TEST_SET)
    AttributeError: ‘matrix’ object has no attribute ‘transform’

    Am I using a wrong version of sklearn?

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

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

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

  38. 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

  39. 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.

  40. 嗨,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
    so what did i missed ? please help me to understand .

  41. 嗨,it is a great blog!
    If I need to do bi-gram cases, how can I use sklearn to finish it?

  42. I am not getting same result, when i am executing the same script.
    print (“IDF:”, tfidf.idf_) : IDF: [ 2.09861229 1. 1.40546511 1. ]

    My python version is: 3.5



    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.

  43. 完美的介绍!
    No hocus pocus. Clear and simple, as technology should be.
    Thank you very much.
    Keep posting!

  44. Why is |D| = 2, in the idf equation. Shouldn’t it be 4 since |D| denotes the number of documents considered, and we have 2 from test, 2 from train.

  45. hey , hii Christian
    thank you

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


  47. There is certainly a great deal to learn about this subject. I really like all the points you made.

  48. 1vbXlh You have brought up a very wonderful details , appreciate it for the post.

  49. I know this site provides quality based articles or
    reviews and additional data, is there any other web page which presents these kinds of

  50. In the first example. idf(t1), the log (2/1) = 0.3010 by the calculator. Why they obtained 0.69.. Please What is wrong?

Leave a Reply toKhalid取消回复

Your email address will not be published.

This site uses Akismet to reduce spam.Learn how your comment data is processed.