{ "id": "epcxeax55f", "slug": "multi-label-classification", "title": "Multi-label classification", "updated": "2026-10-15", "topic_path": [ { "id": "technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/topics/technology" }, { "id": "technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing" }, { "id": "technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai" }, { "id": "technology.computing.ai.ml_computation", "label": "Machine learning and neural computation", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.ml_computation" }, { "id": "technology.computing.ai.ml_methods", "label": "Machine learning methods", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.ml_methods" }, { "id": "technology.computing.ai.supervised_unsupervised", "label": "Supervised, unsupervised, and semi-supervised learning", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.supervised_unsupervised" }, { "id": "technology.computing.ai.supervised_unsupervised.supervised_concepts", "label": "Supervised learning concepts", "api_url": "https://www.edgepedia.org/api/v1/topics/technology.computing.ai.supervised_unsupervised.supervised_concepts" } ], "geo": [ { "id": "geo.nongeo.t1946.technology.computing.ai.supervised_unsupervised", "label": "Non-geographic · 1946 to 2000: Supervised, unsupervised, and semi-supervised learning", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.supervised_unsupervised", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t1946", "label": "Non-geographic · 1946 to 2000", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946" }, { "id": "geo.nongeo.t1946.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology" }, { "id": "geo.nongeo.t1946.technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing" }, { "id": "geo.nongeo.t1946.technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai" }, { "id": "geo.nongeo.t1946.technology.computing.ai.ml_computation", "label": "Machine learning and neural computation", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.ml_computation" }, { "id": "geo.nongeo.t1946.technology.computing.ai.ml_methods", "label": "Machine learning methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.ml_methods" }, { "id": "geo.nongeo.t1946.technology.computing.ai.supervised_unsupervised", "label": "Supervised, unsupervised, and semi-supervised learning", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.computing.ai.supervised_unsupervised" } ] }, { "id": "geo.nongeo.t2001.technology.computing.ai.supervised_unsupervised", "label": "Non-geographic · 2001 to 2020: Supervised, unsupervised, and semi-supervised learning", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.supervised_unsupervised", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t2001", "label": "Non-geographic · 2001 to 2020", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001" }, { "id": "geo.nongeo.t2001.technology", "label": "Technology and the built world", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology" }, { "id": "geo.nongeo.t2001.technology.computing", "label": "Computing and digital systems", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing" }, { "id": "geo.nongeo.t2001.technology.computing.ai", "label": "Artificial intelligence and data", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai" }, { "id": "geo.nongeo.t2001.technology.computing.ai.ml_computation", "label": "Machine learning and neural computation", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.ml_computation" }, { "id": "geo.nongeo.t2001.technology.computing.ai.ml_methods", "label": "Machine learning methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.ml_methods" }, { "id": "geo.nongeo.t2001.technology.computing.ai.supervised_unsupervised", "label": "Supervised, unsupervised, and semi-supervised learning", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t2001.technology.computing.ai.supervised_unsupervised" } ] } ], "excerpt": "Multi-label classification is a supervised machine learning task assigning each instance one or more labels at once, applied to text categorization, gene analysis, and search engines.", "snippet": "Multi-label classification is a supervised machine learning task assigning each instance one or more labels at once, applied to text categorization, gene analysis, and search engines.", "node": "technology.computing.ai.supervised_unsupervised.supervised_concepts", "markdown": "# Multi-label classification\n\nMulti-label classification is a supervised machine learning task in which each instance is assigned one or more labels simultaneously, formally learning a function \\( h: X \\rightarrow 2^{Y} \\) from a label space \\( Y \\) of \\( q \\) possible class labels.[1](https://doi.org/10.1109/tkde.2013.39) It differs from multi-class classification, where each example receives exactly one label, and from multi-target classification, where several targets each take one of several classes.[2](https://www.sciencedirect.com/science/article/pii/S0957417422005991) The task originated in text categorization, where a document may belong to several predefined topics at once[3](https://www.sciencedirect.com/science/article/abs/pii/S0031320307000027), and a central difficulty is that labels are correlated, so methods that model label dependence can outperform per-label approaches.[1](https://doi.org/10.1109/tkde.2013.39)\n\n| Key fact | Detail |\n|---|---|\n| Formal task | Learn \\( h: X \\rightarrow 2^{Y} \\) from examples each paired with a label set \\( Y_{i} \\subseteq Y \\)[1](https://doi.org/10.1109/tkde.2013.39) |\n| Output space size | For 20 labels, possible label sets exceed one million (\\( 2^{20} \\))[1](https://doi.org/10.1109/tkde.2013.39) |\n| Main strategy families | Problem transformation (binary relevance, classifier chains, label powerset) and algorithm adaptation (ML-kNN, Rank-SVM, BP-MLL)[4](https://people.iee.ihu.gr/~stoug/odep/papers/Multi-Label%20Classification:%20An%20Overview.pdf) |\n| Typical cardinality | Common benchmarks range from about 1 (birds) to about 4.4 (yeast 4.24, mediamill 4.38) and 3.4 to 3.5 (enron 3.38, corel5k 3.52); delicious (~19) and cal500 (~26) are unusually high rather than the only elevated cases[2](https://www.sciencedirect.com/science/article/pii/S0957417422005991) |\n| Extreme scale | Benchmarks run from Mediamill (101 labels, 30,993 training points) to WikiLSHTC-325K (325,056 labels) and Amazon-3M (~2.8 million labels)[5](http://manikvarma.org/downloads/XC/XMLRepository.html) • [6](https://papers.nips.cc/paper_files/paper/2022/file/0e0157ce5ea15831072be4744cbd5334-Supplemental-Conference.pdf) |\n| Tail imbalance | In Wiki-500K, 98% of labels have fewer than 100 training instances[7](https://arxiv.org/pdf/2302.05971) |\n\n## How it works\n\nA multi-label learner must map an input to a subset of \\( Y \\) rather than a single class. Because the output space is exponential in \\( q \\), the key challenge is exploiting structure: for even moderately many labels, the number of possible label sets already exceeds one million.[1](https://doi.org/10.1109/tkde.2013.39) [Correlation](https://www.edgepedia.org/correlation) exploitation is conventionally graded into first-order strategies that treat each label independently (binary relevance), second-order strategies that model pairwise relations (calibrated label ranking, Rank-SVM), and high-order strategies that model dependencies among arbitrary label subsets (classifier chains, random k-labelsets); higher order is more expressive but costlier.[1](https://doi.org/10.1109/tkde.2013.39)\n\nOutputs take two forms. Multi-label classification produces a bipartition of the label set, while label ranking produces an ordering; combining both is multi-label ranking.[8](http://lpis.csd.auth.gr/publications/tsoumakas09-dmkdh.pdf) In extreme settings, models typically output a ranking by relevance score, with exact labels selected by thresholding.[7](https://arxiv.org/pdf/2302.05971)\n\nEvaluation splits into example-based and label-based measures.[1](https://doi.org/10.1109/tkde.2013.39) Hamming loss is the fraction of labels whose relevance is incorrectly predicted; binary relevance is well tailored for minimizing it, whereas label powerset prediction, which returns the mode of the joint label distribution, is tailored for subset 0/1 loss and usually fails under Hamming loss.[9](https://link.springer.com/article/10.1007/s10994-012-5285-8) Classifiers optimized for subset accuracy perform poorly under Hamming loss, and vice versa, so multiple contrasting measures should be reported.[1](https://doi.org/10.1109/tkde.2013.39) • [10](http://jmread.github.io/talks/Tutorial-MLC-Porto.pdf) Label-based evaluation uses macro- and micro-averaged precision, recall, and F-measure.[8](http://lpis.csd.auth.gr/publications/tsoumakas09-dmkdh.pdf) Two dataset descriptors, label cardinality and label density, are related by \\( \\mathrm{LC}(D) = \\lvert L \\rvert \\cdot \\mathrm{LD}(D) \\).[4](https://people.iee.ihu.gr/~stoug/odep/papers/Multi-Label%20Classification:%20An%20Overview.pdf)\n\n## How it is done\n\nThe standard taxonomy, from the 2007 overview by Tsoumakas and Katakis, divides methods into problem transformation and algorithm adaptation.[4](https://people.iee.ihu.gr/~stoug/odep/papers/Multi-Label%20Classification:%20An%20Overview.pdf)\n\n**Problem transformation** recasts the task for off-the-shelf learners. Binary relevance learns \\( q \\) independent binary classifiers, one per label.[8](http://lpis.csd.auth.gr/publications/tsoumakas09-dmkdh.pdf) Classifier chains keep those \\( q \\) binary models but extend each one's attribute space with the 0/1 label relevances of all previous classifiers in a chain, recovering correlation modeling while retaining low time complexity; an ensemble with random chain orders (ECC) limits cost to be linear in the number of iterations.[11](https://doi.org/10.1007/s10994-011-5256-5) Label powerset treats each distinct label set as one atomic class of a single multi-class problem, with worst-case complexity exponential in \\( q \\)[11](https://doi.org/10.1007/s10994-011-5256-5); the pruned problem transformation (PPT) prunes label sets occurring fewer than a threshold times, and RAKEL builds an ensemble of label-powerset classifiers on small random label subsets.[8](http://lpis.csd.auth.gr/publications/tsoumakas09-dmkdh.pdf) Calibrated label ranking adds a virtual label as the breaking point between relevant and irrelevant labels.[8](http://lpis.csd.auth.gr/publications/tsoumakas09-dmkdh.pdf)\n\n**Algorithm adaptation** modifies a learning algorithm directly. ML-kNN, the first multi-label lazy learning algorithm, finds the \\( K \\) nearest neighbors of an instance and applies the maximum a posteriori principle to the membership counting statistic of the neighbors' label sets.[12](https://doi.org/10.1016/j.patcog.2006.12.019) BP-MLL is a [backpropagation neural network](https://www.edgepedia.org/backpropagation-neural-network) whose error function ranks labels belonging to an instance above those that do not.[13](https://dl.acm.org/doi/10.1109/TKDE.2006.162) Rank-SVM adapts support vector machines to ranking labels.[14](https://proceedings.neurips.cc/paper_files/paper/2001/file/39dcaf7a053dc372fbc391d4e6b5d693-Paper.pdf)\n\n## Origin\n\nEarly multi-label work centered on text categorization. BoosTexter, by Robert E. Schapire and Yoram Singer (2000, Machine Learning), provided multi-label adaptations of AdaBoost and was an important milestone for multi-label classification and ranking.[15](https://doi.org/10.1023/a:1007649029923) Elisseeff and Weston introduced Rank-SVM, a ranking-based SVM extension for multi-label problems, in 2002 ([MIT Press](https://www.edgepedia.org/mit-press)).[16](https://doi.org/10.7551/mitpress/1120.003.0092) The field-organizing surveys followed: Tsoumakas and Katakis's 2007 overview established the transformation/adaptation taxonomy[4](https://people.iee.ihu.gr/~stoug/odep/papers/Multi-Label%20Classification:%20An%20Overview.pdf), and the review by Min-Ling Zhang and Zhi-Hua Zhou in IEEE TKDE formalized the \\( h: X \\rightarrow 2^{Y} \\) definition and the correlation-order framework.[1](https://doi.org/10.1109/tkde.2013.39)\n\n## Variants\n\n**Extreme multi-label classification (XML)** annotates instances with relevant labels from extremely large candidate sets, where traditional methods such as ML-kNN, RAKEL, ECC, and binary relevance become infeasible.[17](https://ar5iv.labs.arxiv.org/html/2210.03968) XML methods fall into 1-vs-All, embedding-based, tree-based, and deep learning families.[18](https://doi.org/10.48550/arxiv.1811.01727) Tree methods include Parabel, which builds a binary balanced label tree over bag-of-words features, and FastXML, which directly optimizes an nDCG-based ranking loss and can be trained on problems with more than a million labels.[18](https://doi.org/10.48550/arxiv.1811.01727) • [19](https://psycnet.apa.org/doi/10.1145/2623330.2623651) MACH randomly merges \\( L \\) labels into \\( B \\) buckets (\\( B \\ll L \\)) with randomized [hash functions](https://www.edgepedia.org/hash-function) repeated \\( R = O(\\log L) \\) times.[7](https://arxiv.org/pdf/2302.05971) [Embedding](https://www.edgepedia.org/embedding) approaches include SLEEC, which learns local distance-preserving embeddings to predict infrequent tail labels[17](https://ar5iv.labs.arxiv.org/html/2210.03968); compressed sensing was applied to multi-label prediction by Daniel Hsu and colleagues in 2009.[20](https://doi.org/10.48550/arxiv.0902.1284) Deep methods include XML-CNN, a CNN with dynamic pooling that gives the same text representation to all labels[18](https://doi.org/10.48550/arxiv.1811.01727); AttentionXML, by Ronghui You and colleagues (2018), which combines multi-label attention over raw text with a shallow, wide probabilistic label tree handling millions of labels[18](https://doi.org/10.48550/arxiv.1811.01727); and LightXML (Jiang and colleagues, 2021) with dynamic negative sampling.[21](https://doi.org/10.48550/arxiv.2101.03305) Among the one-vs-all family, DiSMEC is a distributed, sparse linear one-vs-rest approach that scales to hundreds of thousands of labels.[22](https://doi.org/10.48550/arxiv.1609.02521)\n\n**Software and benchmarks.** Available frameworks include Mulan and MEKA (Java), scikit-learn (Python, with some multi-label support), Clus, and LAMDA.[10](http://jmread.github.io/talks/Tutorial-MLC-Porto.pdf) The Extreme Classification Repository publishes standard datasets and P@k leaderboards.[5](http://manikvarma.org/downloads/XC/XMLRepository.html)\n\n## Applications\n\nMulti-label methods are applied to text categorization, web page categorization, and gene functional analysis; ML-kNN was evaluated on yeast gene functional analysis, natural scene classification, and automatic web page categorization.[12](https://doi.org/10.1016/j.patcog.2006.12.019) BP-MLL was applied to functional genomics and text categorization[13](https://dl.acm.org/doi/10.1109/TKDE.2006.162), and Rank-SVM was tested on a yeast gene functional classification problem.[14](https://proceedings.neurips.cc/paper_files/paper/2001/file/39dcaf7a053dc372fbc391d4e6b5d693-Paper.pdf) Later applications include image annotation, bioinformatics, web mining, information retrieval, and tag recommendation.[1](https://doi.org/10.1109/tkde.2013.39) At extreme scale, XML underlies search engines and [recommender systems](https://www.edgepedia.org/recommender-system); PFastreXML outperformed the production system used in Bing Search.[17](https://ar5iv.labs.arxiv.org/html/2210.03968) • [23](https://arxiv.org/pdf/1803.01570)\n\n## Limitations and alternatives\n\n**Failure modes.** Binary relevance ignores label correlations entirely, and its per-label classifiers suffer class imbalance when \\( q \\) is large and label density is low, with training complexity \\( O(q \\cdot \\mathrm{FB}(m,d)) \\).[1](https://doi.org/10.1109/tkde.2013.39) Classifier chains are prohibitive for many-label datasets and depend on chain ordering[2](https://www.sciencedirect.com/science/article/pii/S0957417422005991); exact probabilistic classifier chains must examine all \\( 2^{L} \\) combinations, an upper limit of roughly 10 to 15 labels.[11](https://doi.org/10.1007/s10994-011-5256-5) Label powerset cannot predict novel label combinations and underfits when unique label sets are many; in the Enron dataset 44% of labelsets are unique, and in del.icio.us 98% are.[2](https://www.sciencedirect.com/science/article/pii/S0957417422005991) • [10](http://jmread.github.io/talks/Tutorial-MLC-Porto.pdf) Label frequencies follow a power-law or long-tailed distribution, with tail labels up to 80% of all labels, so a substantial proportion of labels have very few training instances.[24](https://raw.githubusercontent.com/ReproducibleAI/reproducibleai.github.io/refs/heads/main/xmlcnn.md) • [17](https://ar5iv.labs.arxiv.org/html/2210.03968)\n\n**Evaluation at scale.** Because each instance has very few relevant labels among a very large space, rank-based metrics (P@k, nDCG@k) dominate published comparisons, with propensity-scored variants (PSP@k, PSnDCG@k) correcting for missing labels.[5](http://manikvarma.org/downloads/XC/XMLRepository.html) • [24](https://raw.githubusercontent.com/ReproducibleAI/reproducibleai.github.io/refs/heads/main/xmlcnn.md)\n\n**Recent developments.** Since 2023, large language models have entered the task. ICXML, by Yaxin Zhu and Hamed Zamani (2023), is a two-stage zero-shot framework that generates a candidate label shortlist by in-context learning and then reranks it; on LF-WikiSeeAlso-320K it surpasses the best soft-matching baseline by 3.9% in P@1, though it underperforms at longer result lists.[25](https://aclanthology.org/2024.findings-naacl.134.pdf) Autoregressive LLMs doing multi-label classification tend to suppress all but one label at each generation step; taking the maximum probability over all label generation distributions instead of only the initial one improves both distribution alignment and F1 without extra computation.[26](https://aclanthology.org/2025.emnlp-main.126.pdf)\n\n## References\n\n1. [Min-Ling Zhang, Zhi-Hua Zhou (2013). A Review on Multi-Label Learning Algorithms. IEEE Transactions on Knowledge and Data Engineering.](https://doi.org/10.1109/tkde.2013.39)\n2. [Comprehensive comparative study of multi-label classification methods (Expert Systems with Applications, 2022)](https://www.sciencedirect.com/science/article/pii/S0957417422005991)\n3. [ML-kNN: A lazy learning approach to multi-label learning (Zhang & Zhou, Pattern Recognition 2007)](https://www.sciencedirect.com/science/article/abs/pii/S0031320307000027)\n4. [Multi-Label Classification: An Overview (Tsoumakas & Katakis 2007)](https://people.iee.ihu.gr/~stoug/odep/papers/Multi-Label%20Classification:%20An%20Overview.pdf)\n5. [The Extreme Classification Repository](http://manikvarma.org/downloads/XC/XMLRepository.html)\n6. [CascadeXML supplemental (NeurIPS 2022)](https://papers.nips.cc/paper_files/paper/2022/file/0e0157ce5ea15831072be4744cbd5334-Supplemental-Conference.pdf)\n7. [Review of Extreme Multi-label Classification](https://arxiv.org/pdf/2302.05971)\n8. [Mining Multi-label Data (Tsoumakas, Katakis, Vlahavas, Data Mining and Knowledge Discovery Handbook chapter)](http://lpis.csd.auth.gr/publications/tsoumakas09-dmkdh.pdf)\n9. [On label dependence and loss minimization in multi-label classification (Dembczyński, Waegeman, Cheng, Hüllermeier, Machine Learning 2012)](https://link.springer.com/article/10.1007/s10994-012-5285-8)\n10. [Multi-label Classification tutorial slides (Jesse Read, Porto)](http://jmread.github.io/talks/Tutorial-MLC-Porto.pdf)\n11. [Jesse Read and colleagues (2011). Classifier chains for multi-label classification. Machine Learning.](https://doi.org/10.1007/s10994-011-5256-5)\n12. [Min-Ling Zhang, Zhi-Hua Zhou (2007). ML-KNN: A lazy learning approach to multi-label learning. Pattern Recognition.](https://doi.org/10.1016/j.patcog.2006.12.019)\n13. [Multilabel Neural Networks with Applications to Functional Genomics and Text Categorization (BP-MLL, IEEE TKDE)](https://dl.acm.org/doi/10.1109/TKDE.2006.162)\n14. [A kernel method for multi-labelled classification (Elisseeff & Weston, NeurIPS 2001)](https://proceedings.neurips.cc/paper_files/paper/2001/file/39dcaf7a053dc372fbc391d4e6b5d693-Paper.pdf)\n15. [Robert E. Schapire, Yoram Singer (2000). BoosTexter: A Boosting-based System for Text Categorization. Machine Learning.](https://doi.org/10.1023/a:1007649029923)\n16. [Andre Elisseeff, Jason Weston (2002). A Kernel Method for Multi-Labelled Classification. The MIT Press eBooks.](https://doi.org/10.7551/mitpress/1120.003.0092)\n17. [A Survey on Extreme Multi-label Learning](https://ar5iv.labs.arxiv.org/html/2210.03968)\n18. [You, Ronghui and colleagues (2018). AttentionXML: Label Tree-based Attention-Aware Deep Model for High-Performance Extreme Multi-Label Text Classification. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.1811.01727)\n19. [FastXML: a fast, accurate and stable tree-classifier for extreme multi-label learning (Prabhu & Varma, KDD 2014)](https://psycnet.apa.org/doi/10.1145/2623330.2623651)\n20. [Hsu, Daniel and colleagues (2009). Multi-Label Prediction via Compressed Sensing. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.0902.1284)\n21. [Jiang, Ting and colleagues (2021). LightXML: Transformer with Dynamic Negative Sampling for High-Performance Extreme Multi-label Text Classification. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.2101.03305)\n22. [Babbar, Rohit, Shoelkopf, Bernhard (2016). DiSMEC - Distributed Sparse Machines for Extreme Multi-label Classification. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.1609.02521)\n23. [Data scarcity, robustness and extreme multi-label classification (PRoXML, NeurIPS version)](https://arxiv.org/pdf/1803.01570)\n24. [XML-CNN (Liu et al., Carnegie Mellon University), reproduced paper text](https://raw.githubusercontent.com/ReproducibleAI/reproducibleai.github.io/refs/heads/main/xmlcnn.md)\n25. [ICXML: An In-Context Learning Framework for Zero-Shot Extreme Multi-Label Classification (Findings of NAACL 2024)](https://aclanthology.org/2024.findings-naacl.134.pdf)\n26. [Large Language Models Do Multi-Label Classification Differently (EMNLP 2025)](https://aclanthology.org/2025.emnlp-main.126.pdf)\n\n---\n*Topic: Encyclopedia › Technology and the built world › Computing and digital systems › Artificial intelligence and data › Machine learning and neural computation › Machine learning methods › Supervised, unsupervised, and semi-supervised learning › Supervised learning concepts*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n", "same_as": [], "url": "https://www.edgepedia.org/multi-label-classification", "markdown_url": "https://www.edgepedia.org/multi-label-classification.md", "license": { "name": "Edgepedia Community License 1.0", "url": "https://www.edgepedia.org/edgepedia/license", "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.", "spdx": "LicenseRef-Edgepedia-Community-1.0" }, "credit": "\"Multi-label classification\", Edgepedia (EdgeChat), https://www.edgepedia.org/multi-label-classification. Edgepedia Community License 1.0.", "credit_md": "\"[Multi-label classification](https://www.edgepedia.org/multi-label-classification)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/multi-label-classification](https://www.edgepedia.org/multi-label-classification). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).", "credit_html": "\"Multi-label classification\", Edgepedia (EdgeChat), https://www.edgepedia.org/multi-label-classification. Edgepedia Community License 1.0.", "speakable": "Multi-label classification is a supervised machine learning task assigning each instance one or more labels at once, applied to text categorization, gene analysis, and search engines." }