{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:11:39Z","timestamp":1648937499790},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,12]],"date-time":"2011-02-12T00:00:00Z","timestamp":1297468800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Datenbank Spektrum"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s13222-011-0046-6","type":"journal-article","created":{"date-parts":[[2011,2,11]],"date-time":"2011-02-11T13:03:46Z","timestamp":1297429426000},"page":"51-57","source":"Crossref","is-referenced-by-count":1,"title":["Projektseminar \u201eSimilarity Search Algorithms\u201c"],"prefix":"10.1007","volume":"11","author":[{"given":"Dustin","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Vogel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Draisbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Naumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,12]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/502512.502546","volume-title":"KDD \u201901: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining","author":"E Bingham","year":"2001","unstructured":"Bingham E, Mannila H (2001) Random projection in dimensionality reduction: applications to image and text data. In: KDD \u201901: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, S\u00a0245\u2013250"},{"key":"46_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.websem.2009.07.002","volume":"7","author":"C Bizer","year":"2009","unstructured":"Bizer C, Lehmann J, Kobilarov G, Auer S, Becker C, Cyganiak R, Hellmann S (2009) DBpedia\u2014a crystallization point for the Web of data. J Web Semant 7:154\u2013165","journal-title":"J Web Semant"},{"key":"46_CR3","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1145\/253260.253345","volume-title":"Proceedings of the 1997 ACM SIGMOD international conference on management of data, SIGMOD \u201997","author":"T Bozkaya","year":"1997","unstructured":"Bozkaya T, Ozsoyoglu M (1997) Distance-based indexing for high-dimensional metric spaces. In: Proceedings of the 1997 ACM SIGMOD international conference on management of data, SIGMOD \u201997. ACM, New York, S\u00a0357\u2013368"},{"issue":"4","key":"46_CR4","first-page":"574","volume":"7","author":"S Brin","year":"1995","unstructured":"Brin S (1995) Near neighbor search in large metric spaces. VLDB J 7(4):574\u2013584","journal-title":"VLDB J"},{"key":"46_CR5","first-page":"426","volume-title":"Proceedings of the 23rd international conference on very large data bases, VLDB \u201997","author":"P Ciaccia","year":"1997","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd international conference on very large data bases, VLDB \u201997. Morgan Kaufmann, San Francisco, S\u00a0426\u2013435"},{"key":"46_CR6","first-page":"73","volume-title":"Proceedings of IJCAI-03 workshop on information integration","author":"WW Cohen","year":"2003","unstructured":"Cohen WW, Ravikumar P, Fienberg SE (2003) A comparison of string distance metrics for name-matching tasks. In: Proceedings of IJCAI-03 workshop on information integration, S\u00a073\u201378"},{"key":"46_CR7","volume-title":"SAP R\/3 business blueprint: understanding the business process reference model","author":"T Curran","year":"1998","unstructured":"Curran T, Keller G, Ladd A (1998) SAP R\/3 business blueprint: understanding the business process reference model. Prentice-Hall, Upper Saddle River"},{"issue":"1","key":"46_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1025026030880","volume":"21","author":"V Dohnal","year":"2003","unstructured":"Dohnal V, Gennaro C, Savino P, Zezula P (2003) D-index: distance searching index for metric data sets. Multimed Tools Appl 21(1):9\u201333","journal-title":"Multimed Tools Appl"},{"issue":"3","key":"46_CR9","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O Gotoh","year":"1982","unstructured":"Gotoh O (1982) An improved algorithm for matching biological sequences. J Mol Biol 162(3):705\u2013708","journal-title":"J Mol Biol"},{"key":"46_CR10","first-page":"547","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard P (1901) \u00c9tude comparative de la distribution florale dans une portion des alpes et des jura. Bull Soc Vaud Sci Nat 37:547\u2013579","journal-title":"Bull Soc Vaud Sci Nat"},{"key":"46_CR11","first-page":"277","volume-title":"SIGGRAPH","author":"CE Jacobs","year":"1995","unstructured":"Jacobs CE, Finkelstein A, Salesin D (1995) Fast multiresolution image querying. In: SIGGRAPH, S\u00a0277\u2013286"},{"key":"46_CR12","volume-title":"SAP R\/3 process oriented implementation","author":"G Keller","year":"1998","unstructured":"Keller G, Teufel T (1998) SAP R\/3 process oriented implementation, 1.\u00a0Aufl. Addison-Wesley\/Longman, Boston","edition":"1"},{"key":"46_CR13","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov Phys Dokl 10:707\u2013710","journal-title":"Sov Phys Dokl"},{"key":"46_CR14","volume-title":"Proceedings of the eighth IEEE workshop on applications of computer vision","author":"T Liu","year":"2007","unstructured":"Liu T, Rosenberg C, Rowley H (2007) Clustering billions of images with large scale nearest neighbor search. In: Proceedings of the eighth IEEE workshop on applications of computer vision. IEEE Comput Soc, Los Alamitos"},{"key":"46_CR15","first-page":"416","volume-title":"Proc 8th int\u2019l conf computer vision","author":"D Martin","year":"2001","unstructured":"Martin D, Fowlkes C, Tal D, Malik J (2001) A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc 8th int\u2019l conf computer vision, July 2001, Bd\u00a02, S\u00a0416\u2013423"},{"issue":"1","key":"46_CR16","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"ML Mic\u00f3","year":"1994","unstructured":"Mic\u00f3 ML, Oncina J, Vidal E (1994) A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recognit Lett 15(1):9\u201317","journal-title":"Pattern Recognit Lett"},{"key":"46_CR17","first-page":"267","volume-title":"Proceedings of the second international conference on knowledge discovery and data mining","author":"A Monge","year":"1996","unstructured":"Monge A, Elkan C (1996) The field matching problem: algorithms and applications. In: Proceedings of the second international conference on knowledge discovery and data mining, S\u00a0267\u2013270"},{"issue":"1","key":"46_CR18","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres J (1957) Algorithms for the assignment and transportation problems. J Soc Ind Appl Math 5(1):32\u201338","journal-title":"J Soc Ind Appl Math"},{"key":"46_CR19","first-page":"150","volume-title":"Proceedings of the IEEE conference on computer vision and pattern recognition","author":"C Olson","year":"1998","unstructured":"Olson C (1998) A probabilistic formulation for Hausdorff matching. In: Proceedings of the IEEE conference on computer vision and pattern recognition, S\u00a0150\u2013156"},{"key":"46_CR20","first-page":"253","volume-title":"Phil Trans R Soc Lond","author":"K Pearson","year":"1896","unstructured":"Pearson K (1896) Mathematical contributions to the theory of evolution. III.\u00a0Regression, heredity, and panmixia. In: Phil Trans R Soc Lond, Bd 187, S\u00a0253\u2013318"},{"key":"46_CR21","first-page":"38","volume":"18","author":"L Philips","year":"2000","unstructured":"Philips L (2000) The double metaphone search algorithm. C\/C++ Users J 18:38\u201343","journal-title":"C\/C++ Users J"},{"key":"46_CR22","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/368273.368579","volume":"5","author":"W Phillips Jr","year":"1962","unstructured":"Phillips W Jr, Bahn AK, Miyasaki M (1962) Person-matching by electronic methods. Commun ACM 5:404\u2013407","journal-title":"Commun ACM"},{"key":"46_CR23","first-page":"925","volume":"19","author":"H-J Postel","year":"1969","unstructured":"Postel H-J (1969) Die K\u00f6lner Phonetik \u2013 Ein Verfahren zur Identifizierung von Personennamen auf der Grundlage der Gestaltanalyse. IBM-Nachr 19:925\u2013931","journal-title":"IBM-Nachr"},{"key":"46_CR24","volume-title":"Foundations of multidimensional and metric data structures","author":"H Samet","year":"2006","unstructured":"Samet H (2006) Foundations of multidimensional and metric data structures. Morgan Kaufmann, San Mateo"},{"key":"46_CR25","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/j.is.2003.12.003","volume":"29","author":"WE Winkler","year":"2003","unstructured":"Winkler WE (2003) Methods for evaluating and creating data quality. Inf Syst (Oxf) 29:531\u2013550","journal-title":"Inf Syst (Oxf)"},{"key":"46_CR26","volume-title":"SODA: ACM-SIAM symposium on discrete algorithms (A conference on theoretical and experimental analysis of discrete algorithms)","author":"PN Yianilos","year":"1993","unstructured":"Yianilos PN (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA: ACM-SIAM symposium on discrete algorithms (A conference on theoretical and experimental analysis of discrete algorithms)"},{"key":"46_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity search\u2014the metric space approach","author":"P Zezula","year":"2006","unstructured":"Zezula P, Amato G, Dohnal V, Batko M (2006) Similarity search\u2014the metric space approach. Springer, Berlin"}],"container-title":["Datenbank-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-011-0046-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13222-011-0046-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-011-0046-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T14:12:33Z","timestamp":1560003153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13222-011-0046-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,12]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["46"],"URL":"https:\/\/doi.org\/10.1007\/s13222-011-0046-6","relation":{},"ISSN":["1618-2162","1610-1995"],"issn-type":[{"value":"1618-2162","type":"print"},{"value":"1610-1995","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,12]]}}}