{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:11:43Z","timestamp":1776442303944,"version":"3.51.2"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030453701","type":"print"},{"value":"9783030453718","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45371-8_4","type":"book-chapter","created":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T23:04:51Z","timestamp":1587078291000},"page":"56-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Selection and Performance Analysis of CICIDS2017 Features Importance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9888-9527","authenticated-orcid":false,"given":"Bruno","family":"Reis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8075-531X","authenticated-orcid":false,"given":"Eva","family":"Maia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2519-9859","authenticated-orcid":false,"given":"Isabel","family":"Pra\u00e7a","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Al-Jarrah, O.Y., Siddiqui, A., Elsalamouny, M., Yoo, P.D., Muhaidat, S., Kim, K.: Machine-learning-based feature selection techniques for large-scale network intrusion detection. In: 2014 IEEE 34th International Conference on Distributed Computing Systems Workshops (ICDCSW). pp. 177\u2013181, June 2014","DOI":"10.1109\/ICDCSW.2014.14"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1162\/neco.1997.9.7.1545","volume":"9","author":"Y Amit","year":"1997","unstructured":"Amit, Y., Geman, D.: Shape quantization and recognition with randomized trees. Neural Comput. 9, 1545\u20131588 (1997)","journal-title":"Neural Comput."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bilge, L., Balzarotti, D., Robertson, W., Kirda, E., Kruegel, C.: Disclosure: detecting botnet command and control servers through large-scale netflow analysis, pp. 129\u2013138, December 2012","DOI":"10.1145\/2420950.2420969"},{"key":"4_CR4","unstructured":"Boukhamla, A., Coronel, J.: Cicids 2017 dataset: performance improvements and validation as a robust intrusion detection system testbed. Int. J. Inf. Comput. Secur. (2018)"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"4_CR6","unstructured":"University of California Irvine: Kdd cup 1999 data, March 2018. http:\/\/kdd.ics.uci.edu\/databases\/kddcup99\/kddcup99.html"},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.cose.2004.09.008","volume":"24","author":"S Chebrolu","year":"2005","unstructured":"Chebrolu, S., Abraham, A., Thomas, J.P.: Feature deduction and ensemble design of intrusion detection systems. Comput. Secur. 24(4), 295\u2013307 (2005)","journal-title":"Comput. Secur."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system, pp. 785\u2013794, August 2016","DOI":"10.1145\/2939672.2939785"},{"key":"4_CR9","unstructured":"Cyber Intelligence (CI) for Cybersecurity: Intrusion detection evaluation dataset (cicids2017), March 2018. https:\/\/www.unb.ca\/cic\/datasets\/ids-2017.html"},{"key":"4_CR10","unstructured":"Cyber Intelligence (CI) for Cybersecurity: Network traffic flow analyzer, March 2018. http:\/\/www.netflowmeter.ca\/netflowmeter.html"},{"issue":"7","key":"4_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.3390\/info9070149","volume":"9","author":"SS Dhaliwal","year":"2018","unstructured":"Dhaliwal, S.S., Nahid, A.A., Abbas, R.: Effective intrusion detection system using XGBoost. Information 9(7), 149 (2018)","journal-title":"Information"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"J Friedman","year":"2000","unstructured":"Friedman, J.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29, 1189\u20131232 (2000)","journal-title":"Ann. Stat."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Goeschel, K.: Reducing false positives in intrusion detection systems using data-mining techniques utilizing support vector machines, decision trees, and naive Bayes for off-line analysis, pp. 1\u20136, March 2016","DOI":"10.1109\/SECON.2016.7506774"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Gulati, P.: Intrusion detection system using gradient boosted trees for VANETs. Int. J. Res. Appl. Sci. Eng. Technol. 482\u2013488 (2017)","DOI":"10.22214\/ijraset.2017.8067"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02985802","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T Hastie","year":"2009","unstructured":"Hastie, T.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/BF02985802"},{"issue":"8","key":"4_CR16","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"TK Ho","year":"1998","unstructured":"Ho, T.K.: The random subspace method for constructing decision forests. IEEE Trans. Pattern Anal. Mach. Intell. 20(8), 832\u2013844 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR17","unstructured":"Hodo, E., Bellekens, X., Hamilton, A., Tachtatzis, C., Atkinson, R.: Shallow and deep networks intrusion detection system: a taxonomy and survey. Workingpaper, January 2017"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10994-014-5473-9","volume":"101","author":"F Iglesias","year":"2015","unstructured":"Iglesias, F., Zseby, T.: Analysis of network traffic features for anomaly detection. Mach. Learn. 101(1), 59\u201384 (2015)","journal-title":"Mach. Learn."},{"key":"4_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An Introduction to Statistical Learning: With Applications in R","author":"G James","year":"2014","unstructured":"James, G., Witten, D., Hastie, T., Tibshirani, R.: An Introduction to Statistical Learning: With Applications in R. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-1-4614-7138-7"},{"key":"4_CR20","first-page":"26","volume":"28","author":"V Jyothsna","year":"2011","unstructured":"Jyothsna, V., Rama Prasad, V.V., Munivara Prasad, K.: A review of anomaly based intrusion detection systems. Int. J. Comput. Appl. 28, 26\u201335 (2011)","journal-title":"Int. J. Comput. Appl."},{"key":"4_CR21","unstructured":"Ke, G.,et al.: LightGBM: a highly efficient gradient boosting decision tree. In: Advances in Neural Information Processing Systems, vol. 30, December 2017"},{"key":"4_CR22","unstructured":"keitakurita: LightGBM and XGBoost explained, October 1999. http:\/\/mlexplained.com\/2018\/01\/05\/lightgbm-and-xgboost-explained\/"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Kim, E., Kim, S.: A novel hierarchical detection method for enhancing anomaly detection efficiency, pp. 1018\u20131022, December 2015","DOI":"10.1109\/CICN.2015.202"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-45248-5_10","volume-title":"Recent Advances in Intrusion Detection","author":"C Kruegel","year":"2003","unstructured":"Kruegel, C., Toth, T.: Using decision trees to improve signature-based intrusion detection. In: Vigna, G., Kruegel, C., Jonsson, E. (eds.) RAID 2003. LNCS, vol. 2820, pp. 173\u2013191. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45248-5_10"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Mandayam Comar, P., Liu, L., Saha, S., Tan, P.N., Nucci, A.: Combining supervised and unsupervised learning for zero-day malware detection, pp. 2022\u20132030, April 2013","DOI":"10.1109\/INFCOM.2013.6567003"},{"key":"4_CR26","unstructured":"Mukkamala, S., Sung, A., Abraham, A.: Cyber security challenges: designing efficient intrusion detection systems and antivirus tools, January 2005"},{"issue":"3.24","key":"4_CR27","first-page":"479","volume":"7","author":"R Panigrahi","year":"2018","unstructured":"Panigrahi, R., Borah, S.: A detailed analysis of cicids2017 dataset for designing intrusion detection systems. Int. J. Eng. Technol. 7(3.24), 479\u2013482 (2018)","journal-title":"Int. J. Eng. Technol."},{"key":"4_CR28","unstructured":"Parr, T., Turgutlu, K., Csiszar, C., Howard, J.: Beware default random forest importances, March 2018. https:\/\/explained.ai\/rf-importance\/"},{"issue":"1","key":"4_CR29","doi-asserted-by":"publisher","first-page":"2776","DOI":"10.4249\/scholarpedia.2776","volume":"4","author":"R Polikar","year":"2009","unstructured":"Polikar, R.: Ensemble learning. Scholarpedia 4(1), 2776 (2009). revision #186077","journal-title":"Scholarpedia"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MCAS.2006.1688199","volume":"6","author":"R Polikar","year":"2006","unstructured":"Polikar, R.: Ensemble based systems in decision making. IEEE Circ. Syst. Mag. 6, 21\u201345 (2006)","journal-title":"IEEE Circ. Syst. Mag."},{"issue":"3","key":"4_CR31","doi-asserted-by":"publisher","first-page":"48:1","DOI":"10.1145\/3178582","volume":"51","author":"PAA Resende","year":"2018","unstructured":"Resende, P.A.A., Drummond, A.C.: A survey of random forest based methods for intrusion detection systems. ACM Comput. Surv. 51(3), 48:1\u201348:36 (2018)","journal-title":"ACM Comput. Surv."},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Sharafaldin, I., Lashkari, A.H., Ghorbani, A.A.: Toward generating a new intrusion detection dataset and intrusion traffic characterization. In: Proceedings of the 4th International Conference on Information Systems Security and Privacy, Vol. 1, ICISSP, pp. 108\u2013116. INSTICC, SciTePress (2018)","DOI":"10.5220\/0006639801080116"},{"key":"4_CR33","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.cose.2011.12.012","volume":"31","author":"A Shiravi","year":"2012","unstructured":"Shiravi, A., Shiravi, H., Tavallaee, M., Ghorbani, A.: Toward developing a systematic approach to generate benchmark datasets for intrusion detection. Comput. Secur. 31, 357\u2013374 (2012)","journal-title":"Comput. Secur."},{"issue":"1","key":"4_CR34","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1186\/1471-2105-8-25","volume":"8","author":"C Strobl","year":"2007","unstructured":"Strobl, C., Boulesteix, A.L., Zeileis, A., Hothorn, T.: Bias in random forest variable importance measures: Illustrations, sources and a solution. BMC Bioinform. 8(1), 25 (2007)","journal-title":"BMC Bioinform."},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Haines, J.W., Lippmann, R.P., Fried, D.J., Zissman, M.A., Tran, E.: 1999 DARPA intrusion detection evaluation: design and procedures, p. 188, February 2001","DOI":"10.1016\/S1389-1286(00)00139-0"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Yin, M., Yao, D., Luo, J., Liu, X., Ma, J.: Network backbone anomaly detection using double random forests based on non-extensive entropy feature extraction, pp. 80\u201384, July 2013","DOI":"10.1109\/ICNC.2013.6817948"},{"issue":"3","key":"4_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/LCOMM.2018.2789896","volume":"22","author":"T Zhi","year":"2018","unstructured":"Zhi, T., Luo, H., Liu, Y.: A gini impurity based interest flooding attack defence mechanism in NDN. IEEE Commun. Lett. 22(3), 1 (2018)","journal-title":"IEEE Commun. Lett."}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45371-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T14:43:25Z","timestamp":1666363405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45371-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030453701","9783030453718"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45371-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations and Practice of Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fps2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fps2019.sciencesconf.org\/","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":"50","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":"19","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":"9","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":"38% - 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":"2.5","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.5","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)"}}]}}