{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:01:52Z","timestamp":1725483712829},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679806"},{"type":"electronic","value":"9783540444664"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44466-1_36","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:05:17Z","timestamp":1178355917000},"page":"358-371","source":"Crossref","is-referenced-by-count":0,"title":["Cofe: A Scalable Method for Feature Extraction from Complex Objects"],"prefix":"10.1007","author":[{"given":"Gabriela","family":"Hristescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Farach-Colton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,6]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1093\/nar\/26.1.38","volume":"26","author":"A. Bairoch","year":"1998","unstructured":"Bairoch, A., Apweiler, R.: The SWISS-PROT protein sequence data bank and its supplement TrEMBL in 1998. Nucleic Acids Res. 26 (1998) 38\u201342","journal-title":"Nucleic Acids Res"},{"key":"36_CR2","unstructured":"Berchtold, S., B\u00f6hm, C.: The Pyramid-Technique: Towards breaking the curse of dimensionality. Proc. ACM SIGMOD Conf. (1998) 142\u2013176"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Keim, D.A., Kriegel, H.-P.: A cost model for nearest neighbor search in high-dimensional data space. Proc. ACM PODS Symposium (1997)","DOI":"10.1145\/263661.263671"},{"key":"36_CR4","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An index structure for highdimensional data. Proc. 22nd VLDB Conf. (1996) 28\u201339"},{"key":"36_CR5","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*. tree: An E.cient and Robust Access Method for Points and Rectangles. Proc. ACM SIGMOD Conf. (1990) 322\u2013331"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF02776078","volume":"52","author":"J. Bourgain","year":"1985","unstructured":"Bourgain, J.: On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. of Math. (1985) 52:46\u201352","journal-title":"Israel J. of Math."},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/568271.223812","volume":"24","author":"C. Faloutsos","year":"1995","unstructured":"Faloutsos, C., Lin, K.-I.: FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. Proc. ACM SIGMOD 24(2) (1995) 163\u2013174","journal-title":"Proc. ACM SIGMOD"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Fukunaga, K.: Introduction to Statistical Pattern Recognition. Academic Press, 2nd Edition (1990)","DOI":"10.1016\/B978-0-08-047865-4.50007-7"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Ganti, V., Ramakrishnan, R., Gehrke, J., Powell, A., French, J.: Clustering large datasets in arbitrary metric spaces. Proc. 15th ICDE Conf. (1999) 502\u2013511","DOI":"10.1109\/ICDE.1999.754966"},{"key":"36_CR10","unstructured":"Golub, G. H., Van Loan, C. F.: Matrix computations. Johns Hopkins University Press, 2nd Edition (1989)"},{"key":"36_CR11","unstructured":"Kanth, K. V. R., Agrawal, D., Singh, A.: Dimensionality reduction for similarity searching in dynamic databases. Proc. ACM SIGMOD Conf. (1998) 142\u2013176"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: An index structure for high-dimensional nearest neighbor queries. Proc. ACM SIGMOD Conf. (1997) 369\u2013380","DOI":"10.1145\/253260.253347"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"J.B. Kruskal","year":"1964","unstructured":"Kruskal, J.B.: Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis. Psychometrika 29 (1964) 1\u201327","journal-title":"Psychometrika"},{"key":"36_CR14","first-page":"296","volume-title":"Stat. Meth. for Digital Computers","author":"J.B. Kruskal","year":"1977","unstructured":"Kruskal, J.B.: Multidimensional Scaling and other Methods for Discovering Structure. Stat. Meth. for Digital Computers, Wiley, New York (1977) 296\u2013339"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B., Wish, M.: Multidimensional Scaling. Sage University Paper series on Quantitative Applications in the Social Sciences, Beverly Hills, CA (1978) 7\u201311","DOI":"10.4135\/9781412985130"},{"issue":"4","key":"36_CR16","first-page":"517","volume":"3","author":"K.-I. Lin","year":"1994","unstructured":"Lin, K.-I., Jagadish, H. V., Faloutsos, C.: The TV-tree: An index structure for high-dimensional data. Proc. 20th VLDB Conf. 3(4) (1994) 517\u2013542","journal-title":"Proc. 20th VLDB Conf."},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Proc. 35th IEEE FOCS Symp. (1994) 577\u2013591","DOI":"10.1109\/SFCS.1994.365733"},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1006\/jmbi.1997.0948","volume":"268","author":"M. Linial","year":"1997","unstructured":"Linial, M., Linial, N., Tishby, N., Yona, G.: Global self organization of all known protein sequences reveals inherent biological signatures. J. Mol. Biol. 268 (1997) 539\u2013556","journal-title":"J. Mol. Biol."},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T. Smith","year":"1981","unstructured":"Smith, T., Waterman, M.: The identi.cation of common molecular subsequences. J. Mol. Biol. 147 (1981) 195\u2013197","journal-title":"J. Mol. Biol."},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"White, D. A., Jain, R.: Similarity Indexing with the SS-tree. Proc. 12th ICDE Conf. (1996) 516\u2013523","DOI":"10.1109\/ICDE.1996.492202"},{"key":"36_CR21","unstructured":"Wang, W., Yang, J., Muntz, R. R.: PK-tree: A Spatial Index Structure for High Dimensional Point Data. 5th Intl. FODO Conf. (1998)"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramkarishnan, R., Livny, M.: Birch: An efficient data clustering method for large databases. Proc. ACM SIGMOD Conf. (1996) 103\u2013114","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44466-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:39:53Z","timestamp":1556375993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44466-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679806","9783540444664"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44466-1_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}