则可以有两个或两个以上的breakevenpoint.pptVIP

* * * * * * The user has a document in mind, and generates the query from this document. The equation represents the probability that the document that the user had in mind was in fact this one. * * * * * Relevance model other than query model, Query是它产生的small sample, relevant documents是它产生的大sample * equivalent to query-likelihood approach if simple empirical distribution used for query model More general risk minimization framework has been proposed Zhai and Lafferty 2001 * * * * * * * * * * * * * * * * 对于n阶矩阵A? 如果存在n阶矩阵B? 使得 AB?BA?E? 则称矩阵A是可逆的? 并称B为A的逆矩阵? 简称逆阵? * * * * * * * * * /seoptimiser-link-building.php f * Ambiguity and association in natural language * Goals of LSI Similar terms map to similar location in low dimensional space Noise reduction by dimension reduction * T ? maps terms into LSI space ?DT maps documents into LSI space * * minimize the Frobenius norm of the matrix difference X = W ? Wk IIR 18.15 * Similar terms map to similar location in low dimensional space Noise reduction by dimension reduction * Latent Semantic Analysis via SVD * * * * stop words are used uniformly throughout collection, so they tend to appear in the first dimension QUESTION: 我觉得是少了个括号（T?）-1 因为原矩阵S=T*Sigma*D?,现在有S，要求D，就必须左乘矩阵（T?）-1， 这样等式右侧就为D了。 ANSWER: you are right, 新文档空间的向量qn有： T*sigma*qn = q 所以 qn = inv(T*sigma)*q ? inv(T*sigma) = inv(sigma)*inv(T) = inv(sigma)* T 实际上sigma对对角阵，有sigma= sigma; (inv(sigma)) = inv(sigma) 对于svd分解的结果有T=inv(T), D= inv(D)? (you can check it out, i didnt search?proof yet) ? 事实上 qt*T*inv(sigma)? 就是 上面? (inv(sigma）* T * q) 是一样的，只是一个为行向量，一个为列向量。 ? q*T*inv(sigma)更好理解，是把一个q向量映射到新的空间中去， ? qt是1 x M 向量，每个元素是term, qt *　Ｔ得到１ｘＫ向量，这就通过Ｔ转换矩阵把ｔｅｒｍ向量转换到新的ｋ维空间中了， 最后乘上重要度inv(ｓｉｇｍａ)对角阵，完成最后的映射， * Try this in matlab: C=[1 0 1 0 0 0; 0 1 0 0 0 0 ; 1 1 0 0 0 0 ; 1 0 0 1 1 0; 0 0 0 1 0 1]; [t,s,d] = svd(C ); Got s is 5X6 matrix, d 6X6 matrix but rank is 5, the last column of s is all zero, just delete it. And delete last row of Dt now set low rank Ap