{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T05:02:11Z","timestamp":1768626131094,"version":"3.49.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031157394","type":"print"},{"value":"9783031157400","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15740-0_24","type":"book-chapter","created":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T23:03:43Z","timestamp":1661727823000},"page":"330-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Feature Ranking from\u00a0Random Forest Through Complex Network\u2019s Centrality Measures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0939-4870","authenticated-orcid":false,"given":"Adriano Henrique","family":"Cant\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5271-3086","authenticated-orcid":false,"given":"Alessandra Alaniz","family":"Macedo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1502-6604","authenticated-orcid":false,"given":"Liang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7501-7187","authenticated-orcid":false,"given":"Jos\u00e9 Augusto","family":"Baranauskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397 (2002). https:\/\/doi.org\/10.1103\/RevModPhys.74.47","journal-title":"Rev. Mod. Phys."},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/s10489-017-1008-y","volume":"48","author":"JA Baranauskas","year":"2017","unstructured":"Baranauskas, J.A., Netto, O.P., Nozawa, S.R., Macedo, A.A.: A tree-based algorithm for attribute selection. Appl. Intell. 48(4), 821\u2013833 (2017). https:\/\/doi.org\/10.1007\/s10489-017-1008-y","journal-title":"Appl. Intell."},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Bertini, J.R., Zhao, L., Lopes, A.A.: An incremental learning algorithm based on the k-associated graph for non-stationary data classification. Inf. Sci. 246(Supplement C), 52\u201368 (2013). https:\/\/doi.org\/10.1016\/j.ins.2013.05.016","DOI":"10.1016\/j.ins.2013.05.016"},{"issue":"5","key":"24_CR4","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170\u20131182 (1987). https:\/\/doi.org\/10.1086\/228631","journal-title":"Am. J. Sociol."},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123\u2013140 (1996). https:\/\/doi.org\/10.1007\/BF00058655","DOI":"10.1007\/BF00058655"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mac. Learn. 45(1), 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mac. Learn."},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"Breiman, L., Friedman, J., Olshen, R., Stone, C.: Classification and Regression Trees. Wadsworth & Books, Pacific Grove (1984). https:\/\/doi.org\/10.1201\/9781315139470","DOI":"10.1201\/9781315139470"},{"key":"24_CR8","doi-asserted-by":"publisher","unstructured":"Cacciatore, S., Tenori, L., Luchinat, C., Bennett, P.R., MacIntyre, D.A.: KODAMA: an R package for knowledge discovery and data mining. Bioinformatics 33(4), 621\u2013623 (2016). https:\/\/doi.org\/10.1093\/bioinformatics\/btw705","DOI":"10.1093\/bioinformatics\/btw705"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.compeleceng.2013.11.024","volume":"40","author":"G Chandrashekar","year":"2014","unstructured":"Chandrashekar, G., Sahin, F.: A survey on feature selection methods. Comput. Electr. Eng. 40(1), 16\u201328 (2014). https:\/\/doi.org\/10.1016\/j.compeleceng.2013.11.024","journal-title":"Comput. Electr. Eng."},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/00018730601170527","volume":"56","author":"LF Costa","year":"2007","unstructured":"Costa, L.F., Rodrigues, F.A., Travieso, G., Boas, P.R.V.: Characterization of complex networks: a survey of measurements. Adv. Phys. 56(1), 167\u2013242 (2007). https:\/\/doi.org\/10.1080\/00018730601170527","journal-title":"Adv. Phys."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Cupertino, T., Carneiro, M., Zheng, Q., Zhang, J., Zhao, L.: A scheme for high level data classification using random walk and network measures. Exp. Syst. Appl. 9 (2017)","DOI":"10.1016\/j.eswa.2017.09.014"},{"issue":"293","key":"24_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1080\/01621459.1961.10482090","volume":"56","author":"OJ Dunn","year":"1961","unstructured":"Dunn, O.J.: Multiple comparisons among means. J. Am. Stat. Assoc. 56(293), 52\u201364 (1961). https:\/\/doi.org\/10.1080\/01621459.1961.10482090","journal-title":"J. Am. Stat. Assoc."},{"key":"24_CR13","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp. 17\u201361 (1960)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ins.2015.07.046","volume":"326","author":"LN Ferreira","year":"2016","unstructured":"Ferreira, L.N., Zhao, L.: Time series clustering via community detection in networks. Inf. Sci. 326, 227\u2013242 (2016). https:\/\/doi.org\/10.1016\/j.ins.2015.07.046","journal-title":"Inf. Sci."},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman, M.: A comparison of alternative tests of significance for the problem of m rankings. Ann. Math. Stat. 11(1), 86\u201392 (1940). https:\/\/doi.org\/10.1214\/aoms\/1177731944","journal-title":"Ann. Math. Stat."},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"Hashemi, A., Dowlatshahi, M.B., Nezamabadi-pour, H.: MGFS: a multi-label graph-based feature selection algorithm via pagerank centrality. Exp. Syst. Appl. 142 (2020). https:\/\/doi.org\/10.1016\/j.eswa.2019.113024","DOI":"10.1016\/j.eswa.2019.113024"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference and Prediction, 2nd edn. Springer New York (2009). http:\/\/www-stat.stanford.edu\/~tibs\/ElemStatLearn\/","DOI":"10.1007\/978-0-387-84858-7"},{"key":"24_CR18","doi-asserted-by":"publisher","unstructured":"Khoshgoftaar, T.M., Hulse, J.V.: Empirical case studies in attribute noise detection. IEEE Trans. Syst. Man Cybern. Part C (Applications and Reviews) 39(4), 379\u2013388 (2009). https:\/\/doi.org\/10.1109\/TSMCC.2009.2013815","DOI":"10.1109\/TSMCC.2009.2013815"},{"key":"24_CR19","unstructured":"Leisch, F., Dimitriadou, E.: mlbench: machine learning benchmark problems (2010), R package version 2.1-1(2010)"},{"key":"24_CR20","doi-asserted-by":"publisher","unstructured":"Li, J., et al.: Feature selection: a data perspective. ACM Comput. Surv. 50(6) (2017). https:\/\/doi.org\/10.1145\/3136625","DOI":"10.1145\/3136625"},{"key":"24_CR21","doi-asserted-by":"publisher","unstructured":"Louppe, G., Wehenkel, L., Sutera, A., Geurts, P.: Understanding variable importances in forests of randomized trees. In: Advances in Neural Information Processing Systems, vol. 26, pp. 431\u2013439. Curran Associates, Inc. (2013). https:\/\/dl.acm.org,https:\/\/doi.org\/10.5555\/2999611.2999660","DOI":"10.5555\/2999611.2999660"},{"key":"24_CR22","doi-asserted-by":"publisher","unstructured":"Ma, Y., Guo, L., Cukic, B., Lane: a statistical framework for the prediction of fault-proneness. In: AAdvances in Machine Learning Applications in Software Engineering. pp. 237\u2013265. IGI Global (2006). https:\/\/doi.org\/10.4018\/978-1-59140-941-1.ch010","DOI":"10.4018\/978-1-59140-941-1.ch010"},{"key":"24_CR23","unstructured":"Mairal, J., Yu, B.: Supervised feature selection in graphs with path coding penalties and network flows. J. Mach. Learn. Res. 14(39), 2449\u20132485 (2013). http:\/\/jmlr.org\/papers\/v14\/mairal13a"},{"key":"24_CR24","unstructured":"METZ, J.e.a.: Redes complexas: conceitos e aplica\u00e7\u00f5es. Tech. Rep. 290, ICMC-USP January 2007. http:\/\/repositorio.icmc.usp.br\/\/handle\/RIICMC\/6720"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Miao, J., Niu, L.: A survey on feature selection. Procedia Comput. Sci. 91, 919\u2013926 (2016)","DOI":"10.1016\/j.procs.2016.07.111"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Moradi, P., Rostami, M.: A graph theoretic approach for unsupervised feature selection. Eng. Appl. Artif. Intell. 44, 33\u201345 (2015). j.engappai.2015.05.005","DOI":"10.1016\/j.engappai.2015.05.005"},{"key":"24_CR27","doi-asserted-by":"publisher","unstructured":"Neto, F.A., Zhao, L.: Random Walk in Feature - Sample Networks for Semi-Supervised Classification, pp. 1\u20136 (2016). https:\/\/doi.org\/10.1109\/BRACIS.2016.41","DOI":"10.1109\/BRACIS.2016.41"},{"key":"24_CR28","doi-asserted-by":"publisher","unstructured":"Ni, B., Yan, S., Kassim, A.: Learning a propagable graph for semisupervised learning: classification and regression. IEEE Trans. Knowl. Data Eng., 24(1), 114\u2013126 (2012). https:\/\/doi.org\/10.1109\/TKDE.2010.209","DOI":"10.1109\/TKDE.2010.209"},{"key":"24_CR29","doi-asserted-by":"publisher","unstructured":"Oshiro, T.M., Perez, P.S., Baranauskas, J.A.: How Many trees in a random forest? In: Perner, P. (ed.) MLDM 2012. LNCS (LNAI), vol. 7376, pp. 154\u2013168. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31537-4_13","DOI":"10.1007\/978-3-642-31537-4_13"},{"key":"24_CR30","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)"},{"key":"24_CR31","doi-asserted-by":"publisher","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. MA, San Francisco (1993). https:\/\/doi.org\/10.1007\/BF00993309","DOI":"10.1007\/BF00993309"},{"key":"24_CR32","doi-asserted-by":"publisher","unstructured":"Rathkopf, C.: Network representation and complex systems. Synthese 195(1), 55\u201378 (2015). https:\/\/doi.org\/10.1007\/s11229-015-0726-0","DOI":"10.1007\/s11229-015-0726-0"},{"key":"24_CR33","doi-asserted-by":"crossref","unstructured":"Silva, T.C., Zhao, L.: Machine Learning in Complex Networks. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-17290-3","DOI":"10.1007\/978-3-319-17290-3_2"},{"key":"24_CR34","doi-asserted-by":"publisher","unstructured":"Venkatesh, B., Anuradha, J.: A review of feature selection and its methods. Cybern. Inf. Technol. 19(1), 3\u201326 (2019). https:\/\/doi.org\/10.2478\/cait-2019-0001","DOI":"10.2478\/cait-2019-0001"},{"key":"24_CR35","doi-asserted-by":"publisher","unstructured":"Zhang, Z., Hancock, E.R.: A graph-based approach to feature selection. In: Graph-Based Representations in Pattern Recognition. pp. 205\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20844-7_21","DOI":"10.1007\/978-3-642-20844-7_21"},{"key":"24_CR36","doi-asserted-by":"publisher","unstructured":"Zhao, Y., Zhang, Y.: Comparison of decision tree methods for finding active objects. Adv. Space Res. 41(12), 1955\u20131959 (2008). https:\/\/doi.org\/10.1016\/j.asr.2007.07.020","DOI":"10.1016\/j.asr.2007.07.020"},{"key":"24_CR37","doi-asserted-by":"publisher","unstructured":"Zheng, W., Zhu, X., Zhu, Y., Hu, R., Lei, C.: Dynamic graph learning for spectral feature selection. Multim. Tools Appl; 77(22), 29739\u201329755 (2017). https:\/\/doi.org\/10.1007\/s11042-017-5272-y","DOI":"10.1007\/s11042-017-5272-y"},{"key":"24_CR38","doi-asserted-by":"publisher","unstructured":"Zhu, Y., Zhong, Z., Cao, W., Cheng, D.: Graph feature selection for dementia diagnosis. Neurocomputing 195, 19\u201322 (2016). https:\/\/doi.org\/10.1016\/j.neucom.2015.09.126","DOI":"10.1016\/j.neucom.2015.09.126"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15740-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:07:09Z","timestamp":1710259629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15740-0_24"}},"subtitle":["A Robust Ranking Method Without Using Out-of-Bag Examples"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157394","9783031157400"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15740-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adbis2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adbis2022.polito.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.12","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28 short papers are included in the CCIS volume","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}