{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:15:10Z","timestamp":1742973310190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030134686"},{"type":"electronic","value":"9783030134693"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-13469-3_36","type":"book-chapter","created":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T13:03:53Z","timestamp":1551531833000},"page":"305-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Weighted k-Nearest Neighbor Algorithm Based on Newton\u2019s Gravitational Force"],"prefix":"10.1007","author":[{"given":"Juan","family":"Aguilera","sequence":"first","affiliation":[]},{"given":"Luis C.","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Montes-y-G\u00f3mez","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Rosso","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,3]]},"reference":[{"key":"36_CR1","unstructured":"Benavoli, A., Mangili, F., Corani, G., Zaffalon, M., Ruggeri, F.: A Bayesian Wilcoxon signed-rank test based on the Dirichlet process. In: Proceedings of the 31st International Conference on Machine Learning, vol. 32, p. 9 (2014)"},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.patrec.2011.10.021","volume":"33","author":"G Bhattacharya","year":"2012","unstructured":"Bhattacharya, G., Ghosh, K., Chowdhury, A.S.: An affinity-based new local distance function and similarity measure for kNN algorithm. Pattern Recogn. Lett. 33(3), 356\u2013363 (2012)","journal-title":"Pattern Recogn. Lett."},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-59650-1_24","volume-title":"Hybrid Artificial Intelligent Systems","author":"J Carrasco","year":"2017","unstructured":"Carrasco, J., Garc\u00eda, S., del Mar Rueda, M., Herrera, F.: rNPBST: an R package covering non-parametric and bayesian statistical tests. In: Mart\u00ednez de Pis\u00f3n, F.J., Urraca, R., Quinti\u00e1n, H., Corchado, E. (eds.) HAIS 2017. LNCS (LNAI), vol. 10334, pp. 281\u2013292. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59650-1_24"},{"key":"36_CR4","volume-title":"The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World","author":"P Domingos","year":"2015","unstructured":"Domingos, P.: The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World. Basic Books, New York City (2015)"},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/TSMC.1976.5408784","volume":"6","author":"SA Dudani","year":"1976","unstructured":"Dudani, S.A.: The distance-weighted k-nearest-neighbor rule. IEEE Trans. Syst. Man Cybern. SMC 6(4), 325\u2013327 (1976)","journal-title":"IEEE Trans. Syst. Man Cybern. SMC"},{"key":"36_CR6","first-page":"21","volume":"1","author":"DS Guru","year":"2010","unstructured":"Guru, D.S., Sharath, Y.H., Manjunath, S.: Texture features and KNN in classification of flower images. Int. J. Comput. Appl. 1, 21\u201329 (2010)","journal-title":"Int. J. Comput. Appl."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Lam, S.K., Riedl, J.: Shilling recommender systems for fun and profit. In: Proceedings of the 13th International Conference on World Wide Web - WWW 2004, p. 393 (2004)","DOI":"10.1145\/988672.988726"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.patrec.2018.03.023","volume":"110","author":"J L\u00f3pez","year":"2018","unstructured":"L\u00f3pez, J., Maldonado, S.: Redefining nearest neighbor classification in high-dimensional settings. Pattern Recogn. Lett. 110, 36\u201343 (2018)","journal-title":"Pattern Recogn. Lett."},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.eswa.2015.08.017","volume":"43","author":"D Mateos-Garc\u00eda","year":"2016","unstructured":"Mateos-Garc\u00eda, D., Garc\u00eda-Guti\u00e9rrez, J., Riquelme-Santos, J.C.: An evolutionary voting for k-nearest neighbours. Expert Syst. Appl. 43, 9\u201314 (2016)","journal-title":"Expert Syst. Appl."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Parvinnia, E., Sabeti, M., Jahromi, M.Z., Boostani, R.: Classification of EEG Signals using adaptive weighted distance nearest neighbor algorithm. J. King Saud Univ. - Comput. Inf. Sci. 26(1), 1\u20136 (2014)","DOI":"10.1016\/j.jksuci.2013.01.001"},{"key":"36_CR11","unstructured":"Soucy, P., Mineau, G.: A simple KNN algorithm for text categorization. In: Proceedings 2001 IEEE International Conference on Data Mining, pp. 647\u2013648 (2001)"},{"issue":"4","key":"36_CR12","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.eswa.2004.12.023","volume":"28","author":"S Tan","year":"2005","unstructured":"Tan, S.: Neighbor-weighted K-nearest neighbor for unbalanced text corpus. Expert Syst. Appl. 28(4), 667\u2013671 (2005)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"DL Wilson","year":"1972","unstructured":"Wilson, D.L.: Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans. Syst. Man Cybern. 2(3), 408\u2013421 (1972)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","volume":"14","author":"X Wu","year":"2008","unstructured":"Wu, X., et al.: Top 10 algorithms in data mining. Knowl. Inf. Syst. 14, 1\u201337 (2008)","journal-title":"Knowl. Inf. Syst."},{"issue":"9","key":"36_CR15","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1016\/j.patrec.2013.01.028","volume":"34","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Zhu, Q., Fan, Z., Qiu, M., Chen, Y., Liu, H.: Coarse to fine K nearest neighbor classifier. Pattern Recogn. Lett. 34(9), 980\u2013986 (2013)","journal-title":"Pattern Recogn. Lett."},{"key":"36_CR16","first-page":"1","volume":"0","author":"S Zhang","year":"2017","unstructured":"Zhang, S., Cheng, D., Deng, Z., Zong, M., Deng, X.: A novel kNN algorithm with data-driven k parameter computation. Pattern Recogn. Lett. 0, 1\u201311 (2017)","journal-title":"Pattern Recogn. Lett."},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.patrec.2016.05.007","volume":"80","author":"Q Zhu","year":"2016","unstructured":"Zhu, Q., Feng, J., Huang, J.: Natural neighbor: a self-adaptive neighborhood method without parameter K. Pattern Recogn. Lett. 80, 30\u201336 (2016)","journal-title":"Pattern Recogn. Lett."}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13469-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T01:07:45Z","timestamp":1677719265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-13469-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030134686","9783030134693"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13469-3_36","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":"3 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIARP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iberoamerican Congress on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciarp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/atvs.ii.uam.es\/ciarp2018\/","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":"187","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":"112","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":"60% - 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,94","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":"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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}