{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:37:20Z","timestamp":1773225440546,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012165","name":"key technologies research and development program","doi-asserted-by":"publisher","award":["2019YFC0121502"],"award-info":[{"award-number":["2019YFC0121502"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Gene expression profile data have high-dimensionality with a small number of samples. These data characteristics lead to a long training time and low performance in predictive model construction. To address this issue, the paper proposes a feature selection algorithm using non-dominant feature-guide search. The algorithm adopts a filtering framework based on feature sorting and search strategy to overcome the problems of long training time and poor performance. First, the feature pre-selection is completed according to the calculated feature category correlation. Second, a multi-objective optimization feature selection model is constructed. Non-dominant features are defined according to the Pareto dominance theory. Combined with the bidirectional search strategy, the Pareto dominance features under the current category maximum relevance feature are removed one by one. Finally, the optimal feature subset with maximum correlation and minimum redundancy is obtained. Experimental results on six gene expression data sets show that the algorithm is much better than Fisher score, maximum information coefficient, composition of feature relevancy, mini-batch K-means normalized mutual information feature inclusion, and max-Relevance and Min-Redundancy algorithms. Compared to feature selection method based on maximum information coefficient and approximate Markov blanket, the algorithm not only has high computational efficiency but also can obtain better classification capabilities in a smaller dimension.<\/jats:p>","DOI":"10.1007\/s40747-023-01039-x","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T09:03:20Z","timestamp":1682499800000},"page":"6139-6153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Feature selection using non-dominant features-guided search for gene expression profile data"],"prefix":"10.1007","volume":"9","author":[{"given":"Xiaoying","family":"Pan","sequence":"first","affiliation":[]},{"given":"Jun","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Huimin","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Yufeng","family":"Xue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"issue":"8","key":"1039_CR1","first-page":"1599","volume":"40","author":"PK Ram","year":"2019","unstructured":"Ram PK, Kuila P (2019) Feature selection from microarray data: genetic algorithm based approach[J]. J Inform Optim Sci 40(8):1599\u20131610","journal-title":"J Inform Optim Sci"},{"issue":"4","key":"1039_CR2","doi-asserted-by":"publisher","first-page":"1550018","DOI":"10.1142\/S0219720015500183","volume":"13","author":"K Lim","year":"2015","unstructured":"Lim K, Li Z, Choi KP, Wong L (2015) A quantum leap in the reproducibility, precision, and sensitivity of gene expression profile analysis even when sample size is extremely small [J]. J Bioinform Computational Biol 13(4):1550018\u20131550018","journal-title":"J Bioinform Computational Biol"},{"issue":"5","key":"1039_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3340848","volume":"13","author":"Y Xue","year":"2019","unstructured":"Xue Y, Xue B, Zhang M (2019) Self-adaptive particle swarm optimization for large-scale feature selection in classification[J]. ACM Trans Knowl Discov from Data (TKDD) 13(5):1\u201327","journal-title":"ACM Trans Knowl Discov from Data (TKDD)"},{"issue":"1","key":"1039_CR4","first-page":"78","volume":"1","author":"MA Hambali","year":"2020","unstructured":"Hambali MA, Oladele TO, Adewole KS (2020) Microarray cancer feature selection: review, challenges and research directions[J]. Int J Cogn Computing Eng 1(1):78\u201397","journal-title":"Int J Cogn Computing Eng"},{"key":"1039_CR5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.inffus.2018.11.019","volume":"50","author":"Z Rui","year":"2019","unstructured":"Rui Z, Feiping N et al (2019) Feature selection with multi-view data: a survey ScienceDirect[J]. Int J Inform Fusion 50:158\u2013167","journal-title":"Int J Inform Fusion"},{"key":"1039_CR6","doi-asserted-by":"crossref","unstructured":"Manikandan G, Susi E, Abirami S (2019) Flexible-fuzzy mutual information based feature selection on high dimensional data[C]\/\/2018 Tenth International Conference on Advanced Computing (ICoAC). IEEE","DOI":"10.1109\/ICoAC44903.2018.8939115"},{"issue":"1","key":"1039_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.knosys.2018.01.002","volume":"145","author":"S Nakariyakul","year":"2018","unstructured":"Nakariyakul S (2018) High-dimensional hybrid feature selection using interaction information-guided search[J]. Knowl-Based Syst 145(1):59\u201366","journal-title":"Knowl-Based Syst"},{"issue":"8","key":"1039_CR8","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng H, Long F, Ding C (2005) Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy[J]. IEEE Trans Pattern Anal Mach Intell 27(8):1226\u20131238","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"12","key":"1039_CR9","first-page":"1205","volume":"5","author":"L Yu","year":"2004","unstructured":"Yu L, Liu H (2004) Eficient feature selection via analysis of relevance and redundancy[J]. J Mach Learn Res 5(12):1205\u20131224","journal-title":"J Mach Learn Res"},{"issue":"5","key":"1039_CR10","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1109\/TCYB.2016.2539338","volume":"47","author":"T Gao","year":"2016","unstructured":"Gao T, Ji Q (2016) Efficient Markov blanket discovery and its application[J]. IEEE Trans Cybern 47(5):1169\u20131179","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"1039_CR11","doi-asserted-by":"publisher","first-page":"42","DOI":"10.3390\/computers8020042","volume":"8","author":"I Jo","year":"2019","unstructured":"Jo I, Lee S, Sejong Oh (2019) Improved measures of redundancy and relevance for mRMR feature selection[J]. Computers 8(2):42\u201342","journal-title":"Computers"},{"issue":"8","key":"1039_CR12","doi-asserted-by":"publisher","first-page":"139512","DOI":"10.1109\/ACCESS.2020.3012768","volume":"8","author":"S Li","year":"2020","unstructured":"Li S et al (2020) Feature selection for high dimensional data using weighted K-nearest neighbors and genetic algorithm. IEEE Access 8(8):139512\u2013139528","journal-title":"IEEE Access"},{"issue":"26","key":"1039_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.neucom.2017.11.077","volume":"300","author":"J Cai","year":"2018","unstructured":"Cai J, Luo J, Wang S et al (2018) Feature selection in machine learning: a new perspective[J]. Neurocomputing 300(26):70\u201379","journal-title":"Neurocomputing"},{"key":"1039_CR14","doi-asserted-by":"crossref","unstructured":"Kira K, Rendell LA (1992) A practical approach to feature selection[J]. Proceedings of the Ninth International Workshop on Machine Learning (ML 1992), Aberdeen, Scotland, UK, July 1\u20133","DOI":"10.1016\/B978-1-55860-247-2.50037-1"},{"key":"1039_CR15","doi-asserted-by":"crossref","unstructured":"Robnik-\u0160ikonja M, Kononenko I (2003) Theoretical and empirical analysis of ReliefF and RReliefF[J]. Mach Learn, 53(1\u20132)","DOI":"10.1023\/A:1025667309714"},{"key":"1039_CR16","unstructured":"Gu Q, Li Z, Han J (2012) Generalized fisher score for feature selection[J]"},{"issue":"6062","key":"1039_CR17","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1205438","volume":"334","author":"DN Reshef","year":"2011","unstructured":"Reshef DN, Reshef YA, Finucane HK et al (2011) Detecting novel associations in large data sets[J]. Science 334(6062):1518\u20131524","journal-title":"Science"},{"key":"1039_CR18","unstructured":"Hall MA (2000) Correlation-based feature selection for discrete and numeric class machine learning. 359\u2212366"},{"key":"1039_CR19","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.patrec.2018.06.005","volume":"112","author":"W Gao","year":"2018","unstructured":"Gao W, Liang Hu, Zhang P, He J (2018) Feature selection considering the composition of feature relevancy[J]. Pattern Recogn Lett 112:70\u201374","journal-title":"Pattern Recogn Lett"},{"issue":"2","key":"1039_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TNN.2008.2005601","volume":"20","author":"PA Estevez","year":"2009","unstructured":"Estevez PA, Tesmer M, Perez CA et al (2009) Normalized mutual information feature selection[J]. IEEE Trans Neural Netw 20(2):189\u2013201","journal-title":"IEEE Trans Neural Netw"},{"issue":"3","key":"1039_CR21","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1109\/TKDE.2010.263","volume":"24","author":"K Javed","year":"2012","unstructured":"Javed K, Babri HA, Saeed M (2012) Feature selection based on class-dependent densities for high-dimensional binary data[J]. IEEE Trans Knowl Data Eng 24(3):465\u2013477","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"05","key":"1039_CR22","first-page":"795","volume":"43","author":"G Sun","year":"2017","unstructured":"Sun G, Song Z, Liu J et al (2017) Feature selection method based on maximum information coefficient and approximate markov blanket[J]. Acta Automatica Sinica (in Chinese) 43(05):795\u2013805","journal-title":"Acta Automatica Sinica (in Chinese)"},{"issue":"10","key":"1039_CR23","first-page":"141","volume":"52","author":"L Zhang","year":"2018","unstructured":"Zhang L, Wang C et al (2018) A feature selection algorithm for maximum relevance minimum redundancy using approximate markov blanket[J]. J Xi\u2019an Jiaotong Univ (in Chinese) 52(10):141\u2013145","journal-title":"J Xi\u2019an Jiaotong Univ (in Chinese)"},{"issue":"99","key":"1039_CR24","doi-asserted-by":"publisher","first-page":"116875","DOI":"10.1109\/ACCESS.2019.2936346","volume":"7","author":"GS Thejas","year":"2019","unstructured":"Thejas GS, Joshi SR, Iyengar SS et al (2019) Mini-batch normalized mutual information: a hybrid feature selection method[J]. IEEE Access 7(99):116875\u2013116885","journal-title":"IEEE Access"},{"issue":"6","key":"1039_CR25","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1109\/TSMCB.2012.2227469","volume":"43","author":"B Xue","year":"2013","unstructured":"Xue B, Zhang MJ, Browne WN (2013) Particle swarm optimization for feature selection in classification: a multi-objective approach[J]. IEEE Trans Cybern 43(6):1656\u20131671","journal-title":"IEEE Trans Cybern"},{"issue":"532","key":"1039_CR26","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2020.05.004","volume":"532","author":"Yu Zhou","year":"2020","unstructured":"Zhou Yu, Kang J, Guo H (2020) Many-objective optimization of feature selection based on two-level particle cooperation[J]. Inf Sci 532(532):91\u2013109","journal-title":"Inf Sci"},{"issue":"8","key":"1039_CR27","doi-asserted-by":"publisher","first-page":"2816","DOI":"10.3390\/app10082816","volume":"10","author":"S Saha","year":"2020","unstructured":"Saha S, Ghosh M, Ghosh S, Sen S, Singh PK, Geem ZW, Sarkar R (2020) Feature selection for facial emotion recognition using cosine similarity-based harmony search algorithm[J]. Appl Sci 10(8):2816","journal-title":"Appl Sci"},{"issue":"2","key":"1039_CR28","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0056823","volume":"8","author":"V Walter","year":"2013","unstructured":"Walter V, Yin X, Wilkerson MD et al (2013) Molecular subtypes in head and neck cancer exhibit distinct patterns of chromosomal gain and loss of canonical cancer genes[J]. PLoS ONE 8(2):e56823","journal-title":"PLoS ONE"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01039-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01039-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01039-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T19:12:03Z","timestamp":1698433923000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01039-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1039"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01039-x","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"1 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}