Hellinger distance-based stable sparse feature selection for high-dimensional class-imbalanced data

Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced data across many scientific fields. In addition to reducing model complexity and discovering key biomarkers, feature selection is also an effec...

Full description

Saved in:
Bibliographic Details
Published inBMC bioinformatics Vol. 21; no. 1; pp. 121 - 14
Main Authors Fu, Guang-Hui, Wu, Yuan-Jiao, Zong, Min-Jie, Pan, Jianxin
Format Journal Article
LanguageEnglish
Published England BioMed Central Ltd 23.03.2020
BioMed Central
BMC
Subjects
Online AccessGet full text

Cover

Loading…
Abstract Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced data across many scientific fields. In addition to reducing model complexity and discovering key biomarkers, feature selection is also an effective method of combating overlapping which may arise in such data and become a crucial aspect for determining classification performance. However, ordinary feature selection techniques for classification can not be simply used for addressing class-imbalanced data without any adjustment. Thus, more efficient feature selection technique must be developed for complicated class-imbalanced data, especially in the context of high-dimensionality. We proposed an algorithm called sssHD to achieve stable sparse feature selection applied it to complicated class-imbalanced data. sssHD is based on the Hellinger distance (HD) coupled with sparse regularization techniques. We stated that Hellinger distance is not only class-insensitive but also translation-invariant. Simulation result indicates that HD-based selection algorithm is effective in recognizing key features and control false discoveries for class-imbalance learning. Five gene expression datasets are also employed to test the performance of the sssHD algorithm, and a comparison with several existing selection procedures is performed. The result shows that sssHD is highly competitive in terms of five assessment metrics. In addition, sssHD presents limited differences between performing and not performing re-balance preprocessing. sssHD is a practical feature selection method for high-dimensional class-imbalanced data, which is simple and can be an alternative for performing feature selection in class-imbalanced data. sssHD can be easily extended by connecting it with different re-balance preprocessing, different sparse regularization structures as well as different classifiers. As such, the algorithm is extremely general and has a wide range of applicability.
AbstractList Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced data across many scientific fields. In addition to reducing model complexity and discovering key biomarkers, feature selection is also an effective method of combating overlapping which may arise in such data and become a crucial aspect for determining classification performance. However, ordinary feature selection techniques for classification can not be simply used for addressing class-imbalanced data without any adjustment. Thus, more efficient feature selection technique must be developed for complicated class-imbalanced data, especially in the context of high-dimensionality. We proposed an algorithm called sssHD to achieve stable sparse feature selection applied it to complicated class-imbalanced data. sssHD is based on the Hellinger distance (HD) coupled with sparse regularization techniques. We stated that Hellinger distance is not only class-insensitive but also translation-invariant. Simulation result indicates that HD-based selection algorithm is effective in recognizing key features and control false discoveries for class-imbalance learning. Five gene expression datasets are also employed to test the performance of the sssHD algorithm, and a comparison with several existing selection procedures is performed. The result shows that sssHD is highly competitive in terms of five assessment metrics. In addition, sssHD presents limited differences between performing and not performing re-balance preprocessing. sssHD is a practical feature selection method for high-dimensional class-imbalanced data, which is simple and can be an alternative for performing feature selection in class-imbalanced data. sssHD can be easily extended by connecting it with different re-balance preprocessing, different sparse regularization structures as well as different classifiers. As such, the algorithm is extremely general and has a wide range of applicability.
Background Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced data across many scientific fields. In addition to reducing model complexity and discovering key biomarkers, feature selection is also an effective method of combating overlapping which may arise in such data and become a crucial aspect for determining classification performance. However, ordinary feature selection techniques for classification can not be simply used for addressing class-imbalanced data without any adjustment. Thus, more efficient feature selection technique must be developed for complicated class-imbalanced data, especially in the context of high-dimensionality. Results We proposed an algorithm called sssHD to achieve stable sparse feature selection applied it to complicated class-imbalanced data. sssHD is based on the Hellinger distance (HD) coupled with sparse regularization techniques. We stated that Hellinger distance is not only class-insensitive but also translation-invariant. Simulation result indicates that HD-based selection algorithm is effective in recognizing key features and control false discoveries for class-imbalance learning. Five gene expression datasets are also employed to test the performance of the sssHD algorithm, and a comparison with several existing selection procedures is performed. The result shows that sssHD is highly competitive in terms of five assessment metrics. In addition, sssHD presents limited differences between performing and not performing re-balance preprocessing. Conclusions sssHD is a practical feature selection method for high-dimensional class-imbalanced data, which is simple and can be an alternative for performing feature selection in class-imbalanced data. sssHD can be easily extended by connecting it with different re-balance preprocessing, different sparse regularization structures as well as different classifiers. As such, the algorithm is extremely general and has a wide range of applicability. Keywords: Hellinger distance, Class-imbalance learning, Feature selection, Sparse regularization
Abstract Background Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced data across many scientific fields. In addition to reducing model complexity and discovering key biomarkers, feature selection is also an effective method of combating overlapping which may arise in such data and become a crucial aspect for determining classification performance. However, ordinary feature selection techniques for classification can not be simply used for addressing class-imbalanced data without any adjustment. Thus, more efficient feature selection technique must be developed for complicated class-imbalanced data, especially in the context of high-dimensionality. Results We proposed an algorithm called sssHD to achieve stable sparse feature selection applied it to complicated class-imbalanced data. sssHD is based on the Hellinger distance (HD) coupled with sparse regularization techniques. We stated that Hellinger distance is not only class-insensitive but also translation-invariant. Simulation result indicates that HD-based selection algorithm is effective in recognizing key features and control false discoveries for class-imbalance learning. Five gene expression datasets are also employed to test the performance of the sssHD algorithm, and a comparison with several existing selection procedures is performed. The result shows that sssHD is highly competitive in terms of five assessment metrics. In addition, sssHD presents limited differences between performing and not performing re-balance preprocessing. Conclusions sssHD is a practical feature selection method for high-dimensional class-imbalanced data, which is simple and can be an alternative for performing feature selection in class-imbalanced data. sssHD can be easily extended by connecting it with different re-balance preprocessing, different sparse regularization structures as well as different classifiers. As such, the algorithm is extremely general and has a wide range of applicability.
Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced data across many scientific fields. In addition to reducing model complexity and discovering key biomarkers, feature selection is also an effective method of combating overlapping which may arise in such data and become a crucial aspect for determining classification performance. However, ordinary feature selection techniques for classification can not be simply used for addressing class-imbalanced data without any adjustment. Thus, more efficient feature selection technique must be developed for complicated class-imbalanced data, especially in the context of high-dimensionality.BACKGROUNDFeature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced data across many scientific fields. In addition to reducing model complexity and discovering key biomarkers, feature selection is also an effective method of combating overlapping which may arise in such data and become a crucial aspect for determining classification performance. However, ordinary feature selection techniques for classification can not be simply used for addressing class-imbalanced data without any adjustment. Thus, more efficient feature selection technique must be developed for complicated class-imbalanced data, especially in the context of high-dimensionality.We proposed an algorithm called sssHD to achieve stable sparse feature selection applied it to complicated class-imbalanced data. sssHD is based on the Hellinger distance (HD) coupled with sparse regularization techniques. We stated that Hellinger distance is not only class-insensitive but also translation-invariant. Simulation result indicates that HD-based selection algorithm is effective in recognizing key features and control false discoveries for class-imbalance learning. Five gene expression datasets are also employed to test the performance of the sssHD algorithm, and a comparison with several existing selection procedures is performed. The result shows that sssHD is highly competitive in terms of five assessment metrics. In addition, sssHD presents limited differences between performing and not performing re-balance preprocessing.RESULTSWe proposed an algorithm called sssHD to achieve stable sparse feature selection applied it to complicated class-imbalanced data. sssHD is based on the Hellinger distance (HD) coupled with sparse regularization techniques. We stated that Hellinger distance is not only class-insensitive but also translation-invariant. Simulation result indicates that HD-based selection algorithm is effective in recognizing key features and control false discoveries for class-imbalance learning. Five gene expression datasets are also employed to test the performance of the sssHD algorithm, and a comparison with several existing selection procedures is performed. The result shows that sssHD is highly competitive in terms of five assessment metrics. In addition, sssHD presents limited differences between performing and not performing re-balance preprocessing.sssHD is a practical feature selection method for high-dimensional class-imbalanced data, which is simple and can be an alternative for performing feature selection in class-imbalanced data. sssHD can be easily extended by connecting it with different re-balance preprocessing, different sparse regularization structures as well as different classifiers. As such, the algorithm is extremely general and has a wide range of applicability.CONCLUSIONSsssHD is a practical feature selection method for high-dimensional class-imbalanced data, which is simple and can be an alternative for performing feature selection in class-imbalanced data. sssHD can be easily extended by connecting it with different re-balance preprocessing, different sparse regularization structures as well as different classifiers. As such, the algorithm is extremely general and has a wide range of applicability.
Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced data across many scientific fields. In addition to reducing model complexity and discovering key biomarkers, feature selection is also an effective method of combating overlapping which may arise in such data and become a crucial aspect for determining classification performance. However, ordinary feature selection techniques for classification can not be simply used for addressing class-imbalanced data without any adjustment. Thus, more efficient feature selection technique must be developed for complicated class-imbalanced data, especially in the context of high-dimensionality. We proposed an algorithm called sssHD to achieve stable sparse feature selection applied it to complicated class-imbalanced data. sssHD is based on the Hellinger distance (HD) coupled with sparse regularization techniques. We stated that Hellinger distance is not only class-insensitive but also translation-invariant. Simulation result indicates that HD-based selection algorithm is effective in recognizing key features and control false discoveries for class-imbalance learning. Five gene expression datasets are also employed to test the performance of the sssHD algorithm, and a comparison with several existing selection procedures is performed. The result shows that sssHD is highly competitive in terms of five assessment metrics. In addition, sssHD presents limited differences between performing and not performing re-balance preprocessing. sssHD is a practical feature selection method for high-dimensional class-imbalanced data, which is simple and can be an alternative for performing feature selection in class-imbalanced data. sssHD can be easily extended by connecting it with different re-balance preprocessing, different sparse regularization structures as well as different classifiers. As such, the algorithm is extremely general and has a wide range of applicability.
Background Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced data across many scientific fields. In addition to reducing model complexity and discovering key biomarkers, feature selection is also an effective method of combating overlapping which may arise in such data and become a crucial aspect for determining classification performance. However, ordinary feature selection techniques for classification can not be simply used for addressing class-imbalanced data without any adjustment. Thus, more efficient feature selection technique must be developed for complicated class-imbalanced data, especially in the context of high-dimensionality. Results We proposed an algorithm called sssHD to achieve stable sparse feature selection applied it to complicated class-imbalanced data. sssHD is based on the Hellinger distance (HD) coupled with sparse regularization techniques. We stated that Hellinger distance is not only class-insensitive but also translation-invariant. Simulation result indicates that HD-based selection algorithm is effective in recognizing key features and control false discoveries for class-imbalance learning. Five gene expression datasets are also employed to test the performance of the sssHD algorithm, and a comparison with several existing selection procedures is performed. The result shows that sssHD is highly competitive in terms of five assessment metrics. In addition, sssHD presents limited differences between performing and not performing re-balance preprocessing. Conclusions sssHD is a practical feature selection method for high-dimensional class-imbalanced data, which is simple and can be an alternative for performing feature selection in class-imbalanced data. sssHD can be easily extended by connecting it with different re-balance preprocessing, different sparse regularization structures as well as different classifiers. As such, the algorithm is extremely general and has a wide range of applicability.
ArticleNumber 121
Audience Academic
Author Fu, Guang-Hui
Wu, Yuan-Jiao
Zong, Min-Jie
Pan, Jianxin
Author_xml – sequence: 1
  givenname: Guang-Hui
  surname: Fu
  fullname: Fu, Guang-Hui
