{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T21:27:01Z","timestamp":1760909221717,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030400132"},{"type":"electronic","value":"9783030400149"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-40014-9_4","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T18:03:07Z","timestamp":1579888987000},"page":"71-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Annealing by Increasing Resampling"],"prefix":"10.1007","author":[{"given":"Naoya","family":"Higuchi","sequence":"first","affiliation":[]},{"given":"Yasunobu","family":"Imamura","sequence":"additional","affiliation":[]},{"given":"Takeshi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[]},{"given":"Tetsuji","family":"Kuboyama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,25]]},"reference":[{"key":"4_CR1","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing","author":"E Aarts","year":"1989","unstructured":"Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, Hoboken (1989)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"657","DOI":"10.2307\/3214097","volume":"24","author":"S Anily","year":"1987","unstructured":"Anily, S., Federgruen, A.: Simulated annealing methods with general acceptance probabilities. J. Appl. Prob. 24, 657\u2013667 (1987)","journal-title":"J. Appl. Prob."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1071\/PH650119","volume":"18","author":"AA Barker","year":"1965","unstructured":"Barker, A.A.: Monte Carlo calculations of the radial distribution functions for a proton-electron plasma. Aust. J. Phys. 18, 119\u2013133 (1965)","journal-title":"Aust. J. Phys."},{"key":"4_CR4","unstructured":"Bustos, B., Navarro, G., Ch\u00e1vez, E.: Pivot selection techniques for proximity searching in metric spaces. In: Proceedings of Computer Science Society, SCCC 2001. XXI Internatinal Conference of the Chilean, pp. 33\u201340. IEEE (2001)"},{"key":"4_CR5","volume-title":"Mixed Models: Theory and Applications with R","author":"E Demidenko","year":"2013","unstructured":"Demidenko, E.: Mixed Models: Theory and Applications with R, 2nd edn. Wiley, Hoboken (2013)","edition":"2"},{"key":"4_CR6","unstructured":"Dheeru, D., Karra Taniskidou, E.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml. University of California, Irvine, School of Information and Computer Sciences. http:\/\/archive.ics.uci.edu\/ml"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Dong, W., Charikar, M., Li, K.: Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. In: Proceedings of the 31st ACM SIGIR, pp. 123\u2013130 (2008)","DOI":"10.1145\/1390334.1390358"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Lin, K.: FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: Proceedings of ACM SIGMOD 1995, vol. 24, pp. 163\u2013174 (1995)","DOI":"10.1145\/568271.223812"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Yormark, B. (ed.) Proceedings of SIGMOD 1984, pp. 47\u201357. ACM Press (1984)","DOI":"10.1145\/971697.602266"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"WK Hastings","year":"1970","unstructured":"Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometoroka 57, 97\u2013109 (1970)","journal-title":"Biometoroka"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Higuchi, N., Imamura, Y., Kuboyama, T., Hirata, K., Shinohara, T.: Nearest neighbor search using sketches as quantized images of dimension reduction. In: Proceedings of ICPRAM 2018, pp. 356\u2013363 (2018)","DOI":"10.5220\/0006585003560363"},{"key":"4_CR12","unstructured":"Imamura, Y., Higuchi, N., Kuboyama, T., Hirata, K., Shinohara, T.: Pivot selection for dimension reduction using annealing by increasing resampling. In: Proceedings of Lernen, Wissen, Daten, Analysen (LWDA 2017), pp. 15\u201324 (2017)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Imamura, Y., Higuchi, N., Kuboyama, T., Hirata, K., Shinohara, T.: Annealing by increasing resampling in the unified view of simulated annealing. In: Proceedings of International Conference on Pattern Recognition Applications and Methods, (ICPRAM 2019), pp. 173\u2013180 (2019)","DOI":"10.5220\/0007380701730180"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Imamura, Y., Shinohara, T., Hirata, K., Kuboyama, T.: Fast hilbert sort algorithm without using hilbert indices. In: Proceedings of the Similarity Search and Applications - 9th International Conference, SISAP 2016, Tokyo, Japan, 24\u201326 October 2016, pp. 259\u2013267 (2016)","DOI":"10.1007\/978-3-319-46759-7_20"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"4_CR16","unstructured":"van de Meent, J.W., Paige, B., Wood, F.: Tempering by subsumpling. Technical report. arXiv:1401.7145v1 (2014)"},{"key":"4_CR17","unstructured":"Merendino, S., Celebi, M.E.: A simulated annealing clustering algorithm based on center perturbation using Gaussian mutation. In: Proceedings of FLAIRS Conference, pp. 456\u2013461 (2013)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1086\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Mic, V., Novak, D., Zezula, P.: Speeding up similarity search by sketches. In: Proceedings of SISAP 2016, pp. 250\u2013258 (2016)","DOI":"10.1007\/978-3-319-46759-7_19"},{"key":"4_CR20","unstructured":"M\u00fcller, A., Shinohara, T.: Efficient similarity search by reducing I\/O with compressed sketches. In: Proceedings of SISAP 2009, pp. 30\u201338 (2009)"},{"key":"4_CR21","unstructured":"Obermeyer, F., Glidden, J., Jones, E.: Scaling nonparametric Baysian inference via subsample-annealing. In: Proceedings of AISTATS 2014, pp. 696\u2013705 (2014)"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/moor.22.2.266","volume":"22","author":"PC Schuur","year":"1997","unstructured":"Schuur, P.C.: Classification of acceptance criteria for the simulated annealing algorithm. Math. Oper. Res. 22, 266\u2013275 (1997)","journal-title":"Math. Oper. Res."},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-45884-0_14","volume-title":"Progress in Discovery Science","author":"T Shinohara","year":"2002","unstructured":"Shinohara, T., Ishizaka, H.: On dimension reduction mappings for approximate retrieval of multi-dimensional data. In: Arikawa, S., Shinohara, A. (eds.) Progress in Discovery Science. LNCS (LNAI), vol. 2281, pp. 224\u2013231. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45884-0_14"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition Applications and Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40014-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T14:26:02Z","timestamp":1706106362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40014-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030400132","9783030400149"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40014-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPRAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Pattern Recognition Applications and Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpram2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icpram.org\/?y=2019","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":"Primoris","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"138","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":"25","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":"52","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":"18% - 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","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":"No","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"}]}}