why LIBSVM runs so slowly for 0/1-based feature matrix

1 次查看（过去 30 天）
liangjian
liangjian 2013-1-28
I am using Libsvm to perform text classification tasks. I normally uses binary occurrence, TF/IDF to build feature set for the input documents. It normally takes quite longer for Libsvm to finish training process when using binary occurrence. I doubt that the underlying solver of Libsvm has some difficulties to get converged for the 0/1 matrix resulted from the binary occurrence-based feature construction. Are there any reference or formal explanations on this kind of observation?

请先登录，再回答此问题。

回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Statistics and Machine Learning Toolbox 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by