– sequence: 2
  givenname: Yuan-Jiao
  surname: Wu
  fullname: Wu, Yuan-Jiao
– sequence: 3
  givenname: Min-Jie
  surname: Zong
  fullname: Zong, Min-Jie
– sequence: 4
  givenname: Jianxin
  surname: Pan
  fullname: Pan, Jianxin
BackLink https://www.ncbi.nlm.nih.gov/pubmed/32293252$$D View this record in MEDLINE/PubMed
BookMark eNp1kktv1DAUhSNURB_wA9igSGxgkeJnnGyQqgroSJWQoHvLsW8yHjnxYDsV_HucTgtNBcrC8c05n52jc1ocTX6ConiN0TnGTf0hYtLwtkIEVZRhXNFnxQlmAlcEI3706P24OI1xhxAWDeIvimNKSEsJJyeFvgLn7DRAKI2NSU0aqk5FMGXedA7KuFchQtmDSnPIW3Cgk_VT2ftQbu2wrYwdYYp5pFypnYqxsmOn3IIypVFJvSye98pFeHW_nhU3nz_dXF5V11-_bC4vrivNW5Yq3pqWIWKoqqHXVAvEkWZE15SSDhtd901Xs6YhmkNGtxpa0wmkEIgOgNCzYnPAGq92ch_sqMIv6ZWVdwMfBqlCstqBBNQ0wDoktDY5uL4lBhQ3lIHoa9qizPp4YO3nbgSjYUpBuRV0_WWyWzn4WylQSxhrMuDdPSD4HzPEJEcbdc5aTeDnKEk-Bde1qJd7v30i3fk55DTvVJgIhgn7qxpU_gE79T6fqxeovKhxI3iLuMiq83-o8mNgtDq3p7d5vjK8XxmyJsHPNKg5Rrn5_m2tffM4lD9pPLQpC8RBoIOPMUAvtU1qaUu-hXUSI7n0Vh56K3Nv5dJbSbMTP3E-wP_v-Q045e6s
CitedBy_id crossref_primary_10_1016_j_mlwa_2023_100457
crossref_primary_10_1360_TB_2022_0550
crossref_primary_10_3389_fgene_2021_698477
crossref_primary_10_1016_j_egyr_2022_01_012
crossref_primary_10_1016_j_saa_2024_124581
crossref_primary_10_32604_cmc_2024_054506
crossref_primary_10_1155_2020_9084704
crossref_primary_10_1186_s13040_024_00384_y
crossref_primary_10_1016_j_asoc_2024_111267
crossref_primary_10_7717_peerj_cs_1229
crossref_primary_10_3934_math_2024851
crossref_primary_10_7717_peerj_cs_832
crossref_primary_10_1155_2020_8824625
crossref_primary_10_1007_s00180_023_01347_3
crossref_primary_10_1016_j_eswa_2023_123119
crossref_primary_10_1016_j_ins_2024_121145
crossref_primary_10_3390_app13042079
crossref_primary_10_3390_info12080286
crossref_primary_10_3390_healthcare9030260
crossref_primary_10_3390_metabo11060389
Cites_doi 10.1007/978-1-4757-3264-1
10.1002/cem.1364
10.1214/15-AOS1337
10.1155/JBB.2005.147
10.1186/1471-2105-6-148
10.1007/978-3-319-24277-4
10.1016/j.eswa.2010.09.153
10.1093/biomet/asp020
10.1002/bimj.201800148
10.1111/j.1467-9868.2010.00740.x
10.1016/j.knosys.2016.09.014
10.1016/j.neuroimage.2013.10.005
10.1016/j.eswa.2011.01.077
10.1038/nm0102-68
10.1109/TKDE.2009.187
10.1016/j.neucom.2012.04.039
10.1186/1471-2105-11-523
10.1214/009053604000000067
10.1109/TKDE.2008.239
10.1111/j.1467-9868.2005.00532.x
10.1016/j.patcog.2013.11.021
10.1080/10618600.1996.10474713
10.1016/j.patcog.2006.07.010
10.1111/j.1541-0420.2008.01015.x
10.1093/biomet/70.1.163
10.1109/TKDE.2006.17
10.1016/j.knosys.2015.10.012
10.1186/1471-2105-7-228
10.1016/j.eswa.2016.12.035
10.1093/bib/bbs006
10.1038/89044
10.1016/j.knosys.2017.09.006
10.1023/A:1025667309714
10.1111/j.1467-9868.2005.00503.x
10.1214/12-STS392
10.1198/016214506000000735
10.1371/journal.pone.0118432
10.1093/bioinformatics/btm344
10.1007/s13748-016-0094-0
10.1093/bioinformatics/btw570
10.1198/016214501753382273
10.1016/j.asoc.2010.12.002
10.1093/bioinformatics/bti724
10.1111/j.2517-6161.1996.tb02080.x
10.18637/jss.v033.i01
10.1109/TCOM.1967.1089532
10.1016/j.knosys.2014.12.007
10.1613/jair.953
10.1109/ICDMW.2009.35
10.1016/j.ins.2014.07.015
10.1145/1007730.1007741
10.1007/s10618-011-0222-1
10.1111/rssb.12265
10.1016/j.datak.2012.08.001
10.1111/j.1467-9868.2011.00783.x
10.1016/j.ins.2017.05.008
ContentType Journal Article
Copyright COPYRIGHT 2020 BioMed Central Ltd.
2020. 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.
The Author(s) 2020
Copyright_xml – notice: COPYRIGHT 2020 BioMed Central Ltd.
– notice: 2020. 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.
– notice: The Author(s) 2020
DBID 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
Q9U
7X8
5PM
DOA
DOI 10.1186/s12859-020-3411-3
DatabaseName CrossRef
PubMed
Gale In Context: Science
ProQuest Central (Corporate)
Biotechnology Research Abstracts
Computer and Information Systems Abstracts
Health & Medical Collection
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 Journals
Hospital Premium Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest One Sustainability (subscription)
ProQuest Central UK/Ireland
Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
Biological Science Collection
ProQuest Central
ProQuest Technology Collection
Natural Science Collection
ProQuest One
ProQuest Central Korea
Engineering Research Database
Health Research Premium Collection (UHCL Subscription)
Health Research Premium Collection (Alumni)
ProQuest Central Student
ProQuest SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
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
Proquest Medical Database
Biological Science Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Biotechnology and BioEngineering Abstracts
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central Basic
MEDLINE - Academic
PubMed Central (Full Participant titles)
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 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: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 3
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Biology
EISSN 1471-2105
EndPage 14
ExternalDocumentID oai_doaj_org_article_e088e4b07ccd411f92dea5d34e7f6390
PMC7092448
A618759057
32293252
10_1186_s12859_020_3411_3
Genre Journal Article
GeographicLocations Taiwan
GeographicLocations_xml – name: Taiwan
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 11761041 and 21775058
– fundername: ;
  grantid: 11761041 and 21775058
