The DOI matches its Crossref record.
Task decomposition and module combination based on class relations: a modular neural network for pattern classification
Abstract
In this paper, we propose a new method for decomposing pattern classification problems based on the class relations among training data. By using this method, we can divide a K-class classification problem into a series of ((2)(K)) two-class problems. These two-class problems are to discriminate class Ci from class Cj for i=1, ..., K and j = i+1, while the existence of the training data belonging to the other K-2 classes is ignored. If the two-class problem of discriminating class Ci from class Cj is still hard to be learned, we can further break down it into a set of two-class subproblems as small as we expect. Since each of the two-class problems can be treated as a completely separate classification problem with the proposed learning framework, all of the two-class problems can be learned in parallel. We also propose two module combination principles which give practical guidelines in integrating individual trained network modules. After learning of each of the two-class problems with a network module, we can easily integrate all of the trained modules into a min-max modular (M3) network according to the module combination principles and obtain a solution to the original problem. Consequently, a large-scale and complex K-class classification problem can be solved effortlessly and efficiently by learning a series of smaller and simpler two-class problems in parallel.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Multilabel classification via calibrated label ranking
Fürnkranz, J., Hüllermeier, E., Loza Mencía, E., & Brinker, K. (2008) · Machine Learning · doi:10.1007/s10994-008-5064-8 · Cited by 909
Label ranking by learning pairwise preferences
Hüllermeier, E., Fürnkranz, J., Cheng, W., & Brinker, K. (2008) · Artificial Intelligence · doi:10.1016/j.artint.2008.08.002 · Cited by 536
A review of methods for imbalanced multi-label classification
Tarekegn, A. N., Giacobini, M., & Michalak, K. (2021) · Pattern Recognition · doi:10.1016/j.patcog.2021.107965 · Cited by 426
Series in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
Multi-class pattern classification using neural networks
Ou, G., & Murphey, Y. L. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.04.041 · Cited by 289
Metadata
- Authors
- Lu, B.-L., & Ito, M.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1999
- Volume
- 10
- Issue
- 5
- Pages
- 1244-1256
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2153382583
- Cited by
- 241
- References
- 0
- FWCI
- 8.54
- 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: Task decomposition and module combination based on class relations: a modular neural network for pattern classification. https://app.cochat.ai/papers/10.1109/72.788664
- The paper
- Lu, B.-L., & Ito, M. (1999). Task decomposition and module combination based on class relations: a modular neural network for pattern classification. IEEE Transactions on Neural Networks. https://doi.org/10.1109/72.788664
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.