{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:13:57Z","timestamp":1772910837940,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031264184","type":"print"},{"value":"9783031264191","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26419-1_4","type":"book-chapter","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:24:57Z","timestamp":1679876697000},"page":"53-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Random Similarity Forests"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7281-284X","authenticated-orcid":false,"given":"Maciej","family":"Piernik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9723-525X","authenticated-orcid":false,"given":"Dariusz","family":"Brzezinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9032-2315","authenticated-orcid":false,"given":"Pawel","family":"Zawadzki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Davies et al., H.: HRDetect is a predictor of BRCA1 and BRCA2 deficiency based on mutational signatures. Nat. Med. 23(4), 517\u2013525 (2017)","DOI":"10.1038\/nm.4292"},{"key":"4_CR2","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth International Group, Belmont (1984)"},{"issue":"1","key":"4_CR3","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_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-030-75765-6_4","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S Czekalski","year":"2021","unstructured":"Czekalski, S., Morzy, M.: Similarity forests revisited: a Swiss army knife for machine learning. In: Karlapalem, K., et al. (eds.) PAKDD 2021. LNCS (LNAI), vol. 12713, pp. 42\u201353. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75765-6_4"},{"key":"4_CR5","first-page":"1","volume":"7","author":"J Demsar","year":"2006","unstructured":"Demsar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"4_CR6","first-page":"3133","volume":"15","author":"M Fern\u00e1ndez-Delgado","year":"2014","unstructured":"Fern\u00e1ndez-Delgado, M., Cernadas, E., Barro, S., Amorim, D.: Do we need hundreds of classifiers to solve real world classification problems? J. Mach. Learn. Res. 15(1), 3133\u20133181 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts, P., Ernst, D., Wehenkel, L.: Extremely randomized trees. Mach. Learn. 63(1), 3\u201342 (2006)","journal-title":"Mach. Learn."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/TKDE.2005.50","volume":"17","author":"J Huang","year":"2005","unstructured":"Huang, J., Ling, C.X.: Using AUC and accuracy in evaluating learning algorithms. IEEE Trans. Knowl. Data Eng. 17(3), 299\u2013310 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"7553","key":"4_CR9","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.E.: Deep learning. Nature 521(7553), 436\u2013444 (2015)","journal-title":"Nature"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Liang, J., Liu, Q., Nie, N., Zeng, B., Zhang, Z.: An improved algorithm based on KNN and Random Forest. In: Proceedings of the 3rd International Conference on Computer Science and Application Engineering (2019)","DOI":"10.1145\/3331453.3360963"},{"issue":"62","key":"4_CR11","doi-asserted-by":"publisher","first-page":"2990","DOI":"10.21105\/joss.02990","volume":"6","author":"S McCabe","year":"2021","unstructured":"McCabe, S., et al.: netrd: a library for network reconstruction and graph distances. J. Open Source Softw. 6(62), 2990 (2021)","journal-title":"J. Open Source Softw."},{"key":"4_CR12","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1007\/s10115-021-01572-6","volume":"63","author":"M Piernik","year":"2021","unstructured":"Piernik, M., Morzy, T.: A study on using data clustering for feature extraction to improve the quality of classification. Knowl. Inf. Syst. 63, 1771\u20131805 (2021)","journal-title":"Knowl. Inf. Syst."},{"key":"4_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.biotechadv.2021.107739","volume":"49","author":"PS Reel","year":"2021","unstructured":"Reel, P.S., Reel, S., Pearson, E., Trucco, E., Jefferson, E.: Using machine learning approaches for multi-omics data analysis: a review. Biotechnol. Adv. 49, 107739 (2021)","journal-title":"Biotechnol. Adv."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Sathe, S., Aggarwal, C.C.: Similarity forests. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 395\u2013403 (2017)","DOI":"10.1145\/3097983.3098046"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1109\/TIT.2016.2514489","volume":"62","author":"E Scornet","year":"2016","unstructured":"Scornet, E.: Random forests and kernel methods. IEEE Trans. Inf. Theory 62(3), 1485\u20131500 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1186\/1687-6180-2011-62","volume":"2011","author":"CF Tsai","year":"2011","unstructured":"Tsai, C.F., Lin, W.Y., Hong, Z.F., Hsieh, C.Y.: Distance-based features in pattern classification. EURASIP J. Adv. Signal Process. 2011(1), 62 (2011)","journal-title":"EURASIP J. Adv. Signal Process."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26419-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:26:27Z","timestamp":1679876787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26419-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031264184","9783031264191"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26419-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.org\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","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":"236","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":"22% - 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-4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 demo track papers have been accepted from 28 submissions","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)"}}]}}