{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:32:12Z","timestamp":1743154332851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031301049"},{"type":"electronic","value":"9783031301056"}],"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-30105-6_13","type":"book-chapter","created":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:31:55Z","timestamp":1681331515000},"page":"153-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["General Algorithm for\u00a0Learning from\u00a0Grouped Uncoupled Data and\u00a0Pairwise Comparison Data"],"prefix":"10.1007","author":[{"given":"Masahiro","family":"Kohjima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuta","family":"Nambu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuki","family":"Kurauchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuji","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,13]]},"reference":[{"key":"13_CR1","unstructured":"Carpentier, A., Schl\u00fcter, T.: Learning relationships between data obtained independently. In: Artificial Intelligence and Statistics, pp. 658\u2013666 (2016)"},{"key":"13_CR2","unstructured":"Hsu, D., Shi, K., Sun, X.: Linear regression without correspondence. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 1530\u20131539 (2017)"},{"key":"13_CR3","unstructured":"Abid, A., Poon, A., Zou, J.: Linear regression with shuffled labels. arXiv preprint arXiv:1705.01342 (2017)"},{"key":"13_CR4","unstructured":"Xu, L., Niu, G., Honda, J., Sugiyama, M.: Uncoupled regression from pairwise comparison data. In: Advances in Neural Information Processing Systems, pp. 3992\u20134002 (2019)"},{"key":"13_CR5","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep learning. MIT Press Cambridge (2016)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Williams, C.K., Rasmussen, C.E.: Gaussian processes for machine learning, vol. 2. MIT press Cambridge, MA (2006)","DOI":"10.7551\/mitpress\/3206.001.0001"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","DOI":"10.1023\/A:1010933404324"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Statist. 29(5), 1189\u20131232 (2001)","DOI":"10.1214\/aos\/1013203451"},{"key":"13_CR9","unstructured":"Titsias, M.: Variational learning of inducing variables in sparse Gaussian processes. In: Artificial intelligence and statistics, pp. 567\u2013574. PMLR (2009)"},{"key":"13_CR10","first-page":"3146","volume":"30","author":"G Ke","year":"2017","unstructured":"Ke, G., et al.: LightGBM: a highly efficient gradient boosting decision tree. Adv. Neural. Inf. Process. Syst. 30, 3146\u20133154 (2017)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"5","key":"13_CR11","doi-asserted-by":"publisher","first-page":"3286","DOI":"10.1109\/TIT.2017.2776217","volume":"64","author":"A Pananjady","year":"2017","unstructured":"Pananjady, A., Wainwright, M.J., Courtade, T.A.: Linear regression with shuffled data: statistical and computational limits of permutation recovery. IEEE Trans. Inf. Theory 64(5), 3286\u20133300 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR12","unstructured":"Slawski, M., Rahmani, M., Li, P.: A sparse representation-based approach to linear regression with partially shuffled labels. In: Proceedings of The 35th Uncertainty in Artificial Intelligence Conference, pp. 38\u201348 (2020)"},{"issue":"5","key":"13_CR13","doi-asserted-by":"publisher","first-page":"3237","DOI":"10.1109\/TIT.2018.2809002","volume":"64","author":"J Unnikrishnan","year":"2018","unstructured":"Unnikrishnan, J., Haghighatshoar, S., Vetterli, M.: Unlabeled sensing with random linear measurements. IEEE Trans. Inf. Theory 64(5), 3237\u20133253 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"13_CR15","unstructured":"Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J., Lafferty, J.: Clustering with Bregman divergences. J. Mach. Learn. Res. 6(10), 1705\u20131749 (2005)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30105-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:34:06Z","timestamp":1681331646000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30105-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031301049","9783031301056"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30105-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Delhi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"22 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2022.apnns.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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"810","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":"359","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":"44% - 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.65","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)"}},{"value":"ICONIP 2022 consists of a two-volume set, LNCS & CCIS, which includes 146 and 213 papers","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)"}}]}}