{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T02:18:16Z","timestamp":1781144296507,"version":"3.54.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T00:00:00Z","timestamp":1510876800000},"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":["Pattern Anal Applic"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10044-017-0668-x","type":"journal-article","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T08:52:44Z","timestamp":1510908764000},"page":"615-631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An approach of feature selection using graph-theoretic heuristic and hill climbing"],"prefix":"10.1007","volume":"22","author":[{"given":"Saptarsi","family":"Goswami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amit Kumar","family":"Das","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Priyanka","family":"Guha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arunabha","family":"Tarafdar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjay","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amlan","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Basabi","family":"Chakraborty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"issue":"1","key":"668_CR1","first-page":"1371","volume":"15","author":"M Tan","year":"2014","unstructured":"Tan M, Tsang IW, Wang L (2014) Towards ultrahigh dimensional feature selection for big data. J Mach Learn Res 15(1):1371\u20131429","journal-title":"J Mach Learn Res"},{"issue":"11","key":"668_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.5815\/ijitcs.2014.11.10","volume":"6","author":"S Goswami","year":"2014","unstructured":"Goswami S, Chakrabarti A (2014) Feature selection: a practitioner view. IJITCS 6(11):66\u201377. https:\/\/doi.org\/10.5815\/ijitcs.2014.11.10","journal-title":"IJITCS"},{"key":"668_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-016-0565-8","author":"Z Dehghan","year":"2016","unstructured":"Dehghan Z, Mansoori EG (2016) A new feature subset selection using bottom-up clustering. Pattern Anal Appl. https:\/\/doi.org\/10.1007\/s10044-016-0565-8","journal-title":"Pattern Anal Appl"},{"issue":"2","key":"668_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10044-008-0139-5","volume":"13","author":"H Liu","year":"2010","unstructured":"Liu H, Motoda H (2010) Computational methods of feature selection. Pattern Anal Appl 13(2):247\u2013249. https:\/\/doi.org\/10.1007\/s10044-008-0139-5","journal-title":"Pattern Anal Appl"},{"key":"668_CR5","first-page":"1","volume-title":"Feature selection for classification: a review, data classification: algorithms and applications","author":"J Tang","year":"2014","unstructured":"Tang J, Alelyani S, Liu H (2014) Feature selection for classification: a review, data classification: algorithms and applications. CRC Press, Boca Raton, pp 1\u201338"},{"issue":"8","key":"668_CR6","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1007\/s00521-015-1840-0","volume":"26","author":"HH Inbarani","year":"2015","unstructured":"Inbarani HH, Bagyamathi M, Azar AT (2015) A novel hybrid feature selection method based on rough set and improved harmony search. Neural Comput Appl 26(8):1859\u20131880. https:\/\/doi.org\/10.1007\/s00521-015-1840-0","journal-title":"Neural Comput Appl"},{"issue":"9","key":"668_CR7","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1057\/palgrave.jors.2601976","volume":"56","author":"Y Liu","year":"2005","unstructured":"Liu Y, Schumann M (2005) Data mining feature selection for credit scoring models. J Oper Res Soc 56(9):1099\u20131108. https:\/\/doi.org\/10.1057\/palgrave.jors.2601976","journal-title":"J Oper Res Soc"},{"key":"668_CR8","first-page":"28","volume":"7","author":"S Goswami","year":"2015","unstructured":"Goswami S, Saha S, Chakravorty S, Chakrabarti A, Chakraborty B (2015) A new evaluation measure for feature subset selection with genetic algorithm. Int J Intell Syst Appl 7:28\u201336","journal-title":"Int J Intell Syst Appl"},{"key":"668_CR9","unstructured":"Gent IP, Walsh T (1993) Towards an understanding of hill-climbing procedures for SAT. In: 11th National Conference on Artificial Intelligence (AAAI), vol 93. Vancouver, pp 28\u201333"},{"key":"668_CR10","doi-asserted-by":"crossref","unstructured":"Wang R, Youssef AM, Elhakeem AK (2006) On some feature selection strategies for spam filter design. In: IEEE Canadian Conference in Electrical and Computer Engineering (CCECE\u201906), pp 2186\u20132189","DOI":"10.1109\/CCECE.2006.277770"},{"key":"668_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.eswa.2017.01.044","volume":"79","author":"S Goswami","year":"2017","unstructured":"Goswami S, Das AK, Chakraborty B, Chakrabarti A (2017) A feature cluster taxonomy based feature selection technique. Exp Syst Appl 79:76\u201389. https:\/\/doi.org\/10.1016\/j.eswa.2017.01.044","journal-title":"Exp Syst Appl"},{"key":"668_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.eswa.2017.06.032","volume":"88","author":"AK Das","year":"2017","unstructured":"Das AK, Goswami S, Chakrabarti A, Chakraborty B (2017) A new hybrid feature selection approach using feature association map for supervised and unsupervised classification. Exp Syst Appl 88:81\u201394","journal-title":"Exp Syst Appl"},{"key":"668_CR13","doi-asserted-by":"publisher","unstructured":"Zhang Z, Hancock ER (2011) A graph-based approach to feature selection. In: International Workshop on Graph-Based Representations in Pattern Recognition (GBRPR). 6658:205\u2013214. https:\/\/doi.org\/10.1007\/978-3-642-20844-7-21","DOI":"10.1007\/978-3-642-20844-7-21"},{"issue":"1","key":"668_CR14","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TKDE.2011.181","volume":"25","author":"Q Song","year":"2013","unstructured":"Song Q, Ni J, Wang G (2013) A fast clustering-based feature subset selection algorithm for high-dimensional data. IEEE Trans Knowl Data Eng 25(1):114. https:\/\/doi.org\/10.1109\/TKDE.2011.181","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"668_CR15","unstructured":"Mandal M, Mukhopadhyay A (2012) Unsupervised non-redundant feature selection: a graph-theoretic approach. In: International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA). Springer, Berlin, pp 373\u2013380"},{"key":"668_CR16","doi-asserted-by":"crossref","unstructured":"Das AK, Goswami S, Chakraborty B, Chakrabarti A (2017) A graph theoretic approach for visualization of data set feature association. In: 3rd International Doctoral Symposium in Advanced Computing and Systems for Security. Springer, Berlin, pp 109\u2013124","DOI":"10.1007\/978-981-10-3391-9_7"},{"key":"668_CR17","doi-asserted-by":"publisher","unstructured":"Ishii M, Sato A (2013) Feature selection using graph cuts based on relevance and redundancy. In: 20th IEEE International Conference on Image Processing (ICIP), Melbourne, Australia. https:\/\/doi.org\/10.1109\/ICIP.2013.6738884","DOI":"10.1109\/ICIP.2013.6738884"},{"issue":"3","key":"668_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/34.990133","volume":"24","author":"P Mitra","year":"2002","unstructured":"Mitra P, Murthy CA, Pal SK (2002) Unsupervised feature selection using feature similarity. IEEE Trans Pattern Anal Mach Intell 24(3):301\u2013312","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"668_CR19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10044-014-0408-4","volume":"19","author":"Y Liu","year":"2016","unstructured":"Liu Y, Wang Y, Feng L, Zhu X (2016) Term frequency combined hybrid feature selection method for spam filtering. Pattern Anal Appl 19(2):369\u2013383. https:\/\/doi.org\/10.1007\/s10044-014-0408-4","journal-title":"Pattern Anal Appl"},{"key":"668_CR20","unstructured":"Britto AD, Kaestner CA, Nunes CM, Sabourin R (2004) An optimized hill climbing algorithm for feature subset selection: evaluation on handwritten character recognition. In: Proceedings of the Ninth IEEE International Workshop on Frontiers in Handwriting Recognition (IWFHR-9 2004)"},{"key":"668_CR21","doi-asserted-by":"crossref","unstructured":"Malakasiotis P (2009) Paraphrase recognition using machine learning to combine similarity measures. In: Proceedings of the ACL-IJCNLP Student Research Workshop Association for Computational Linguistics, pp 27\u201335","DOI":"10.3115\/1667884.1667889"},{"key":"668_CR22","doi-asserted-by":"publisher","unstructured":"Skalak DB (1994) Prototype and feature selection by sampling and random mutation hill climbing algorithms. In: 9th IEEE International Workshop on Frontiers in Handwriting Recognition (ICML), Tokyo, Japan. https:\/\/doi.org\/10.1109\/IWFHR.2004.18","DOI":"10.1109\/IWFHR.2004.18"},{"key":"668_CR23","doi-asserted-by":"publisher","unstructured":"Wang GY, Zhao J (2004) Theoretical study on attribute reduction of rough set theory: comparison of algebra and information views. In: Proceedings of the 3rd IEEE International Conference on Cognitive Informatics. https:\/\/doi.org\/10.1109\/COGINF.2004.1327470","DOI":"10.1109\/COGINF.2004.1327470"},{"issue":"1","key":"668_CR24","first-page":"41","volume":"16","author":"K Hu","year":"2003","unstructured":"Hu K, Lu YC, Shi CY (2003) Feature ranking in rough sets. AI Commun Spec Issue Artif Intell 16(1):41\u201350","journal-title":"AI Commun Spec Issue Artif Intell"},{"key":"668_CR25","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.knosys.2015.04.007","volume":"84","author":"P Moradi","year":"2015","unstructured":"Moradi P, Rostami M (2015) Integration of graph clustering with ant colony optimization for feature selection. Knowl Based Syst 84:144\u2013161. https:\/\/doi.org\/10.1016\/j.knosys.2015.04.007","journal-title":"Knowl Based Syst"},{"key":"668_CR26","unstructured":"Diestel R (2012) Graph theory, graduate texts in mathematics, 4th edn"},{"key":"668_CR27","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.engappai.2015.05.005","volume":"44","author":"P Moradi","year":"2015","unstructured":"Moradi P, Rostami M (2015) A graph theoretic approach for unsupervised feature selection. Eng Appl AI 44:33\u201345","journal-title":"Eng Appl AI"},{"key":"668_CR28","unstructured":"Hall MA (2000) Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning. In: Proceedings of the Seventeenth International Conference on Machine Learning (ICML), pp 359\u2013366"},{"key":"668_CR29","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon N, Babai L, Itai A (1986) A fast and simple randomized parallel algorithm for the maximal independent set problem. J Algorithms 7:567\u2013583","journal-title":"J Algorithms"},{"key":"668_CR30","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1985","unstructured":"Luby M (1985) A simple parallel algorithm for the maximal independent set problem. SIAM J Comput 15:1036\u20131053","journal-title":"SIAM J Comput"},{"key":"668_CR31","unstructured":"Rao AM, Sadhukhan K, Yadav T (2016) Approximation algorithm for N-distance minimal vertex cover problem. CoRR, abs\/1606.02889"},{"key":"668_CR32","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/72.298224","volume":"5","author":"R Battiti","year":"1994","unstructured":"Battiti R (1994) Using mutual information for selecting features in supervised neural net learning. IEEE Trans Neural Netw 5:537\u2013550","journal-title":"IEEE Trans Neural Netw"},{"key":"668_CR33","doi-asserted-by":"publisher","unstructured":"Oliveira RB, Papa JP, Pereira AS, Tavares JM (2016) Computational methods for pigmented skin lesion classification in images: review and future trends. Neural Comput Appl 1\u201324. https:\/\/doi.org\/10.1007\/s00521-016-2482-6","DOI":"10.1007\/s00521-016-2482-6"},{"key":"668_CR34","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.eswa.2017.05.003","volume":"84","author":"Z Ma","year":"2017","unstructured":"Ma Z, Tavares JM (2017) Effective features to classify skin lesions in dermoscopic images. Exp Syst Appl 84:92\u2013101","journal-title":"Exp Syst Appl"},{"key":"668_CR35","unstructured":"Bache K, Lichman M (2013) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml . Accessed 18 July 2017"},{"key":"668_CR36","first-page":"255","volume":"17","author":"J Alcal\u00e1-Fdez","year":"2011","unstructured":"Alcal\u00e1-Fdez J, Derrac J, Fern\u00e1ndez A, Garc\u00eda S, Luengo J (2011) KEEL data-mining software tool: data set repository, integration of algorithms and experimental analysis framework. Mult Valued Log Soft Comput 17:255\u2013287","journal-title":"Mult Valued Log Soft Comput"},{"key":"668_CR37","unstructured":"R Core Team (2013) R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria. ISBN 3-900051-07-0. http:\/\/www.R-project.org\/ . Accessed 18 July 2017"},{"key":"668_CR38","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/5254.671091","volume":"13","author":"V Honavar","year":"1998","unstructured":"Honavar V, Yang J (1998) Feature subset selection using a genetic algorithm. IEEE Intell Syst 13:44\u201349","journal-title":"IEEE Intell Syst"},{"key":"668_CR39","unstructured":"Taylor BM (2013) miscFuncs: miscellaneous useful functions. R package version 1.2-4. http:\/\/CRAN.R-project.org\/package=miscFuncs . Accessed 18 July 2017"},{"key":"668_CR40","unstructured":"Hausser J, Strimmer K (2012) entropy: entropy and mutual information estimation. R package version 1.1.7. http:\/\/CRAN.R-project.org\/package=entropy . Accessed 18 July 2017"},{"key":"668_CR41","unstructured":"Atkinson EJ,\u00a0Therneau TM (1980) An introduction to recursive partitioning using the RPART routines"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-017-0668-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-017-0668-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-017-0668-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T08:19:09Z","timestamp":1570349949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-017-0668-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,17]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["668"],"URL":"https:\/\/doi.org\/10.1007\/s10044-017-0668-x","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,17]]},"assertion":[{"value":"9 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}