{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T14:16:42Z","timestamp":1775312202677,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. &amp; Cyber."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s13042-018-0869-7","type":"journal-article","created":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T13:49:42Z","timestamp":1535982582000},"page":"2313-2328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Filter-based unsupervised feature selection using Hilbert\u2013Schmidt independence criterion"],"prefix":"10.1007","volume":"10","author":[{"given":"Samaneh","family":"Liaghat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eghbal G.","family":"Mansoori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"key":"869_CR1","first-page":"12051224","volume":"5","author":"L Yu","year":"2004","unstructured":"Yu L, Liu H (2004) Efficient feature selection via analysis of relevance and redundancy. J Mach Learn Res 5:1205\u20131224","journal-title":"J Mach Learn Res"},{"issue":"3","key":"869_CR2","first-page":"75464","volume":"9","author":"A Sharma","year":"2012","unstructured":"Sharma A, Imoto S, Miyano S (2012) A top-r feature selection algorithm for microarray gene expression data. IEEE\/ACM Trans Comput Biol Bioinform 9(3):754\u201364","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"4","key":"869_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s13042-011-0061-9","volume":"3","author":"A Sharma","year":"2012","unstructured":"Sharma A, Imoto S, Miyano S, Sharma V (2012) Null space based feature selection method for gene expression data. Int J Mach Learn Cybern 3(4):269\u2013276","journal-title":"Int J Mach Learn Cybern"},{"issue":"5","key":"869_CR4","doi-asserted-by":"publisher","first-page":"1250010","DOI":"10.1142\/S0219720012500102","volume":"10","author":"A Sharma","year":"2012","unstructured":"Sharma A, Imoto S, Miyano S (2012) A between-class overlapping filter-based method for transcriptome data analysis. J Bioinform Comput Biol 10(5):1250010","journal-title":"J Bioinform Comput Biol"},{"key":"869_CR5","first-page":"845889","volume":"5","author":"J Dy","year":"2004","unstructured":"Dy J, Brodley C (2004) Feature selection for unsupervised learning. J Mach Learn Res 5:845\u2013889","journal-title":"J Mach Learn Res"},{"key":"869_CR6","unstructured":"Shang R, Chang J, Jiao L, Xue Y (2017) Unsupervised feature selection based on self-representation sparse regression and local similarity preserving. Int J Mach Learn Cybern 1\u201314"},{"key":"869_CR7","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1016\/j.compeleceng.2013.11.024","volume":"40","author":"G Chandrashekar","year":"2014","unstructured":"Chandrashekar G, Sahin F (2014) A survey on feature selection methods. Comput Electr Eng 40:16\u201328","journal-title":"Comput Electr Eng"},{"key":"869_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-35488-8","volume-title":"Feature extraction: foundations and applications","author":"I Guyon","year":"2006","unstructured":"Guyon I, Gunn S, Nikravesh M, Zadeh LA (2006) Feature extraction: foundations and applications, vol\u00a0207. Springer, Berlin, pp\u00a089\u2013117"},{"issue":"8","key":"869_CR9","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-redundance. IEEE Trans Pattern Anal Mach Intell 27(8):1226\u20131238","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"869_CR10","first-page":"11571182","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon I, Elisseeff A (2003) An introduction to variable and feature selection. J Mach Learn Res 3:1157\u20131182","journal-title":"J Mach Learn Res"},{"key":"869_CR11","first-page":"2766","volume":"13","author":"G Brown","year":"2012","unstructured":"Brown G, Pocock A, Zhao M, Lujan M (2012) Conditional likelihood maximization: a unifying framework for information theoretic feature selection. J Mach Learn Res 13:27\u201366","journal-title":"J Mach Learn Res"},{"key":"869_CR12","first-page":"111121","volume-title":"Adapt the mRMR criterion for unsupervised feature selection. Advanced data mining and applications","author":"I Xu","year":"2010","unstructured":"Xu I, Cao L, Zhong J, Feng Y (2010) Adapt the mRMR criterion for unsupervised feature selection. Advanced data mining and applications. Springer, Berlin, pp\u00a0111\u2013121"},{"key":"869_CR13","doi-asserted-by":"crossref","unstructured":"Gretton A, Bousquet O, Smola AJ, Scholkopf B (2005) Measuring statistical dependence with Hilbert\u2013Schmidt norms. In: Jain S, Simon HU, Tomita E (eds) Proceedings of the international conference on algorithmic learning theory, Springer, pp\u00a063\u201377","DOI":"10.1007\/11564089_7"},{"key":"869_CR14","unstructured":"Zarkoob H (2010) Feature selection for gene expression data based on Hilbert\u2013Schmidt independence criterion. University of Waterloo, Electronic theses and dissertations"},{"key":"869_CR15","first-page":"288","volume-title":"Microarray design using the Hilbert\u2013Schmidt independence criterion","author":"I Bedo","year":"2008","unstructured":"Bedo I, Chetty M, Ngom A, Ahmad S (2008) Microarray design using the Hilbert\u2013Schmidt independence criterion. Springer, Berlin, pp\u00a0288\u2013298"},{"key":"869_CR16","first-page":"13931434","volume":"13","author":"I Song","year":"2012","unstructured":"Song I, Smola A, Gretton A, Bedo J, Borgwardt K (2012) Feature selection via dependence maximization. J Mach Learn Res 13:1393\u20131434","journal-title":"J Mach Learn Res"},{"issue":"2","key":"869_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10115-012-0538-1","volume":"35","author":"AK Farahat","year":"2013","unstructured":"Farahat AK, Ghodsi A, Kamel MS (2013) Efficient greedy feature selection for unsupervised learning. Knowl Inf Syst 35(2):285\u2013310","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"869_CR18","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s00138-013-0577-y","volume":"25","author":"A Sharma","year":"2014","unstructured":"Sharma A, Paliwal KK, Imoto S, Miyano S (2014) A feature selection method using improved regularized linear discriminant analysis. Mach Vis Appl 25(3):775\u2013786","journal-title":"Mach Vis Appl"},{"key":"869_CR19","unstructured":"Eskandari S, Akbas E (2017) Supervised infinite feature selection. arXiv Prepr. http:\/\/arxiv.org\/abs\/1704.02665"},{"issue":"4","key":"869_CR20","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1109\/TNNLS.2017.2650978","volume":"29","author":"I Luo","year":"2018","unstructured":"Luo I, Nie F, Chang X, Yang Y, Hauptmann AG, Zheng Q (2018) Adaptive unsupervised feature selection with structure regularization. IEEE Trans Neural Netw Learn Syst 29(4):944\u2013956","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"2","key":"869_CR21","first-page":"391","volume":"55","author":"I Weston","year":"2003","unstructured":"Weston I, Scholkopf B, Eskin E, Leslie C, Noble W (2003) Dealing with large diagonals in kernel matrices. Inst Stat Math 55(2):391\u2013408","journal-title":"Inst Stat Math"},{"key":"869_CR22","first-page":"89","volume":"16","author":"A Fischer","year":"2003","unstructured":"Fischer A, Roth V, Buhmann JM (2003) Clustering with the connectivity Kernel. Adv Neural Inf Process Syst 16:89\u201396","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"869_CR23","doi-asserted-by":"publisher","first-page":"411423","DOI":"10.1111\/1467-9868.00293","volume":"63","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani R, Walther G, Hastie T (2001) Estimating the number of clusters in a data set via the gap statistic. J R Stat Soc Ser B 63(2):411\u2013423","journal-title":"J R Stat Soc Ser B"},{"key":"869_CR24","unstructured":"McQueen I (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of fifth Berkeley symposium, math statistics and probability, pp\u00a0281\u2013297"},{"key":"869_CR25","doi-asserted-by":"publisher","first-page":"11571163","DOI":"10.1016\/S0167-8655(99)00083-5","volume":"20","author":"P Somol","year":"1999","unstructured":"Somol P, Pudil P, Novovicova J, Paclik P (1999) Adaptive floating search methods in feature selection. Pattern Recognit Lett 20:1157\u20131163","journal-title":"Pattern Recognit Lett"},{"key":"869_CR26","unstructured":"UCI Machine Learning Repository. https:\/\/archive.ics.uci.edu\/ml\/datasets . Accessed Feb 2017"},{"issue":"16","key":"869_CR27","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1093\/bioinformatics\/btm312","volume":"23","author":"I Mramor","year":"2007","unstructured":"Mramor I, Leban G, Demsar J, Zupan B (2007) Visualization-based cancer microarray data classification analysis. Bioinformatics 23(16):2147\u20132154","journal-title":"Bioinformatics"},{"key":"869_CR28","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","volume-title":"Learning with kernels: support vector machines, regularization, optimization, and beyond","author":"A Scholkopf","year":"2001","unstructured":"Scholkopf A, Smola AJ (2001) Learning with kernels: support vector machines, regularization, optimization, and beyond. MIT Press, Cambridge"},{"key":"869_CR29","first-page":"163167","volume":"35","author":"S Lin","year":"2007","unstructured":"Lin S, Liu Z (2007) Parameter selection of support vector machines based on RBF kernel function. Zhejiang Univ Technol 35:163\u2013167","journal-title":"Zhejiang Univ Technol"},{"key":"869_CR30","unstructured":"Ester I, Kriegel H, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of KDD, vol 96, pp\u00a0226\u2013231"},{"key":"869_CR31","volume-title":"Introductory mathematical statistics","author":"A Kreyszig","year":"1970","unstructured":"Kreyszig A (1970) Introductory mathematical statistics. Wiley, New York"},{"key":"869_CR32","doi-asserted-by":"publisher","first-page":"193218","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabic P (1985) Comparing partitions. J Classif 2:193\u2013218","journal-title":"J Classif"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-018-0869-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-018-0869-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-018-0869-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T22:10:50Z","timestamp":1720563050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-018-0869-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":32,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["869"],"URL":"https:\/\/doi.org\/10.1007\/s13042-018-0869-7","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,3]]},"assertion":[{"value":"15 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}