{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:14:17Z","timestamp":1743084857095,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031300462"},{"type":"electronic","value":"9783031300479"}],"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-30047-9_14","type":"book-chapter","created":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T09:06:06Z","timestamp":1680253566000},"page":"169-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Revised Conditional t-SNE: Looking Beyond the\u00a0Nearest Neighbors"],"prefix":"10.1007","author":[{"given":"Edith","family":"Heiter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruth","family":"Seurinck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jefrey","family":"Lijffijt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,1]]},"reference":[{"key":"14_CR1","unstructured":"Bernhardsson, E.: Annoy: approximate nearest neighbors in C++\/Python (2013). https:\/\/github.com\/spotify\/annoy"},{"key":"14_CR2","unstructured":"de Bodt, C., Mulders, D., S\u00e1nchez, D.L., Verleysen, M., Lee, J.A.: Class-aware t-SNE: cat-SNE. In: ESANN (2019)"},{"issue":"10","key":"14_CR3","doi-asserted-by":"publisher","first-page":"2905","DOI":"10.1007\/s10994-020-05917-0","volume":"110","author":"B Kang","year":"2021","unstructured":"Kang, B., Garc\u00eda Garc\u00eda, D., Lijffijt, J., Santos-Rodr\u00edguez, R., De Bie, T.: Conditional t-SNE: more informative t-SNE embeddings. Mach. Learn. 110(10), 2905\u20132940 (2021)","journal-title":"Mach. Learn."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.neucom.2014.12.095","volume":"169","author":"JA Lee","year":"2015","unstructured":"Lee, J.A., Peluffo-Ord\u00f3\u00f1ez, D.H., Verleysen, M.: Multi-scale similarities in stochastic neighbour embedding: reducing dimensionality while preserving both local and global structure. Neurocomputing 169, 246\u2013261 (2015)","journal-title":"Neurocomputing"},{"issue":"7\u20139","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1016\/j.neucom.2008.12.017","volume":"72","author":"JA Lee","year":"2009","unstructured":"Lee, J.A., Verleysen, M.: Quality assessment of dimensionality reduction: rank-based criteria. Neurocomputing 72(7\u20139), 1431\u20131443 (2009)","journal-title":"Neurocomputing"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1038\/s41592-018-0308-4","volume":"16","author":"GC Linderman","year":"2019","unstructured":"Linderman, G.C., Rachh, M., Hoskins, J.G., Steinerberger, S., Kluger, Y.: Fast interpolation-based t-SNE for improved visualization of single-cell RNA-seq data. Nat. Methods 16(3), 243\u2013245 (2019)","journal-title":"Nat. Methods"},{"issue":"1","key":"14_CR7","first-page":"3221","volume":"15","author":"L van der Maaten","year":"2014","unstructured":"van der Maaten, L.: Accelerating t-SNE using tree-based algorithms. JMLR 15(1), 3221\u20133245 (2014)","journal-title":"JMLR"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10994-021-06043-1","volume":"112","author":"PG Poli\u010dar","year":"2021","unstructured":"Poli\u010dar, P.G., Stra\u017ear, M., Zupan, B.: Embedding to reference t-SNE space addresses batch effects in single-cell classification. Mach. Learn. 112, 721\u2013740 (2021)","journal-title":"Mach. Learn."},{"key":"14_CR9","unstructured":"Satija Lab: panc8.SeuratData: Eight Pancreas Datasets Across Five Technologies (2019). R package version 3.0.2"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Vu, V.M., Bibal, A., Fr\u00e9nay, B.: HCt-SNE: hierarchical constraints with t-SNE. In: International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. IEEE (2021)","DOI":"10.1109\/IJCNN52387.2021.9534470"},{"key":"14_CR11","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of ACM-SIAM Symposium on Discrete algorithms, vol. 66, pp. 311\u2013321 (1993)"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XXI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30047-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:48:48Z","timestamp":1710359328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30047-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031300462","9783031300479"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30047-9_14","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":"1 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ida2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ida2023.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","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":"38","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":"42% - 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.1","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":"2.7","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)"}}]}}