GroupedDBID ---
0R~
23N
2WC
53G
5VS
6J9
7X7
88E
8AO
8FE
8FG
8FH
8FI
8FJ
AAFWJ
AAJSJ
AAKPC
AASML
AAYXX
ABDBF
ABUWG
ACGFO
ACGFS
ACIHN
ACIWK
ACPRK
ACUHS
ADBBV
ADMLS
ADUKV
AEAQA
AENEX
AEUYN
AFKRA
AFPKN
AFRAH
AHBYD
AHMBA
AHYZX
ALIPV
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMTXH
AOIJS
ARAPS
AZQEC
BAPOH
BAWUL
BBNVY
BCNDV
BENPR
BFQNJ
BGLVJ
BHPHI
BMC
BPHCQ
BVXVI
C6C
CCPQU
CITATION
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
PQQKQ
PROAC
PSQYO
RBZ
RNS
ROL
RPM
RSV
SBL
SOJ
SV3
TR2
TUS
UKHRP
W2D
WOQ
WOW
XH6
XSB
-A0
3V.
ACRMQ
ADINQ
C24
M0N
NPM
PMFND
7QO
7SC
7XB
8AL
8FD
8FK
FR3
JQ2
K9.
L7M
L~C
L~D
P64
PJZUB
PKEHL
PPXIY
PQEST
PQGLB
PQUKI
Q9U
7X8
5PM
PUEGO
ID FETCH-LOGICAL-c594t-59d9402d3a6efc3c7050c42c6332b1dc6f8b64882c5eced9ce9db70a0e7bee23
IEDL.DBID 7X7
ISSN 1471-2105
IngestDate Wed Aug 27 01:24:54 EDT 2025
Thu Aug 21 13:38:13 EDT 2025
Thu Jul 10 22:25:13 EDT 2025
Fri Jul 25 19:18:11 EDT 2025
Tue Jun 17 21:02:14 EDT 2025
Tue Jun 10 20:46:24 EDT 2025
Fri Jun 27 03:45:26 EDT 2025
Wed Feb 19 02:30:31 EST 2025
Tue Jul 01 03:38:30 EDT 2025
Thu Apr 24 23:10:17 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Hellinger distance
Class-imbalance learning
Feature selection
Sparse regularization
Language English
License Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c594t-59d9402d3a6efc3c7050c42c6332b1dc6f8b64882c5eced9ce9db70a0e7bee23
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
OpenAccessLink https://www.proquest.com/docview/2391274124?pq-origsite=%requestingapplication%
PMID 32293252
PQID 2391274124
PQPubID 44065
PageCount 14
ParticipantIDs doaj_primary_oai_doaj_org_article_e088e4b07ccd411f92dea5d34e7f6390
pubmedcentral_primary_oai_pubmedcentral_nih_gov_7092448
proquest_miscellaneous_2390166762
proquest_journals_2391274124
gale_infotracmisc_A618759057
gale_infotracacademiconefile_A618759057
gale_incontextgauss_ISR_A618759057
pubmed_primary_32293252
crossref_citationtrail_10_1186_s12859_020_3411_3
crossref_primary_10_1186_s12859_020_3411_3
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2020-03-23
PublicationDateYYYYMMDD 2020-03-23
PublicationDate_xml – month: 03
  year: 2020
  text: 2020-03-23
  day: 23
