Name
Abstract | ||
|---|---|---|
The time complexity of support vector machines (SVMs) prohibits training on huge data sets with millions of samples. Recently, multilevel approaches to train SVMs have been developed to allow for time efficient training on huge data sets. While regular SVMs perform the entire training in one - time consuming - optimization step, multilevel SVMs first build a hierarchy of problems decreasing in size that resemble the original problem and then train an SVM model for each hierarchy level benefiting from the solved models of previous levels. We present a faster multilevel support vector machine that uses a label propagation algorithm to construct the problem hierarchy. Extensive experiments show that our new algorithm achieves speed-ups up to two orders of magnitude while having similar or better classification quality over state-of-the-art algorithms. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1137/1.9781611975499.16 | algorithm engineering and experimentation |
DocType | Volume | Citations |
Conference | abs/1808.06394 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastian Schlag | 1 | 38 | 5.18 |
| Matthias Schmitt | 2 | 0 | 0.34 |
| Christian Schulz | 3 | 240 | 24.10 |