Iterative TFIDF algorithm belongs to hill-climbing algorithm, it has the common problem of converging to local optimal value and sensitive to initial point.
迭代tfidf算法属于爬山算法，初始值的选取对精度影响较大，算法容易收敛到局部最优值。
Iterative TFIDF algorithm belongs to hill-climbing algorithm, it has the common problem of converging to local optimal value and sensitive to initial point.
迭代tfidf算法属于爬山算法，初始值的选取对精度影响较大，算法容易收敛到局部最优值。
应用推荐