PublicationDecade 2020
PublicationPlace England
PublicationPlace_xml – name: England
– name: London
PublicationTitle BMC bioinformatics
PublicationTitleAlternate BMC Bioinformatics
PublicationYear 2020
Publisher BioMed Central Ltd
BioMed Central
BMC
Publisher_xml – name: BioMed Central Ltd
– name: BioMed Central
– name: BMC
References AI Su (3411_CR60) 2001; 61
H Zou (3411_CR38) 2005; 67
M Alibeigi (3411_CR10) 2012; 81-82
Z Liu (3411_CR2) 2008; 64
J Khan (3411_CR59) 2001; 7
E Candes (3411_CR65) 2018; 80
I Guyon (3411_CR49) 2008
H Wickham (3411_CR63) 2016
N Meinshausen (3411_CR40) 2010; 72
H He (3411_CR8) 2009; 21
X-w Chen (3411_CR20) 2008
RF Barber (3411_CR64) 2015; 43
M Yuan (3411_CR46) 2006; 68
JT Kent (3411_CR13) 1983; 70
M Wasikowski (3411_CR17) 2010; 22
CL Nutt (3411_CR61) 2003; 63
VN Vapnik (3411_CR32) 2000
H Guo (3411_CR16) 2017; 73
T Zhang (3411_CR34) 2001; 22
J Huang (3411_CR47) 2009; 96
T Saito (3411_CR56) 2015; 10
H Zou (3411_CR39) 2006; 101
S Wang (3411_CR54) 2009; 38
S Ma (3411_CR4) 2005; 21
DA Cieslak (3411_CR31) 2012; 24
T Jirapech-Umpai (3411_CR14) 2005; 6
R Blagus (3411_CR19) 2010; 11
Z Zheng (3411_CR7) 2004; 6
R Tibshirani (3411_CR24) 1996; 58
GH Fu (3411_CR35) 2011; 25
NV Chawla (3411_CR44) 2002; 16
Y Li (3411_CR22) 2016; 94
T Kailath (3411_CR30) 1967; 15
B Efron (3411_CR37) 2004; 32
V García (3411_CR11) 2007
H Yu (3411_CR25) 2015; 76
J Huang (3411_CR41) 2012; 27
ZH Zhou (3411_CR27) 2006; 18
T Saito (3411_CR48) 2017; 33
S Maldonado (3411_CR6) 2014; 286
DM Witten (3411_CR43) 2011; 73
3411_CR50
3411_CR51
MA Shipp (3411_CR57) 2002; 8
K Yang (3411_CR58) 2006; 7
B Schölkopf (3411_CR33) 2002
3411_CR52
W-C Lin (3411_CR45) 2017; 409–10
Y Saeys (3411_CR12) 2007; 23
R Dubey (3411_CR23) 2014; 87
S Maldonado (3411_CR21) 2014; 47
J Friedman (3411_CR42) 2010; 33
H Mamitsuka (3411_CR1) 2006; 39
J Fan (3411_CR36) 2001; 96
(3411_CR9) 2010
S Chowdhury (3411_CR53) 2011; 11
L Yin (3411_CR5) 2013; 105
H Yu (3411_CR29) 2016; 92
P Zhou (3411_CR3) 2017; 136
W-J Lin (3411_CR28) 2013; 14
M Robnik-Šikonja (3411_CR55) 2003; 53
R Ihaka (3411_CR62) 1996; 5
D Ghosh (3411_CR15) 2005; 2005
B Krawczyk (3411_CR26) 2016; 5
H Ogura (3411_CR18) 2011; 38
References_xml – volume: 61
  start-page: 7388
  issue: 20
  year: 2001
  ident: 3411_CR60
  publication-title: Cancer Res
