{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:16Z","timestamp":1740099496902,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030289560"},{"type":"electronic","value":"9783030289577"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-28957-7_25","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T19:06:24Z","timestamp":1568228784000},"page":"303-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Gentle AdaBoost Algorithm with Score Function Dependent on the Distance to Decision Boundary"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3506-6611","authenticated-orcid":false,"given":"Robert","family":"Burduk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1868-8603","authenticated-orcid":false,"given":"Wojciech","family":"Bozejko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,11]]},"reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M Kearns","year":"1994","unstructured":"Kearns, M., Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata. J. Assoc. Comput. Mach. 41(1), 67\u201395 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-05458-2_12","volume-title":"Intelligent Information and Database Systems","author":"R Burduk","year":"2014","unstructured":"Burduk, R.: The AdaBoost algorithm with the imprecision determine the weights of the observations. In: Nguyen, N.T., Attachoo, B., Trawi\u0144ski, B., Somboonviwat, K. (eds.) ACIIDS 2014. LNCS (LNAI), vol. 8398, pp. 110\u2013116. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-05458-2_12"},{"issue":"12","key":"25_CR3","doi-asserted-by":"publisher","first-page":"2216","DOI":"10.1109\/TPAMI.2010.47","volume":"32","author":"S Chunhua","year":"2010","unstructured":"Chunhua, S., Hanxi, L.: On the dual formulation of boosting algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 32(12), 2216\u20132231 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-44938-8_2","volume-title":"Multiple Classifier Systems","author":"NC Oza","year":"2003","unstructured":"Oza, N.C.: Boosting with averaged weight vectors. In: Windeatt, T., Roli, F. (eds.) MCS 2003. LNCS, vol. 2709, pp. 15\u201324. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/3-540-44938-8_2"},{"key":"25_CR5","unstructured":"Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: Proceedings of the Thirteenth International Conference on Machine Learning, Bari, Italy, pp. 148\u2013156 (1996)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/978-3-540-24685-5_117","volume-title":"Computational Science - ICCS 2004","author":"M Wozniak","year":"2004","unstructured":"Wozniak, M.: Proposition of boosting algorithm for probabilistic decision support system. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3036, pp. 675\u2013678. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24685-5_117"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2015\/835357","volume":"2015","author":"Shuqiong Wu","year":"2015","unstructured":"Wu, S., Nagahashi, H.: Analysis of generalization ability for different AdaBoost variants based on classification and regression trees. J. Electr. Comput. Eng. 2015, Article ID 835357, 17 pages (2015). \n                      https:\/\/doi.org\/10.1155\/2015\/835357","journal-title":"Journal of Electrical and Computer Engineering"},{"key":"25_CR8","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"25_CR9","doi-asserted-by":"publisher","first-page":"1559008","DOI":"10.1142\/S0218001415590089","volume":"29","author":"I Rejer","year":"2015","unstructured":"Rejer, I.: Genetic algorithms for feature selection for brain computer interface. Int. J. Pattern Recogn. Artif. Intell. 29(5), 1559008 (2015)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"25_CR10","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-67588-6_10","volume-title":"Advances in Feature Selection for Data and Pattern Recognition","author":"A Szenkovits","year":"2018","unstructured":"Szenkovits, A., Meszl\u00e9nyi, R., Buza, K., Gask\u00f3, N., Lung, R.I., Suciu, M.: Feature selection with a genetic algorithm for classification of brain imaging data. In: Sta\u0144czyk, U., Zielosko, B., Jain, L.C. (eds.) Advances in Feature Selection for Data and Pattern Recognition. ISRL, vol. 138, pp. 185\u2013202. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-67588-6_10"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR12","volume-title":"Pharmaceutical Statistics Using SAS: A Practical Guide","author":"A Dmitrienko","year":"2007","unstructured":"Dmitrienko, A., Chuang-Stein, C.: Pharmaceutical Statistics Using SAS: A Practical Guide. SAS Press, Cary (2007)"}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28957-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T19:10:17Z","timestamp":1568229017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-28957-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030289560","9783030289577"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28957-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CISIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Computer Information Systems and Industrial Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgrade","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","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":"19 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cisim2019.wi.pb.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"70","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":"43","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":"0","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":"61% - 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-3","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","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)"}}]}}