{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:51:13Z","timestamp":1743083473277,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031059322"},{"type":"electronic","value":"9783031059339"}],"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-05933-9_33","type":"book-chapter","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T13:04:50Z","timestamp":1652101490000},"page":"419-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Memory-Efficient Minimax Distance Measures"],"prefix":"10.1007","author":[{"given":"Fazeleh","family":"Hoseini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Haghir Chehreghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,10]]},"reference":[{"issue":"5","key":"33_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.dam.2010.11.017","volume":"159","author":"P Chebotarev","year":"2011","unstructured":"Chebotarev, P.: A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Discrete Appl. Math. 159(5), 295\u2013302 (2011)","journal-title":"Discrete Appl. Math."},{"unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education (2001)","key":"33_CR2"},{"unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml","key":"33_CR3"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/TPAMI.2003.1190577","volume":"25","author":"B Fischer","year":"2003","unstructured":"Fischer, B., Buhmann, J.M.: Path-based clustering for grouping of smooth curves and texture segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 25(4), 513\u2013518 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"5372","DOI":"10.1016\/j.neunet.2012.03.001","volume":"31","author":"F Fouss","year":"2012","unstructured":"Fouss, F., Francoisse, K., Yen, L., Pirotte, A., Saerens, M.: An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Netw. 31, 5372 (2012)","journal-title":"Neural Netw."},{"issue":"3","key":"33_CR6","first-page":"355","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss, F., Pirotte, A., Renders, J.M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE TKDE 19(3), 355\u2013369 (2007)","journal-title":"IEEE TKDE"},{"issue":"12","key":"33_CR7","doi-asserted-by":"publisher","first-page":"4743","DOI":"10.1007\/s10489-018-1238-7","volume":"48","author":"P Fr\u00e4nti","year":"2018","unstructured":"Fr\u00e4nti, P., Sieranoja, S.: K-means properties on six clustering benchmark datasets. Appl. Intell. 48(12), 4743\u20134759 (2018). https:\/\/doi.org\/10.1007\/s10489-018-1238-7","journal-title":"Appl. Intell."},{"unstructured":"Gautier, G., Polito, G., Bardenet, R., Valko, M.: DPPy: DPP sampling with python. JMLR-MLOSS (2019)","key":"33_CR8"},{"unstructured":"Goodfellow, I.J., Bengio, Y., Courville, A.C.: Deep Learning, Adaptive Computation and Machine Learning. MIT Press (2016)","key":"33_CR9"},{"doi-asserted-by":"crossref","unstructured":"Haghir Chehreghani, M.: K-nearest neighbor search and outlier detection via minimax distances. In: SIAM International Conference on Data Mining (SDM), pp. 405\u2013413 (2016)","key":"33_CR10","DOI":"10.1137\/1.9781611974348.46"},{"unstructured":"Chehreghani, M.H.: Classification with minimax distance measures. In: Thirty-First AAAI Conference on Artificial Intelligence, pp. 1784\u20131790 (2017)","key":"33_CR11"},{"doi-asserted-by":"crossref","unstructured":"Chehreghani, M.H.: Efficient computation of pairwise minimax distance measures. In: IEEE International Conference on Data Mining, ICDM, pp. 799\u2013804 (2017)","key":"33_CR12","DOI":"10.1109\/ICDM.2017.95"},{"issue":"11","key":"33_CR13","doi-asserted-by":"publisher","first-page":"2063","DOI":"10.1007\/s10994-020-05886-4","volume":"109","author":"M Haghir Chehreghani","year":"2020","unstructured":"Haghir Chehreghani, M.: Unsupervised representation learning with minimax distance measures. Mach. Learn. 109(11), 2063\u20132097 (2020). https:\/\/doi.org\/10.1007\/s10994-020-05886-4","journal-title":"Mach. Learn."},{"doi-asserted-by":"crossref","unstructured":"Kim, K., Choi, S.: Walking on minimax paths for k-NN search. In: Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","key":"33_CR14","DOI":"10.1609\/aaai.v27i1.8588"},{"issue":"7","key":"33_CR15","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.3390\/rs12071162","volume":"12","author":"S Le Moan","year":"2020","unstructured":"Le Moan, S., Cariou, C.: Minimax bridgeness-based clustering for hyperspectral data. Remote Sens. 12(7), 1162 (2020)","journal-title":"Remote Sens."},{"unstructured":"Little, A.V., Maggioni, M., Murphy, J.M.: Path-based spectral clustering: guarantees, robustness to outliers, and fast algorithms. J. Mach. Learn. Res. 21, 6:1\u20136:66 (2020)","key":"33_CR16"},{"unstructured":"Moscovich, A., Jaffe, A., Boaz, N.: Minimax-optimal semi-supervised regression on unknown manifolds. In: Artificial Intelligence and Statistics, pp. 933\u2013942. PMLR (2017)","key":"33_CR17"},{"issue":"1","key":"33_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TPAMI.2007.250598","volume":"29","author":"S Yan","year":"2006","unstructured":"Yan, S., Xu, D., Zhang, B., Zhang, H.J., Yang, Q., Lin, S.: Graph embedding and extensions: a general framework for dimensionality reduction. IEEE TPAMI 29(1), 40\u201351 (2006)","journal-title":"IEEE TPAMI"},{"doi-asserted-by":"crossref","unstructured":"Yen, L., Saerens, M., Mantrach, A., Shimbo, M.: A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In: Proceedings of the 14th ACM SIGKDD, pp. 785\u2013793 (2008)","key":"33_CR19","DOI":"10.1145\/1401890.1401984"},{"issue":"1","key":"33_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02287916","volume":"3","author":"G Young","year":"1938","unstructured":"Young, G., Householder, A.: Discussion of a set of points in terms of their mutual distances. Psychometrika 3(1), 19\u201322 (1938). https:\/\/doi.org\/10.1007\/BF02287916","journal-title":"Psychometrika"},{"issue":"4","key":"33_CR21","first-page":"265","volume":"2","author":"G Zhong","year":"2016","unstructured":"Zhong, G., Wang, L.N., Ling, X., Dong, J.: An overview on data representation learning: from traditional feature learning to recent deep learning. JFDS 2(4), 265\u2013278 (2016)","journal-title":"JFDS"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-05933-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T18:51:40Z","timestamp":1675536700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05933-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031059322","9783031059339"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05933-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"16 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 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":"pakdd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/pakdd.net\/index.html","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":"558","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":"121","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.75","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":"6.45","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)"}}]}}