– volume-title: Feature Extraction: Foundations and Applications vol. 207
  year: 2008
  ident: 3411_CR49
– volume: 63
  start-page: 1602
  issue: 7
  year: 2003
  ident: 3411_CR61
  publication-title: Cancer Res
– volume-title: The Nature of Statistical Learning Theory
  year: 2000
  ident: 3411_CR32
  doi: 10.1007/978-1-4757-3264-1
– volume: 25
  start-page: 92
  issue: 2
  year: 2011
  ident: 3411_CR35
  publication-title: J Chemom
  doi: 10.1002/cem.1364
– volume: 43
  start-page: 2055
  issue: 5
  year: 2015
  ident: 3411_CR64
  publication-title: Ann Stat
  doi: 10.1214/15-AOS1337
– volume: 2005
  start-page: 147
  issue: 2
  year: 2005
  ident: 3411_CR15
  publication-title: BioMed Res Int
  doi: 10.1155/JBB.2005.147
– volume-title: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD ’08
  year: 2008
  ident: 3411_CR20
– volume: 6
  start-page: 148
  issue: 1
  year: 2005
  ident: 3411_CR14
  publication-title: BMC Bioinformatics
  doi: 10.1186/1471-2105-6-148
– volume-title: Overlap versus Imbalance
  year: 2010
  ident: 3411_CR9
– volume-title: Ggplot2: Elegant Graphics for Data Analysis
  year: 2016
  ident: 3411_CR63
  doi: 10.1007/978-3-319-24277-4
– volume: 38
  start-page: 4978
  issue: 5
  year: 2011
  ident: 3411_CR18
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2010.09.153
– volume: 96
  start-page: 339
  issue: 2
  year: 2009
  ident: 3411_CR47
  publication-title: Biometrika
  doi: 10.1093/biomet/asp020
– ident: 3411_CR52
  doi: 10.1002/bimj.201800148
– volume: 72
  start-page: 417
  issue: 4
  year: 2010
  ident: 3411_CR40
  publication-title: J R Stat Soc Ser B Stat Methodol
  doi: 10.1111/j.1467-9868.2010.00740.x
– volume: 94
  start-page: 88
  year: 2016
  ident: 3411_CR22
  publication-title: Knowl-Based Syst
  doi: 10.1016/j.knosys.2016.09.014
– volume: 87
  start-page: 220
  year: 2014
  ident: 3411_CR23
  publication-title: NeuroImage
  doi: 10.1016/j.neuroimage.2013.10.005
– volume: 38
  start-page: 8696
  issue: 7
  year: 2009
  ident: 3411_CR54
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2011.01.077
– volume: 8
  start-page: 68
  year: 2002
  ident: 3411_CR57
  publication-title: Nat Med
  doi: 10.1038/nm0102-68
