Noisecut: a python package for noise-tolerant classification of binary data using prior knowledge integration and max-cut solutions
Background Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occu...
Saved in:
| Published in: | BMC bioinformatics Vol. 25; no. 1; pp. 155 - 19 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
London
BioMed Central
20.04.2024
BioMed Central Ltd Springer Nature B.V BMC |
| Subjects: | |
| ISSN: | 1471-2105, 1471-2105 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Background
Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occurs when a model learns random variations from noisy labels in training data rather than the underlying patterns. While traditional methods such as regularization and early stopping have demonstrated effectiveness in interpolation tasks, addressing overfitting in the classification of binary data, in which predictions always amount to extrapolation, demands extrapolation-enhanced strategies. One such approach is hybrid mechanistic/data-driven modeling, which integrates prior knowledge on input features into the learning process, enhancing the model’s ability to extrapolate.
Results
We present NoiseCut, a Python package for noise-tolerant classification of binary data by employing a hybrid modeling approach that leverages solutions of defined max-cut problems. In a comparative analysis conducted on synthetically generated binary datasets, NoiseCut exhibits better overfitting prevention compared to the early stopping technique employed by different supervised machine learning algorithms. The noise tolerance of NoiseCut stems from a dropout strategy that leverages prior knowledge of input features and is further enhanced by the integration of max-cut problems into the learning process.
Conclusions
NoiseCut is a Python package for the implementation of hybrid modeling for the classification of binary data. It facilitates the integration of mechanistic knowledge on the input features into learning from data in a structured manner and proves to be a valuable classification tool when the available training data is noisy and/or limited in size. This advantage is especially prominent in medical and biomedical applications where data scarcity and noise are common challenges. The codebase, illustrations, and documentation for NoiseCut are accessible for download at
https://pypi.org/project/noisecut/
. The implementation detailed in this paper corresponds to the version 0.2.1 release of the software. |
|---|---|
| AbstractList | Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occurs when a model learns random variations from noisy labels in training data rather than the underlying patterns. While traditional methods such as regularization and early stopping have demonstrated effectiveness in interpolation tasks, addressing overfitting in the classification of binary data, in which predictions always amount to extrapolation, demands extrapolation-enhanced strategies. One such approach is hybrid mechanistic/data-driven modeling, which integrates prior knowledge on input features into the learning process, enhancing the model's ability to extrapolate.BACKGROUNDClassification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occurs when a model learns random variations from noisy labels in training data rather than the underlying patterns. While traditional methods such as regularization and early stopping have demonstrated effectiveness in interpolation tasks, addressing overfitting in the classification of binary data, in which predictions always amount to extrapolation, demands extrapolation-enhanced strategies. One such approach is hybrid mechanistic/data-driven modeling, which integrates prior knowledge on input features into the learning process, enhancing the model's ability to extrapolate.We present NoiseCut, a Python package for noise-tolerant classification of binary data by employing a hybrid modeling approach that leverages solutions of defined max-cut problems. In a comparative analysis conducted on synthetically generated binary datasets, NoiseCut exhibits better overfitting prevention compared to the early stopping technique employed by different supervised machine learning algorithms. The noise tolerance of NoiseCut stems from a dropout strategy that leverages prior knowledge of input features and is further enhanced by the integration of max-cut problems into the learning process.RESULTSWe present NoiseCut, a Python package for noise-tolerant classification of binary data by employing a hybrid modeling approach that leverages solutions of defined max-cut problems. In a comparative analysis conducted on synthetically generated binary datasets, NoiseCut exhibits better overfitting prevention compared to the early stopping technique employed by different supervised machine learning algorithms. The noise tolerance of NoiseCut stems from a dropout strategy that leverages prior knowledge of input features and is further enhanced by the integration of max-cut problems into the learning process.NoiseCut is a Python package for the implementation of hybrid modeling for the classification of binary data. It facilitates the integration of mechanistic knowledge on the input features into learning from data in a structured manner and proves to be a valuable classification tool when the available training data is noisy and/or limited in size. This advantage is especially prominent in medical and biomedical applications where data scarcity and noise are common challenges. The codebase, illustrations, and documentation for NoiseCut are accessible for download at https://pypi.org/project/noisecut/ . The implementation detailed in this paper corresponds to the version 0.2.1 release of the software.CONCLUSIONSNoiseCut is a Python package for the implementation of hybrid modeling for the classification of binary data. It facilitates the integration of mechanistic knowledge on the input features into learning from data in a structured manner and proves to be a valuable classification tool when the available training data is noisy and/or limited in size. This advantage is especially prominent in medical and biomedical applications where data scarcity and noise are common challenges. The codebase, illustrations, and documentation for NoiseCut are accessible for download at https://pypi.org/project/noisecut/ . The implementation detailed in this paper corresponds to the version 0.2.1 release of the software. Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occurs when a model learns random variations from noisy labels in training data rather than the underlying patterns. While traditional methods such as regularization and early stopping have demonstrated effectiveness in interpolation tasks, addressing overfitting in the classification of binary data, in which predictions always amount to extrapolation, demands extrapolation-enhanced strategies. One such approach is hybrid mechanistic/data-driven modeling, which integrates prior knowledge on input features into the learning process, enhancing the model's ability to extrapolate. We present NoiseCut, a Python package for noise-tolerant classification of binary data by employing a hybrid modeling approach that leverages solutions of defined max-cut problems. In a comparative analysis conducted on synthetically generated binary datasets, NoiseCut exhibits better overfitting prevention compared to the early stopping technique employed by different supervised machine learning algorithms. The noise tolerance of NoiseCut stems from a dropout strategy that leverages prior knowledge of input features and is further enhanced by the integration of max-cut problems into the learning process. NoiseCut is a Python package for the implementation of hybrid modeling for the classification of binary data. It facilitates the integration of mechanistic knowledge on the input features into learning from data in a structured manner and proves to be a valuable classification tool when the available training data is noisy and/or limited in size. This advantage is especially prominent in medical and biomedical applications where data scarcity and noise are common challenges. The codebase, illustrations, and documentation for NoiseCut are accessible for download at https://pypi.org/project/noisecut/ . The implementation detailed in this paper corresponds to the version 0.2.1 release of the software. BackgroundClassification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occurs when a model learns random variations from noisy labels in training data rather than the underlying patterns. While traditional methods such as regularization and early stopping have demonstrated effectiveness in interpolation tasks, addressing overfitting in the classification of binary data, in which predictions always amount to extrapolation, demands extrapolation-enhanced strategies. One such approach is hybrid mechanistic/data-driven modeling, which integrates prior knowledge on input features into the learning process, enhancing the model’s ability to extrapolate.ResultsWe present NoiseCut, a Python package for noise-tolerant classification of binary data by employing a hybrid modeling approach that leverages solutions of defined max-cut problems. In a comparative analysis conducted on synthetically generated binary datasets, NoiseCut exhibits better overfitting prevention compared to the early stopping technique employed by different supervised machine learning algorithms. The noise tolerance of NoiseCut stems from a dropout strategy that leverages prior knowledge of input features and is further enhanced by the integration of max-cut problems into the learning process.ConclusionsNoiseCut is a Python package for the implementation of hybrid modeling for the classification of binary data. It facilitates the integration of mechanistic knowledge on the input features into learning from data in a structured manner and proves to be a valuable classification tool when the available training data is noisy and/or limited in size. This advantage is especially prominent in medical and biomedical applications where data scarcity and noise are common challenges. The codebase, illustrations, and documentation for NoiseCut are accessible for download at https://pypi.org/project/noisecut/. The implementation detailed in this paper corresponds to the version 0.2.1 release of the software. Abstract Background Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occurs when a model learns random variations from noisy labels in training data rather than the underlying patterns. While traditional methods such as regularization and early stopping have demonstrated effectiveness in interpolation tasks, addressing overfitting in the classification of binary data, in which predictions always amount to extrapolation, demands extrapolation-enhanced strategies. One such approach is hybrid mechanistic/data-driven modeling, which integrates prior knowledge on input features into the learning process, enhancing the model’s ability to extrapolate. Results We present NoiseCut, a Python package for noise-tolerant classification of binary data by employing a hybrid modeling approach that leverages solutions of defined max-cut problems. In a comparative analysis conducted on synthetically generated binary datasets, NoiseCut exhibits better overfitting prevention compared to the early stopping technique employed by different supervised machine learning algorithms. The noise tolerance of NoiseCut stems from a dropout strategy that leverages prior knowledge of input features and is further enhanced by the integration of max-cut problems into the learning process. Conclusions NoiseCut is a Python package for the implementation of hybrid modeling for the classification of binary data. It facilitates the integration of mechanistic knowledge on the input features into learning from data in a structured manner and proves to be a valuable classification tool when the available training data is noisy and/or limited in size. This advantage is especially prominent in medical and biomedical applications where data scarcity and noise are common challenges. The codebase, illustrations, and documentation for NoiseCut are accessible for download at https://pypi.org/project/noisecut/ . The implementation detailed in this paper corresponds to the version 0.2.1 release of the software. Background Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occurs when a model learns random variations from noisy labels in training data rather than the underlying patterns. While traditional methods such as regularization and early stopping have demonstrated effectiveness in interpolation tasks, addressing overfitting in the classification of binary data, in which predictions always amount to extrapolation, demands extrapolation-enhanced strategies. One such approach is hybrid mechanistic/data-driven modeling, which integrates prior knowledge on input features into the learning process, enhancing the model’s ability to extrapolate. Results We present NoiseCut, a Python package for noise-tolerant classification of binary data by employing a hybrid modeling approach that leverages solutions of defined max-cut problems. In a comparative analysis conducted on synthetically generated binary datasets, NoiseCut exhibits better overfitting prevention compared to the early stopping technique employed by different supervised machine learning algorithms. The noise tolerance of NoiseCut stems from a dropout strategy that leverages prior knowledge of input features and is further enhanced by the integration of max-cut problems into the learning process. Conclusions NoiseCut is a Python package for the implementation of hybrid modeling for the classification of binary data. It facilitates the integration of mechanistic knowledge on the input features into learning from data in a structured manner and proves to be a valuable classification tool when the available training data is noisy and/or limited in size. This advantage is especially prominent in medical and biomedical applications where data scarcity and noise are common challenges. The codebase, illustrations, and documentation for NoiseCut are accessible for download at https://pypi.org/project/noisecut/ . The implementation detailed in this paper corresponds to the version 0.2.1 release of the software. Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occurs when a model learns random variations from noisy labels in training data rather than the underlying patterns. While traditional methods such as regularization and early stopping have demonstrated effectiveness in interpolation tasks, addressing overfitting in the classification of binary data, in which predictions always amount to extrapolation, demands extrapolation-enhanced strategies. One such approach is hybrid mechanistic/data-driven modeling, which integrates prior knowledge on input features into the learning process, enhancing the model's ability to extrapolate. We present NoiseCut, a Python package for noise-tolerant classification of binary data by employing a hybrid modeling approach that leverages solutions of defined max-cut problems. In a comparative analysis conducted on synthetically generated binary datasets, NoiseCut exhibits better overfitting prevention compared to the early stopping technique employed by different supervised machine learning algorithms. The noise tolerance of NoiseCut stems from a dropout strategy that leverages prior knowledge of input features and is further enhanced by the integration of max-cut problems into the learning process. NoiseCut is a Python package for the implementation of hybrid modeling for the classification of binary data. It facilitates the integration of mechanistic knowledge on the input features into learning from data in a structured manner and proves to be a valuable classification tool when the available training data is noisy and/or limited in size. This advantage is especially prominent in medical and biomedical applications where data scarcity and noise are common challenges. The codebase, illustrations, and documentation for NoiseCut are accessible for download at https://pypi.org/project/noisecut/. The implementation detailed in this paper corresponds to the version 0.2.1 release of the software. Background Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical challenges in data classification using machine learning is to avoid overfitting. Overfitting in supervised learning primarily occurs when a model learns random variations from noisy labels in training data rather than the underlying patterns. While traditional methods such as regularization and early stopping have demonstrated effectiveness in interpolation tasks, addressing overfitting in the classification of binary data, in which predictions always amount to extrapolation, demands extrapolation-enhanced strategies. One such approach is hybrid mechanistic/data-driven modeling, which integrates prior knowledge on input features into the learning process, enhancing the model's ability to extrapolate. Results We present NoiseCut, a Python package for noise-tolerant classification of binary data by employing a hybrid modeling approach that leverages solutions of defined max-cut problems. In a comparative analysis conducted on synthetically generated binary datasets, NoiseCut exhibits better overfitting prevention compared to the early stopping technique employed by different supervised machine learning algorithms. The noise tolerance of NoiseCut stems from a dropout strategy that leverages prior knowledge of input features and is further enhanced by the integration of max-cut problems into the learning process. Conclusions NoiseCut is a Python package for the implementation of hybrid modeling for the classification of binary data. It facilitates the integration of mechanistic knowledge on the input features into learning from data in a structured manner and proves to be a valuable classification tool when the available training data is noisy and/or limited in size. This advantage is especially prominent in medical and biomedical applications where data scarcity and noise are common challenges. The codebase, illustrations, and documentation for NoiseCut are accessible for download at Keywords: Hybrid mechanistic/data-driven modeling, Binary data, Overfitting, Max-cut problem, Noise-tolerant classification |
| ArticleNumber | 155 |
| Audience | Academic |
| Author | Mitsos, Alexander Mirzaieazar, Hedieh Schuppert, Andreas Samadi, Moein E. |
| Author_xml | – sequence: 1 givenname: Moein E. surname: Samadi fullname: Samadi, Moein E. organization: Institute for Computational Biomedicine, RWTH Aachen University – sequence: 2 givenname: Hedieh surname: Mirzaieazar fullname: Mirzaieazar, Hedieh organization: Institute for Computational Biomedicine, RWTH Aachen University – sequence: 3 givenname: Alexander surname: Mitsos fullname: Mitsos, Alexander organization: Process Systems Engineering (AVT.SVT), RWTH Aachen University – sequence: 4 givenname: Andreas surname: Schuppert fullname: Schuppert, Andreas email: aschuppert@ukaachen.de organization: Institute for Computational Biomedicine, RWTH Aachen University |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/38641616$$D View this record in MEDLINE/PubMed |
| BookMark | eNp9kktv1DAUhSNURB_wB1ggS2xgkWI7juOwqyoeI1Ug8VhbN44dPE3swXZEu-aP45m0lKlQlYWjm-8cn9jnuDhw3umieE7wKSGCv4mEirotMWUlrhveluJRcURYQ0pKcH3wz_thcRzjGmPSCFw_KQ4rwRnhhB8Vvz95G7Wa01sEaHOdfniHNqAuYdDI-IDc9nOZ_KgDuITUCDFaYxUkm0lvUGcdhGvUQwI0R-sGtAk2Cy-d_zXqPttYl_QQFgG4Hk1wVeYNUfTjvB3Gp8VjA2PUz27Wk-L7-3ffzj-WF58_rM7PLkpVC55KRruuphiUAtz1rOGKVIJ2RhNQoKkAolUvWqqbCjeqwQpqwgUxVWsMr7WqTorV4tt7WMscc8rJpQcrdwMfBgkhWTVqSTEBZhhratWyyjQtIS3jPeVQdUrXOHu9Wrw2wf-cdUxyslHpcQSn_RxlhVlOwQklGX15D137Obj8p5mqGWEVFeyOGiDvb53xKYDamsqzpsWCCdFuvU7_Q-Wn15NVuR7G5vme4PWeIDNJX6UB5hjl6uuXffbFTdC5m3T_94Ru25IBsQAq-BiDNlLZtLvYnMKOkmC5LaZciilzMeWumFJkKb0nvXV_UFQtophhN-hwd3IPqP4AhHP0Kw |
| CitedBy_id | crossref_primary_10_1038_s41598_025_02181_x crossref_primary_10_37943_22SNOK5872 |
| Cites_doi | 10.1089/cmb.2017.0023 10.1002/aic.690381003 10.1145/2939672.2939785 10.1023/A:1010933404324 10.1007/s10957-018-1396-0 10.1023/A:1009656525752 10.1093/biomet/73.1.13 10.1016/j.compchemeng.2013.08.008 10.1371/journal.pone.0274569 10.1002/(SICI)1097-0258(19990715)18:13<1707::AID-SIM138>3.0.CO;2-H 10.1002/cite.201800091 10.1016/j.apm.2009.07.014 10.1109/72.623200 10.21136/CMJ.1973.101168 10.1142/9789812792617_0218 10.1145/227683.227684 10.1371/journal.pone.0225715 10.1007/BF00994018 10.1007/s11128-012-0506-4 10.2307/2531989 10.1002/aic.690400806 10.1016/j.compchemeng.2022.107736 10.1016/j.jbi.2019.103360 10.1093/imamat/hxn011 10.25080/Majora-92bf1922-00a 10.1186/2190-5983-1-1 10.1145/234533.234534 10.1109/FUZZ-IEEE.2015.7337889 10.1038/s41592-018-0019-x 10.21203/rs.3.rs-3236927/v1 10.1109/TNNLS.2022.3152527 10.1038/nature14539 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2024 2024. The Author(s). COPYRIGHT 2024 BioMed Central Ltd. 2024. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2024 – notice: 2024. The Author(s). – notice: COPYRIGHT 2024 BioMed Central Ltd. – notice: 2024. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION NPM ISR 3V. 7QO 7SC 7X7 7XB 88E 8AL 8AO 8FD 8FE 8FG 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA ARAPS AZQEC BBNVY BENPR BGLVJ BHPHI CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ HCIFZ JQ2 K7- K9. L7M LK8 L~C L~D M0N M0S M1P M7P P5Z P62 P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS Q9U 7X8 DOA |
| DOI | 10.1186/s12859-024-05769-8 |
| DatabaseName | Springer Nature OA Free Journals CrossRef PubMed Gale In Context: Science ProQuest Central (Corporate) Biotechnology Research Abstracts Computer and Information Systems Abstracts Health & Medical Collection (Proquest) ProQuest Central (purchase pre-March 2016) Medical Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection ProQuest Hospital Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest One Sustainability ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials Biological Science Collection ProQuest Central Technology collection Natural Science Collection ProQuest One Community College ProQuest Central Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database (ProQuest) ProQuest Health & Medical Complete (Alumni) Advanced Technologies Database with Aerospace Biological Sciences Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database ProQuest Health & Medical Collection Medical Database Biological Science Database ProQuest advanced technologies & aerospace journals ProQuest Advanced Technologies & Aerospace Collection Biotechnology and BioEngineering Abstracts ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic MEDLINE - Academic DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed Publicly Available Content Database Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ProQuest One Applied & Life Sciences ProQuest One Sustainability Health Research Premium Collection Natural Science Collection Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Advanced Technologies & Aerospace Collection ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts ProQuest Health & Medical Complete ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Pharma Collection ProQuest Central ProQuest Health & Medical Research Collection Biotechnology Research Abstracts Health and Medicine Complete (Alumni Edition) ProQuest Central Korea Advanced Technologies Database with Aerospace ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Medical Library ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic PubMed Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 1471-2105 |
| EndPage | 19 |
| ExternalDocumentID | oai_doaj_org_article_201a4f4475c943f7911946d26a3bce50 A790848891 38641616 10_1186_s12859_024_05769_8 |
| Genre | Journal Article |
| GeographicLocations | Germany |
| GeographicLocations_xml | – name: Germany |
| GrantInformation_xml | – fundername: Universitätsklinikum RWTH Aachen (8915) – fundername: Helmholtz Association funderid: http://dx.doi.org/10.13039/501100009318 |
| GroupedDBID | --- 0R~ 23N 2WC 53G 5VS 6J9 7X7 88E 8AO 8FE 8FG 8FH 8FI 8FJ AAFWJ AAJSJ AAKPC AASML ABDBF ABUWG ACGFO ACGFS ACIHN ACIWK ACPRK ACUHS ADBBV ADMLS ADUKV AEAQA AENEX AEUYN AFKRA AFPKN AFRAH AHBYD AHMBA AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS ARAPS AZQEC BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BGLVJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK DU5 DWQXO E3Z EAD EAP EAS EBD EBLON EBS EMB EMK EMOBN ESX F5P FYUFA GNUQQ GROUPED_DOAJ GX1 HCIFZ HMCUK HYE IAO ICD IHR INH INR ISR ITC K6V K7- KQ8 LK8 M1P M48 M7P MK~ ML0 M~E O5R O5S OK1 OVT P2P P62 PGMZT PHGZM PHGZT PIMPY PJZUB PPXIY PQGLB PQQKQ PROAC PSQYO PUEGO RBZ RNS ROL RPM RSV SBL SOJ SV3 TR2 TUS UKHRP W2D WOQ WOW XH6 XSB AAYXX AFFHD CITATION ALIPV NPM 3V. 7QO 7SC 7XB 8AL 8FD 8FK FR3 JQ2 K9. L7M L~C L~D M0N P64 PKEHL PQEST PQUKI PRINS Q9U 7X8 |
| ID | FETCH-LOGICAL-c586t-42bb520acca0bd476c1382bfe1acae28a1ecd892e7307c70ca51681f39ff65ec3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001205277600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1471-2105 |
| IngestDate | Fri Oct 03 12:43:45 EDT 2025 Wed Oct 01 14:02:35 EDT 2025 Tue Oct 07 05:31:32 EDT 2025 Tue Nov 11 11:04:12 EST 2025 Tue Nov 04 18:21:12 EST 2025 Wed Nov 26 11:28:23 EST 2025 Mon Jul 21 06:03:41 EDT 2025 Sat Nov 29 05:40:16 EST 2025 Tue Nov 18 22:31:39 EST 2025 Sat Sep 06 07:27:28 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Binary data Noise-tolerant classification Hybrid mechanistic/data-driven modeling Max-cut problem Overfitting |
| Language | English |
| License | 2024. The Author(s). |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c586t-42bb520acca0bd476c1382bfe1acae28a1ecd892e7307c70ca51681f39ff65ec3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | https://doaj.org/article/201a4f4475c943f7911946d26a3bce50 |
| PMID | 38641616 |
| PQID | 3054143284 |
| PQPubID | 44065 |
| PageCount | 19 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_201a4f4475c943f7911946d26a3bce50 proquest_miscellaneous_3043076121 proquest_journals_3054143284 gale_infotracmisc_A790848891 gale_infotracacademiconefile_A790848891 gale_incontextgauss_ISR_A790848891 pubmed_primary_38641616 crossref_citationtrail_10_1186_s12859_024_05769_8 crossref_primary_10_1186_s12859_024_05769_8 springer_journals_10_1186_s12859_024_05769_8 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-04-20 |
| PublicationDateYYYYMMDD | 2024-04-20 |
| PublicationDate_xml | – month: 04 year: 2024 text: 2024-04-20 day: 20 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | BMC bioinformatics |
| PublicationTitleAbbrev | BMC Bioinformatics |
| PublicationTitleAlternate | BMC Bioinformatics |
| PublicationYear | 2024 |
| Publisher | BioMed Central BioMed Central Ltd Springer Nature B.V BMC |
| Publisher_xml | – name: BioMed Central – name: BioMed Central Ltd – name: Springer Nature B.V – name: BMC |
| References | I Vasiljeva (5769_CR2) 2017; 24 5769_CR4 M Von Stosch (5769_CR19) 2014; 60 N Srivastava (5769_CR13) 2014; 15 AM Schweidtmann (5769_CR21) 2019; 180 Y LeCun (5769_CR37) 2015; 521 C Cortes (5769_CR39) 1995; 20 L Prechelt (5769_CR16) 2002 K McBride (5769_CR20) 2019; 91 F Pedregosa (5769_CR41) 2011; 12 M Samadi (5769_CR26) 2022; 17 5769_CR34 5769_CR10 5769_CR32 A Billionnet (5769_CR35) 2010; 34 5769_CR11 E Castillo (5769_CR28) 1998; 7 DR Karger (5769_CR30) 1996; 43 5769_CR38 5769_CR15 D Needell (5769_CR7) 2018; 19 KL Pudenz (5769_CR33) 2013; 12 5769_CR9 SJ Pocock (5769_CR3) 1987; 43 H Zhong (5769_CR1) 2020; 102 PS Albert (5769_CR6) 1999; 18 DC Psichogios (5769_CR17) 1992; 38 II Cplex (5769_CR36) 2009; 46 K Merkelbach (5769_CR22) 2022; 160 ML Bartley (5769_CR8) 2019; 14 ML Thompson (5769_CR18) 1994; 40 N Altman (5769_CR25) 2018; 15 M Fiedler (5769_CR29) 1973; 23 AA Schuppert (5769_CR23) 2000 AA Schuppert (5769_CR27) 2011; 1 J Demšar (5769_CR42) 2006; 7 SI Amari (5769_CR14) 1997; 8 KY Liang (5769_CR5) 1986; 73 B Fiedler (5769_CR24) 2008; 73 H Song (5769_CR12) 2022; 34 5769_CR43 MX Goemans (5769_CR31) 1995; 42 L Breiman (5769_CR40) 2001; 45 |
| References_xml | – volume: 24 start-page: 767 issue: 8 year: 2017 ident: 5769_CR2 publication-title: J Comput Biol doi: 10.1089/cmb.2017.0023 – ident: 5769_CR9 – volume: 38 start-page: 1499 issue: 10 year: 1992 ident: 5769_CR17 publication-title: AIChE J doi: 10.1002/aic.690381003 – ident: 5769_CR38 doi: 10.1145/2939672.2939785 – ident: 5769_CR34 – volume: 7 start-page: 1 year: 2006 ident: 5769_CR42 publication-title: J Mach Learn Res – volume: 45 start-page: 5 year: 2001 ident: 5769_CR40 publication-title: Mach Learn doi: 10.1023/A:1010933404324 – volume: 180 start-page: 925 issue: 3 year: 2019 ident: 5769_CR21 publication-title: J Optim Theory Appl doi: 10.1007/s10957-018-1396-0 – volume: 7 start-page: 151 year: 1998 ident: 5769_CR28 publication-title: Neural Process Lett doi: 10.1023/A:1009656525752 – volume: 73 start-page: 13 issue: 1 year: 1986 ident: 5769_CR5 publication-title: Biometrika doi: 10.1093/biomet/73.1.13 – volume: 60 start-page: 86 year: 2014 ident: 5769_CR19 publication-title: Comput Chem Eng doi: 10.1016/j.compchemeng.2013.08.008 – volume: 17 start-page: e0274569 issue: 9 year: 2022 ident: 5769_CR26 publication-title: PLoS ONE doi: 10.1371/journal.pone.0274569 – volume: 18 start-page: 1707 issue: 13 year: 1999 ident: 5769_CR6 publication-title: Stat Med doi: 10.1002/(SICI)1097-0258(19990715)18:13<1707::AID-SIM138>3.0.CO;2-H – volume: 91 start-page: 228 issue: 3 year: 2019 ident: 5769_CR20 publication-title: Chem Ing Tech doi: 10.1002/cite.201800091 – volume: 34 start-page: 1042 issue: 4 year: 2010 ident: 5769_CR35 publication-title: Appl Math Model doi: 10.1016/j.apm.2009.07.014 – volume: 8 start-page: 985 issue: 5 year: 1997 ident: 5769_CR14 publication-title: IEEE Trans Neural Netw. doi: 10.1109/72.623200 – volume: 46 start-page: 157 issue: 53 year: 2009 ident: 5769_CR36 publication-title: Int Bus Mach Corp – volume: 23 start-page: 298 issue: 2 year: 1973 ident: 5769_CR29 publication-title: Czechoslov Math J doi: 10.21136/CMJ.1973.101168 – start-page: 1135 volume-title: Equadiff 99: (In 2 Volumes) year: 2000 ident: 5769_CR23 doi: 10.1142/9789812792617_0218 – ident: 5769_CR15 – ident: 5769_CR11 – volume: 42 start-page: 1115 issue: 6 year: 1995 ident: 5769_CR31 publication-title: J ACM (JACM) doi: 10.1145/227683.227684 – volume: 14 start-page: e0225715 issue: 12 year: 2019 ident: 5769_CR8 publication-title: PLoS ONE doi: 10.1371/journal.pone.0225715 – volume: 20 start-page: 273 year: 1995 ident: 5769_CR39 publication-title: Mach Learn doi: 10.1007/BF00994018 – volume: 12 start-page: 2027 issue: 5 year: 2013 ident: 5769_CR33 publication-title: Quantum Inf Process doi: 10.1007/s11128-012-0506-4 – volume: 43 start-page: 487 year: 1987 ident: 5769_CR3 publication-title: Biometrics doi: 10.2307/2531989 – volume: 40 start-page: 1328 issue: 8 year: 1994 ident: 5769_CR18 publication-title: AIChE J doi: 10.1002/aic.690400806 – volume: 12 start-page: 2825 year: 2011 ident: 5769_CR41 publication-title: J Mach Learn Res – volume: 160 start-page: 107736 year: 2022 ident: 5769_CR22 publication-title: Comput Chem Eng doi: 10.1016/j.compchemeng.2022.107736 – volume: 19 start-page: 2487 issue: 1 year: 2018 ident: 5769_CR7 publication-title: J Mach Learn Res – volume: 102 start-page: 103360 year: 2020 ident: 5769_CR1 publication-title: J Biomed Inform doi: 10.1016/j.jbi.2019.103360 – volume: 73 start-page: 449 issue: 3 year: 2008 ident: 5769_CR24 publication-title: IMA J Appl Math doi: 10.1093/imamat/hxn011 – ident: 5769_CR32 doi: 10.25080/Majora-92bf1922-00a – volume: 15 start-page: 1929 issue: 1 year: 2014 ident: 5769_CR13 publication-title: J Mach Learn Res – volume: 1 start-page: 1 year: 2011 ident: 5769_CR27 publication-title: J Math Ind doi: 10.1186/2190-5983-1-1 – volume: 43 start-page: 601 issue: 4 year: 1996 ident: 5769_CR30 publication-title: J ACM (JACM) doi: 10.1145/234533.234534 – ident: 5769_CR43 doi: 10.1109/FUZZ-IEEE.2015.7337889 – start-page: 55 volume-title: Neural networks: tricks of the trade year: 2002 ident: 5769_CR16 – volume: 15 start-page: 399 issue: 6 year: 2018 ident: 5769_CR25 publication-title: Nat Methods doi: 10.1038/s41592-018-0019-x – ident: 5769_CR4 doi: 10.21203/rs.3.rs-3236927/v1 – ident: 5769_CR10 – volume: 34 start-page: 8135 year: 2022 ident: 5769_CR12 publication-title: IEEE Trans Neural Netw Learn Syst doi: 10.1109/TNNLS.2022.3152527 – volume: 521 start-page: 436 issue: 7553 year: 2015 ident: 5769_CR37 publication-title: Nature doi: 10.1038/nature14539 |
| SSID | ssj0017805 |
| Score | 2.4582396 |
| Snippet | Background
Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key... Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key practical... Background Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key... BackgroundClassification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of the key... Abstract Background Classification of binary data arises naturally in many clinical applications, such as patient risk stratification through ICD codes. One of... |
| SourceID | doaj proquest gale pubmed crossref springer |
| SourceType | Open Website Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 155 |
| SubjectTerms | Algorithms Binary data Bioinformatics Biomedical and Life Sciences Biomedical data Biomedical materials Boxes Classification Comparative analysis Computational Biology/Bioinformatics Computer Appl. in Life Sciences Data mining Datasets Evaluation Extrapolation Hybrid mechanistic/data-driven modeling Identification Information management Integration Knowledge Learning algorithms Life Sciences Machine learning Max-cut problem Microarrays Modelling Noise tolerance Noise-tolerant classification Overfitting Python (Programming language) Regularization Software Supervised learning Variables |
| SummonAdditionalLinks | – databaseName: Biological Science Database dbid: M7P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELaggMSFdyFQkEFIHMDqJnEcmwsqiAoktKp4qTfLmbVXFSVZNllEz_xxZrxJyoLohePGY2-cedoef8PYY587DdLkovQYvsmyAFFl3ggZjA8YYrgQjws-vyunU314aA76Dbe2T6scbGI01LMGaI98F-VSom9Ha_pi8U1Q1Sg6Xe1LaJxnFwglIY-pewfjKQLh9Q8XZbTabVNCaxPolQRGKcoIveGMImb_35b5N9f0x1lpdEH7V__35a-xK33wyffW0nKdnfP1DXZpXY7y5Cb7OW2OWg-r7jl3fHFCqAIcl9Rf0ORwjG15Tc2ia449OriOAwXelGkUmcubwKt4uZdT1imnhPo5x5lgx3Hjjg_oFNTB1TP-1f0Q-Id81IBb7NP-64-v3oi-SIOAQqtOyKyqimziUBIm1UyWCgjVsAo-deB8pl3qYaZN5tGUlFBOwBWp0mnITQiq8JBvs626qf0dxguJQxlcEKbeYZSWVw5MminjJgASfyUsHbhloUcwp0IaxzauZLSyaw5b5LCNHLY6YU_HPos1fseZ1C9JCEZKwt6OD5rl3PaqbDFkcjIQUCIYmYcS3YWRapYpl1fgi0nCHpEIWULXqCl9Z-5WbWvffnhv90pD9Qu0SRP2pCcKDc4BXH8bAr8EAXJtUO5sUKL6w2bzIHK2Nz-tPZW3hD0cm6knpdTVvlkRjcxpEyvDIW6vJXycd64VLXxVwp4NIn86-L8_392z3-Ueu5xF5ZNom3fYVrdc-fvsInzvjtrlg6i6vwAsfkoM priority: 102 providerName: ProQuest – databaseName: SpringerLink Contemporary Journals dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELaggMSF9yNQkEFIHMAiD8exuRVEBRJaoRaq3ixn1l5VlKTaZBE988eZ8SaB5SXBMfGMk4zn5Xj8mbFHvnAapClE5TF9k1UJos69ETIYHzDFcCEuFxy8rWYzfXho3g2bwrqx2n1ckoyeOpq1Vs-6jLDWBMYUgTmGMkKfZecw3Gkyx739g2ntgFD6x-0xv-XbCEERqf9Xf_xDQPpphTQGnt3L__fKV9ilIdHkO2vNuMrO-OYau7A-evL0Ovs6a486D6v-OXf85JQQBDhOnz-ie-GYx_KGmkXfHnsMZj0HSrKpqigOJG8Dr-NGXk4VppyK5xcc3w0Zp590fESiIAbXzPkn90XgA_mk7TfYh91X71--FsOBDAJKrXoh87ou89ThqKf1XFYKCMGwDj5z4HyuXeZhrk3u0W1UUKXgykzpLBQmBFV6KG6yraZt_G3GS4ldGZz8Zd5hRlbUDkyWK-NSAIlXCcvGMbIwoJXToRnHNs5atLJr4VoUro3CtTphTyaekzVWx1-pX9DQT5SEsx1vtMuFHczWYnrkZCBQRDCyCBWGBiPVPFeuqMGXacIekuJYQtJoqFRn4VZdZ9_s79mdytBZBdpkCXs8EIUWvwHcsPMBJUHgWxuU2xuUaOqw2Tzqpx1cTWfRYUtMejHNSNiDqZk4qXyu8e2KaGRBP6xy7OLWWq-n7y60okmuStjTUYm_d_5n8d35N_K77GIe7UCiX95mW_1y5e-x8_C5P-qW96MBfwOYZkB5 priority: 102 providerName: Springer Nature |
| Title | Noisecut: a python package for noise-tolerant classification of binary data using prior knowledge integration and max-cut solutions |
| URI | https://link.springer.com/article/10.1186/s12859-024-05769-8 https://www.ncbi.nlm.nih.gov/pubmed/38641616 https://www.proquest.com/docview/3054143284 https://www.proquest.com/docview/3043076121 https://doaj.org/article/201a4f4475c943f7911946d26a3bce50 |
| Volume | 25 |
| WOSCitedRecordID | wos001205277600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVADU databaseName: BioMed Central Open Access Free customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RBZ dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: DOA dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M~E dateStart: 20000101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M7P dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database (ProQuest) customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: K7- dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Advanced Technologies & Aerospace Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: P5Z dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: PIMPY dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVAVX databaseName: Springer LINK customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RSV dateStart: 20001201 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELaggMQF8SZQVgYhcQCLTeI4NrcWtaICVtEWqoWL5XjtqqIkVZNF9MwfZ8Z50AUBFy6WEo-dxDOeRzz-TMgTlxppuUpZ7sB943lmWZk4xbhXzoOLYXxYLjh4m89mcrFQxbmjvjAnrIMH7gYOgvPYcI-wdFbx1OcwORUXy0SYtLSui9bB6xmCqX79AJH6hy0yUrxoYsRpY2CPGPgnQjG5ZoYCWv_vOvmcUfpllTQYn93r5FrvNdKt7m1vkAuuukmudOdInt0i32f1UePsqn1JDT05QzgACrHwZ9AVFJxSWmE1a-tjB5appRY9ZkwRClyhtadl2JVLMV2UYib8IYUXgYbjHzc6wEpgA1Mt6RfzjcED6Si6t8mH3Z33r16z_nQFZjMpWsaTssySqQEWTsslz4VFOMLSu9hY4xJpYmeXUiUOdEBu86k1WSxk7FPlvcicTe-Qjaqu3D1CMw5dKYjkYmfAvUpLY1WcCGWm1nK4ikg8DLa2PfQ4noBxrEMIIoXuGKSBQTowSMuIPBvbnHTAG3-l3kYejpQImh1ugCjpXpT0v0QpIo9RAjTCYlSYd3NoVk2j9_bneitXePCAVHFEnvZEvoZvsKbfxgAjgUhaa5Sba5Qwb-169SBoutcbjQbty8GDBZ8hIo_GamyJuXCVq1dIw1P8-5RAF3c7AR2_O5UCI1YRkeeDxP7s_M_Dd_9_DN8DcjUJM4yD6t0kG-3pyj0kl-3X9qg5nZCL-SIPpZyQS9s7s2I-CXMWyjc5m2DSbQFlkX2C-mLvXfERrub7Bz8AefND-Q |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JbxMxFLZKAcGFfRkoYBCIA1idxeOxkRAqS9UoIUJQUG_G43iiijITMhMgZ_4Pv5H3ZisB0VsPHBM_OzPO9zYv3yPkvouMtFxFLHEQvvEktiwNnWI8Uy6DEMNk9XbBh1EyHsu9PfVmjfzs7sLgscrOJtaGelJYXCPfBFxy8O1gTZ_NvjCsGoW7q10JjQYWQ7f8Bilb-XTwEv7fB2G4_Wr3xQ5rqwowG0tRMR6maRz6Bh7dTyc8ERZp-NLMBcYaF0oTODuRKnSA_cQmvjVxIGSQRSrLROxsBOOeICd5JBPk6h8mrN-1wPoA3cUcKTbLANnhGHhBBlGRUEyuOL-6RsDfnuA3V_jH3mzt8rbP_2-TdYGca4NrutVow0Wy5vJL5HRTbnN5mfwYF_uls4vqCTV0tkTWBDoz9hOYVAqxO82xmVXFgQMHXlGLiQWepKrBS4uMpvXlZYqnaileGJhSmDno2C9M0o59AzuYfEI_m-8MfpD2Gn6FvD-WGbhK1vMid9cJjTkMpSDhDZyBKDRKjVVBKJTxreXwySNBhw5tW4Z2LBRyoOtMTQrdIEoDonSNKC098qjvM2v4SY6Ufo6g6yWRW7z-ophPdWuqNISEhmdIBGkVj7IE3KHiYhIKE6XWxb5H7iFkNbKH5Hg8aWoWZakH797qrURhfQapAo88bIWyAt7Bmva2B8wEEo6tSG6sSIJ5s6vNHcR1a15LfYhvj9ztm7EnHhnMXbFAGR7hIl0IQ1xrNKp_70gKTOyFRx53KnY4-L-n78bRz3KHnNnZfT3So8F4eJOcDWvF5-CHNsh6NV-4W-SU_Vrtl_Pbtdmg5ONxq94vMUapCQ |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Zb9QwELagHOKF-wgUMAiJB7C6SRzH5q0cKyqqVUWh6pvlOPaqoiSrTRbRZ_44M85Bl0tCPG489ibOeOabeOYzIU9caqTlKmW5A_jG88yyInGKca-cB4hhfNguONjNZzN5eKj2TlXxh2z3YUuyq2lAlqaq3VqUvlviUmw1MfKuMfAvDPCGUEyeJec4HhqE8fr-wbiPgIz9Q6nMb_utuaPA2v-rbT7lnH7aLQ1OaHrl_2__KrncA1C63WnMNXLGVdfJhe5IypMb5NusPmqcXbUvqKGLE2QWoBBWfwKzQwHf0gqbWVsfO3ByLbUIvjHbKLxgWntahAJfipmnFJPq5xTuEzqOH-_owFCBHUxV0s_mK4M_pOMquEk-Tt98ePWW9Qc1MJtJ0TKeFEWWTAxow6QoeS4sMhsW3sXGGpdIEztbSpU4MCe5zSfWZLGQsU-V9yJzNr1FNqq6cncIzTgMpSAojJ0BpJYWxqo4EcpMrOXwKyLx8L607VnM8TCNYx2iGSl0N7kaJleHydUyIs_GPouOw-Ov0i9RDUZJ5N8OF-rlXPfLWQNsMtwjWaJVPPU5uAzFRZkIkxbWZZOIPEYl0siwUWEKz9ysmkbv7L_X27nCMwykiiPytBfyNTyDNX1FBMwEknKtSW6uSYIJsOvNg67q3gQ1Ggw5BzAM8CMij8Zm7IlpdZWrVyjDU_yQlcAQtzsdH587lQKDXxGR54NC_xj8z9N399_EH5KLe6-nendn9u4euZSEJcHBdG-SjXa5cvfJefulPWqWD8K6_g5JPUxB |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Noisecut%3A+a+python+package+for+noise-tolerant+classification+of+binary+data+using+prior+knowledge+integration+and+max-cut+solutions&rft.jtitle=BMC+bioinformatics&rft.au=Samadi%2C+Moein+E.&rft.au=Mirzaieazar%2C+Hedieh&rft.au=Mitsos%2C+Alexander&rft.au=Schuppert%2C+Andreas&rft.date=2024-04-20&rft.issn=1471-2105&rft.eissn=1471-2105&rft.volume=25&rft.issue=1&rft_id=info:doi/10.1186%2Fs12859-024-05769-8&rft.externalDBID=n%2Fa&rft.externalDocID=10_1186_s12859_024_05769_8 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2105&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2105&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2105&client=summon |