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

1 visualizzazione (ultimi 30 giorni)
liangjian
liangjian il 28 Gen 2013
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?

Accedi per rispondere a questa domanda.

Risposte (0)

Categorie

Scopri di più su Statistics and Machine Learning Toolbox in Help Center e File Exchange

Tag

Community Treasure Hunt

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

Start Hunting!

Translated by