– volume: 22
  start-page: 1388
  issue: 10
  year: 2010
  ident: 3411_CR17
  publication-title: IEEE Trans Knowl Data Eng
  doi: 10.1109/TKDE.2009.187
– volume: 105
  start-page: 3
  year: 2013
  ident: 3411_CR5
  publication-title: Neurocomputing
  doi: 10.1016/j.neucom.2012.04.039
– ident: 3411_CR50
– volume: 11
  start-page: 523
  issue: 1
  year: 2010
  ident: 3411_CR19
  publication-title: BMC Bioinformatics
  doi: 10.1186/1471-2105-11-523
– volume: 32
  start-page: 407
  issue: 2
  year: 2004
  ident: 3411_CR37
  publication-title: Ann Stat
  doi: 10.1214/009053604000000067
– volume: 21
  start-page: 1263
  issue: 9
  year: 2009
  ident: 3411_CR8
  publication-title: IEEE Trans Knowl Data Eng
  doi: 10.1109/TKDE.2008.239
– volume: 68
  start-page: 49
  issue: 1
  year: 2006
  ident: 3411_CR46
  publication-title: J R Stat Soc Ser B Stat Methodol
  doi: 10.1111/j.1467-9868.2005.00532.x
– volume-title: Progress in Pattern Recognition, Image Analysis and Applications
  year: 2007
  ident: 3411_CR11
– volume: 47
  start-page: 2070
  issue: 5
  year: 2014
  ident: 3411_CR21
  publication-title: Pattern Recog
  doi: 10.1016/j.patcog.2013.11.021
– volume: 5
  start-page: 299
  issue: 3
  year: 1996
  ident: 3411_CR62
  publication-title: J Comput Graph Stat
  doi: 10.1080/10618600.1996.10474713
– volume: 39
  start-page: 2393
  issue: 12
  year: 2006
  ident: 3411_CR1
  publication-title: Pattern Recog
  doi: 10.1016/j.patcog.2006.07.010
– volume: 64
  start-page: 1155
  issue: 4
  year: 2008
  ident: 3411_CR2
  publication-title: Biometrics
  doi: 10.1111/j.1541-0420.2008.01015.x
– volume: 70
  start-page: 163
  issue: 1
  year: 1983
  ident: 3411_CR13
  publication-title: Biometrika
  doi: 10.1093/biomet/70.1.163
– volume: 18
  start-page: 63
  issue: 1
  year: 2006
  ident: 3411_CR27
  publication-title: IEEE Trans Knowl Data Eng
  doi: 10.1109/TKDE.2006.17
– volume: 92
  start-page: 55
  year: 2016
  ident: 3411_CR29
  publication-title: Knowl-Based Syst
  doi: 10.1016/j.knosys.2015.10.012
– volume: 7
  start-page: 228
  issue: 1
  year: 2006
  ident: 3411_CR58
  publication-title: BMC Bioinformatics
  doi: 10.1186/1471-2105-7-228
– volume: 73
  start-page: 220
  year: 2017
  ident: 3411_CR16
  publication-title: Expert Syst Appl
  doi: 10.1016/j.eswa.2016.12.035
– volume: 14
  start-page: 13
  issue: 1
  year: 2013
  ident: 3411_CR28
  publication-title: Brief Bioinform
  doi: 10.1093/bib/bbs006
– volume: 7
  start-page: 673
  issue: 6
  year: 2001
  ident: 3411_CR59
  publication-title: Nat Med
  doi: 10.1038/89044
– volume: 136
  start-page: 187
  year: 2017
  ident: 3411_CR3
  publication-title: Knowl-Based Syst
  doi: 10.1016/j.knosys.2017.09.006
– volume: 53
  start-page: 23
  issue: 1
  year: 2003
  ident: 3411_CR55
  publication-title: Mach Learn
  doi: 10.1023/A:1025667309714
– volume: 67
  start-page: 301
  issue: 2
  year: 2005
  ident: 3411_CR38
  publication-title: J R Stat Soc Ser B Stat Methodol
  doi: 10.1111/j.1467-9868.2005.00503.x
– volume: 27
  start-page: 481
  issue: 4
  year: 2012
  ident: 3411_CR41
  publication-title: Stat Sci
  doi: 10.1214/12-STS392
– volume: 101
  start-page: 1418
  issue: 476
  year: 2006
  ident: 3411_CR39
  publication-title: J Am Stat Assoc
  doi: 10.1198/016214506000000735
– volume: 10
  start-page: 1
  issue: 3
  year: 2015
  ident: 3411_CR56
  publication-title: Plos ONE
  doi: 10.1371/journal.pone.0118432
– volume: 23
  start-page: 2507
  issue: 19
  year: 2007
  ident: 3411_CR12
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btm344
– volume: 5
  start-page: 221
  issue: 4
  year: 2016
  ident: 3411_CR26
  publication-title: Prog Artif Intell
  doi: 10.1007/s13748-016-0094-0
– volume: 33
  start-page: 145
  issue: 1
  year: 2017
  ident: 3411_CR48
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btw570
– volume: 96
  start-page: 1348
  issue: 456
  year: 2001
  ident: 3411_CR36
  publication-title: J Am Stat Assoc
  doi: 10.1198/016214501753382273
– volume: 11
  start-page: 4282
  issue: 7
  year: 2011
  ident: 3411_CR53
  publication-title: Appl Soft Comput
  doi: 10.1016/j.asoc.2010.12.002
– volume: 21
  start-page: 4356
  issue: 24
  year: 2005
  ident: 3411_CR4
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/bti724
– volume: 58
  start-page: 267
  issue: 1
  year: 1996
  ident: 3411_CR24
  publication-title: J R Stat Soc Ser B Stat Methodol
  doi: 10.1111/j.2517-6161.1996.tb02080.x
