The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Binary tree of SVM: a new fast multiclass training and classification algorithm
Abstract
We present a new architecture named Binary Tree of support vector machine (SVM), or BTS, in order to achieve high classification efficiency for multiclass problems. BTS and its enhanced version, c-BTS, decrease the number of binary classifiers to the greatest extent without increasing the complexity of the original problem. In the training phase, BTS has N - 1 binary classifiers in the best situation (N is the number of classes), while it has log4/3 ((N + 3)/4) binary tests on average when making a decision. At the same time the upper bound of convergence complexity is determined. The experiments in this paper indicate that maintaining comparable accuracy, BTS is much faster to be trained than other methods. Especially in classification, due to its Log complexity, it is much faster than directed acyclic graph SVM (DAGSVM) and ECOC in problems that have big class number.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Solving Multiclass Learning Problems via Error-Correcting Output Codes
Dietterich, T. G., & Bakiri, G. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.105 · Cited by 2,739
Cited by
Galar, M., Fernández, A., Barrenechea, E., Bustince, H., & Herrera, F. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2011.01.017 · Cited by 764
Vieira, S., Pinaya, W. H. L., & Mechelli, A. (2017) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2017.01.002 · Cited by 656
Du, Y., Fu, Z., & Calhoun, V. D. (2018) · Frontiers in Neuroscience · doi:10.3389/fnins.2018.00525 · Cited by 332
Metadata
- Authors
- Fei, B., & Liu, J.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2006-05
- Volume
- 17
- Issue
- 3
- Pages
- 696-704
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2167139585
- Cited by
- 233
- References
- 1
- FWCI
- 9.19
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Binary tree of SVM: a new fast multiclass training and classification algorithm. https://app.cochat.ai/papers/10.1109/tnn.2006.872343
- The paper
- Fei, B., & Liu, J. (2006). Binary tree of SVM: a new fast multiclass training and classification algorithm. IEEE Transactions on Neural Networks. https://doi.org/10.1109/tnn.2006.872343
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.