The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Manifold regularized discriminative feature selection for multi-label learning
Abstract
Abstract In multi-label learning, objects are essentially related to multiple semantic meanings, and the type of data is confronted with the impact of high feature dimensionality simultaneously, such as the bioinformatics and text mining applications. To tackle the learning problem, the key technology, i.e., feature selection, is developed to reduce dimensionality, whereas most of the previous methods for multi-label feature selection are either directly transformed from traditional single-label feature selection methods or half-baked in the label information exploitation, and thus causing the redundant or irrelevant features involved in the selected feature subset. Aimed to seek discriminative features across multiple class labels, we propose an embedded multi-label feature selection method with manifold regularization. To be specific, a low-dimensional embedding is constructed based on the original feature space to fit the label distribution for capturing the label correlations locally, which is also constrained using the label information in consideration of the co-occurrence relationships of label pairs. Following this principle, we design an optimization objective function involving l2,1-norm regularization to achieve multi-label feature selection, and the convergence is guaranteed. Empirical studies on various multi-label data sets reveal that the proposed method can obtain highly competitive performance against some state-of-the-art multi-label feature selection methods.
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
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Proceedings of the 24th international conference on Machine learning
(2007) · doi:10.1145/1273496 · Cited by 11,630
Peng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Proceedings of the 19th International Joint Conference on Artificial Intelligence
Pujol, J. M., Delgado, J., Ramon Sangüesa, A., & Flache, A. (2005) · International Joint Conference on Artificial Intelligence · Cited by 5,771
(2006) · Cited by 3,624
ML-KNN: A lazy learning approach to multi-label learning
Zhang, M.-L., & Zhou, Z.-H. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.12.019 · Cited by 3,552
A Review on Multi-Label Learning Algorithms
Zhang, M.-L., & Zhou, Z.-H. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.39 · Cited by 3,321
Face recognition using Laplacianfaces
He, X., Yan, S., Hu, Y., Niyogi, P., & Zhang, H.-J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.55 · Cited by 3,264
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442
Cited by
MLACO: A multi-label feature selection algorithm based on ant colony optimization
Paniri, M., Dowlatshahi, M. B., & Nezamabadi-pour, H. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.105285 · Cited by 285
Metadata
- Authors
- Zhang, J., Luo, Z., Li, C., Zhou, C., & Li, S.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2019-11
- Volume
- 95
- Pages
- 136-150
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2948768062
- Cited by
- 368
- References
- 41
- FWCI
- 13.93
- 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: Manifold regularized discriminative feature selection for multi-label learning. https://app.cochat.ai/papers/10.1016/j.patcog.2019.06.003
- The paper
- Zhang, J., Luo, Z., Li, C., Zhou, C., & Li, S. (2019). Manifold regularized discriminative feature selection for multi-label learning. Pattern Recognition. https://doi.org/10.1016/j.patcog.2019.06.003
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.