– volume: 33
  start-page: 1
  issue: 1
  year: 2010
  ident: 3411_CR42
  publication-title: J Stat Softw
  doi: 10.18637/jss.v033.i01
– volume: 15
  start-page: 52
  issue: 1
  year: 1967
  ident: 3411_CR30
  publication-title: IEEE Trans Commun Technol
  doi: 10.1109/TCOM.1967.1089532
– volume: 76
  start-page: 67
  issue: 1
  year: 2015
  ident: 3411_CR25
  publication-title: Knowl-Based Syst
  doi: 10.1016/j.knosys.2014.12.007
– volume: 16
  start-page: 321
  year: 2002
  ident: 3411_CR44
  publication-title: J Artif Intell Res
  doi: 10.1613/jair.953
– ident: 3411_CR51
  doi: 10.1109/ICDMW.2009.35
– volume: 286
  start-page: 228
  year: 2014
  ident: 3411_CR6
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2014.07.015
– volume: 6
  start-page: 80
  issue: 1
  year: 2004
  ident: 3411_CR7
  publication-title: ACM Sigkdd Explor Newsl
  doi: 10.1145/1007730.1007741
– volume: 24
  start-page: 136
  issue: 1
  year: 2012
  ident: 3411_CR31
  publication-title: Data Min Knowl Disc
  doi: 10.1007/s10618-011-0222-1
– volume: 80
  start-page: 551
  issue: 3
  year: 2018
  ident: 3411_CR65
  publication-title: J R Stat Soc Ser B Stat Methodol
  doi: 10.1111/rssb.12265
– volume: 81-82
  start-page: 67
  year: 2012
  ident: 3411_CR10
  publication-title: Data Knowl Eng
  doi: 10.1016/j.datak.2012.08.001
– volume-title: Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
  year: 2002
  ident: 3411_CR33
– volume: 73
  start-page: 753
  issue: 5
  year: 2011
  ident: 3411_CR43
  publication-title: J R Stat Soc Ser B Stat Methodol
  doi: 10.1111/j.1467-9868.2011.00783.x
– volume: 409–10
  start-page: 17
  year: 2017
  ident: 3411_CR45
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2017.05.008
– volume: 22
  start-page: 103
  issue: 2
  year: 2001
  ident: 3411_CR34
  publication-title: AI Mag
SSID ssj0017805
Score 2.4671817
Snippet Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional class-imbalanced...
Background Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional...
Abstract Background Feature selection in class-imbalance learning has gained increasing attention in recent years due to the massive growth of high-dimensional...
SourceID doaj
pubmedcentral
proquest
gale
pubmed
crossref
SourceType Open Website
Open Access Repository
Aggregation Database
Index Database
Enrichment Source
StartPage 121
SubjectTerms Algorithms
Analysis
Biological markers
Biomarkers
Class-imbalance learning
Classification
Computer simulation
Dimensional stability
Feature recognition
Feature selection
Gene expression
Genes
Hellinger distance
Learning
Methods
Preprocessing
Regularization
Sparse regularization
Support vector machines
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3di9QwEA9yIPgiftvzPKIIghAuadK0eTwPj1XQBz3h3kKTTPXgrntsdx_8751Ju8sWQV98bDMp7XwPmf6GsTemk3UKWJ0EpZIwbetEKLUTaOM6JtWE4Oh_589f7OK7-XRZXe6N-qKesBEeeGTcCaAZgAmyjjEZpTpXJmirpA3UHUbXXK1jzNsWU9P5ASH1T2eYqrEngyKcNkGlEnptJfQsCmWw_j9d8l5MmvdL7gWg8wfs_pQ58tPxjR-yO9A_YnfHWZK_HrO4gAyvDSueKCdEYQoKUYnjRbgGjq5jNQDvIEN58iEPwEGpcExbOaEWi0RI_yNKB4-UVYurm0CtjxGfQq2kT9jF-YeLs4WYJiiIWDmzFpVLDgvEpFsLHTK_lpWMpoxW6zKoFG3XBIsmXMYK8FEugkPByVZCHQBK_ZQd9MsenjOOaZM1sda02bShbWzluqCk66oQcGvB5JahPk7o4jTk4trnKqOxfpSBRxl4koHXBXu323I7Qmv8jfg9SWlHSKjY-Qbqip90xf9LVwr2mmTsCfeip8aaH-1mGPzHb1_9qVVYuTnMXgv2diLqlvgFsZ3-U0A-EFTWjPJoRomGGefLW1Xyk2MYPNqBIsSg0hTs1W6ZdlKzWw_LTabBRNximCrYs1Hzdt-N_hcz7gpX6plOzhgzX-mvfmbY8FpirW2aw__ByRfsXknWJLUo9RE7WK828BKzs3U4zob4G2uCOJM
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: Scholars Portal Journals: Open Access
  dbid: M48
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3fi9QwEA7nieCL-NvqKVEEQYimTZo2DyKneKzC-aB3cG-hSabnwdrV7S54_70zaXe94nGP28yUbSYz8w2dfsPYS93KKnqsTnyeR6GbxgpfKCvQx1WIee29pe-dD7-a2bH-clKe7LDNeKtxA_tLSzuaJ3W8nL_58_v8PTr8u-TwtXnb58TCJqgQwpicC3WNXcfEVJGfHup_LxWIvn98sXmp2iQ1JQb__-P0hUQ1baK8kJUObrNbI5zk-4P977Ad6O6yG8OAyfN7LMwgcW7DkkcCimhhQXkrcvzh58Axnix74C0kfk_ep6k4aCqOWJYTlbGIRP8_UHfwQFBbnP301A8Z8C7UX3qfHR18Ovo4E-NYBRFKq1eitNFi1RhVY6BFi1SylEEXwShV-DwG09beoF8XoQS8lQ1g0ZqykVB5gEI9YLvdooNHjCOWMjpUipR145valLb1ubRt6T2qZkxuNtSFkXKcJl_MXSo9auMGGzi0gSMbOJWx11uVXwPfxlXCH8hKW0Giyk4XFstTN3qeA4yjoL2sQoio1doiQlNGpaFqEZ7JjL0gGzsiw-io2-a0Wfe9-_z9m9s3OZZzFiFtxl6NQu0CnyA048cLuA_EnzWR3JtIoreG6fLmKLnNYXfoHDnRCBU6Y8-3y6RJHXAdLNZJBtG5wdyVsYfDyds-NwZlhOElrlSTMznZmOlKd_YjcYlXEgtwXT---m89YTcL8hOpRKH22O5quYanCMZW_llysb-DEjJ_
  priority: 102
  providerName: Scholars Portal
