{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:01:07Z","timestamp":1725516067145},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691594"},{"type":"electronic","value":"9783540691624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69162-4_28","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:38:20Z","timestamp":1217486300000},"page":"264-273","source":"Crossref","is-referenced-by-count":1,"title":["Using Genetic Algorithm to Balance the D-Index Algorithm for Metric Search"],"prefix":"10.1007","author":[{"given":"Tao","family":"Ban","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 311\u2013321 (1993)"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040(4), 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"28_CR3","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in matric spaces. In: Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB 1997), pp. 426\u2013435 (1997)"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8655(94)90094-9","volume":"15","author":"E. Vidal","year":"1994","unstructured":"Vidal, E.: New formulation and improvements of the nearest-neighbor approximating and eliminating search algorithm (AESA). Pattern Recognition Letters\u00a015(1), 1\u20137 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"M.L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, M.L., Oncina, J., Vidal, E.: A new version of the nearest-neighbor approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recognition Letters\u00a015(1), 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1025026030880","volume":"21","author":"V. Dohnal","year":"2003","unstructured":"Dohnal, V., Gennaro, C., Savino, P., Zezula, P.: D-Index: distance searching index for metric sata sets. Multimedia Tools and Applications\u00a021(1), 9\u201333 (2003)","journal-title":"Multimedia Tools and Applications"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00406-0","volume":"259","author":"L.M. Schmitt","year":"2001","unstructured":"Schmitt, L.M.: Theory of Genetic Algorithms. Theoretical Computer Science\u00a0259, 1\u201361 (2001)","journal-title":"Theoretical Computer Science"},{"key":"28_CR8","unstructured":"Data available at \n                    \n                      http:\/\/www.net-comber.com\/wordurls.html"},{"issue":"6","key":"28_CR9","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/69.738357","volume":"10","author":"M. Ortega","year":"1998","unstructured":"Ortega, M., Rui, Y., et al.: Supporting ranked Boolean similarity queries in MARS. IEEE Transaction on Knowledge and Data Engineering\u00a010(6), 905\u2013925 (1998)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"28_CR10","unstructured":"Data available at \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69162-4_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:29:21Z","timestamp":1620016161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69162-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540691594","9783540691624"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69162-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}