Title Hellinger distance-based stable sparse feature selection for high-dimensional class-imbalanced data
URI https://www.ncbi.nlm.nih.gov/pubmed/32293252
https://www.proquest.com/docview/2391274124
https://www.proquest.com/docview/2390166762
https://pubmed.ncbi.nlm.nih.gov/PMC7092448
https://doaj.org/article/e088e4b07ccd411f92dea5d34e7f6390
Volume 21
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3da9swEBdby2AvY9_z1gVvDAYDUcuSZetppKNZFmgZbQd5E9aHu0Jnd3HysP9-d7KS1Qz64pDoTsQ63Zd8_h0hH0STlc5AdmIYc1TUtaIm54qCjnPrWGWMwvedT07l_IdYLItlPHDrY1nl1iYGQ-06i2fkhzABQ6iVXHy--U2xaxQ-XY0tNO6TfYQuw5KucrlLuBji9ccnmayShz1DtDaKCRPYbkb5yBcFyP7_DfMtzzSumrzlhmaPyaMYP6bTQeBPyD3fPiUPho6Sf54RO_cBZNuvUoeRIYiUoqNyKXwx1z4FA7Lqfdr4AOiZ9qENDsgmheA1Rexi6hDvf8DqSC3G1vTql8ECSAuzYEHpc3IxO774MqexjwK1hRJrWiinIE10vJa-ARGUWZFZkVvJeW6Ys7KpjARFzm3hYSplvQLxZXXmS-N9zl-QvbZr_SuSQvAkhS05Mova1JUsVGNYpprCGGBNSLZdUG0jxji2urjWIdeopB5koEEGGmWgeUI-7VhuBoCNu4iPUEo7QsTGDj90q0sdVU17MJxemKy01gFXo3Ln68Jx4csG4rEsIe9RxhrRL1osr7msN32vv52f6alkkL8piGET8jESNR3cga3j2wqwDgiYNaI8GFGCetrx8HYr6Wgeev1vMyfk3W4YObHkrfXdJtBAOC7BWSXk5bDzdvcNVhji7gJGytGeHC3MeKS9-hnAw8sMMm5Rvb77b70hD3PUk4zTnB-QvfVq499C9LU2k6BicK1mXydkfzpdnC_g8-j49PvZJJxowPVEVH8BdEc1Yw
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLamIQQviDsZAwwCISFZs2PHiR8QGpepZZcHKFLfrPiSMWmkW9MK7UfxHzknScsipL3tsfVxFZ_7aY6_Q8hrVfE8OKhOnBCBqbI0zKXSMLBx6YMonDN43_nwSI9-qK_TbLpB_qzuwmBb5conto46zDz-R74DPyAQaiVVH87OGU6NwrerqxEanVrsx4vfULI178efQb5v0nTvy-TTiPVTBZjPjFqwzAQDRVOQpY4VPFDOM-5V6rWUqRPB66pwGtQ69Vn0MRgfDRyGlzzmLkbEOQCPfwPiLkeDyqfr-k7geID-xako9E4jEByOYX0GoUIwOQh97YSA_-PApUA4bNK8FPX27pI7fbpKdzv9ukc2Yn2f3OwGWF48IH4UW0zvOKcBE1HQIIZxMVD44E4jBX81byKtYosfSpt26g6oAoVcmSJUMgs4XqCDBqEeU3l28sthvyVwhWL_6kMyuQ4GPyKb9ayOTwiFXE0rn0vcrEpXFjozlRPcVJlzsDUhfMVQ63tIc5yscWrb0qbQtpOBBRlYlIGVCXm33nLW4XlcRfwRpbQmRCju9ovZ_Nj2lm0j-OmoHM-9D7CrMmmIZRakinkF6R9PyCuUsUWwjRq7eY7LZdPY8fdvdlcLKBcNpMwJedsTVTM4gS_7yxHAB8TnGlBuDyjBG_jh8kqVbO-NGvvPdhLycr2MO7HDro6zZUsD2b-G2JiQx53mrc8NTh_S_AxW8oFODhgzXKlPfrZY5TmHAl8VW1c_1gtyazQ5PLAH46P9p-R2ijbDJUvlNtlczJfxGSR-C_e8NTdK7DWb91_1Om1H
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=Hellinger+distance-based+stable+sparse+feature+selection+for+high-dimensional+class-imbalanced+data&rft.jtitle=BMC+bioinformatics&rft.au=Guang-Hui+Fu&rft.au=Yuan-Jiao%2C+Wu&rft.au=Min-Jie+Zong&rft.au=Pan%2C+Jianxin&rft.date=2020-03-23&rft.pub=BioMed+Central&rft.eissn=1471-2105&rft.volume=21&rft.spage=1&rft_id=info:doi/10.1186%2Fs12859-020-3411-3
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