{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T12:26:31Z","timestamp":1672575991830},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,12]],"date-time":"2014-10-12T00:00:00Z","timestamp":1413072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Digit Libr"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00799-014-0128-9","type":"journal-article","created":{"date-parts":[[2014,10,13]],"date-time":"2014-10-13T01:22:59Z","timestamp":1413163379000},"page":"79-93","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A locality-aware similar information searching scheme"],"prefix":"10.1007","volume":"17","author":[{"given":"Ting","family":"Li","sequence":"first","affiliation":[]},{"given":"Yuhua","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Haiying","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,12]]},"reference":[{"issue":"3\u20134","key":"128_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C Faloutsos","year":"1994","unstructured":"Faloutsos, C., Barber, R., Flickner, M., Hafner, J., Niblack, W., Petkovic, D., Equitz, W.: Efficient and effective querying by image content. Intell. Inf. Syst. 3(3\u20134), 231\u2013262 (1994)","journal-title":"Intell. Inf. Syst."},{"key":"128_CR2","doi-asserted-by":"crossref","unstructured":"Maio, D., Maltoni, D.: A structural approach to fingerprint classification. In: Proceedings of the International Conference on Pattern Recognition (ICPR) (1996)","DOI":"10.1109\/ICPR.1996.547013"},{"key":"128_CR3","unstructured":"Lu, X., Wang, Y., Jain, A.K.: Combining classifiers for face recognition. In: Proceedings of the International Conference on Multimedia and Expo (ICME), vol. 3 (2003)"},{"key":"128_CR4","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","DOI":"10.1145\/502807.502808"},{"key":"128_CR5","volume-title":"General Topology","author":"John L Kelley","year":"1975","unstructured":"Kelley, John L.: General Topology. Springer, New York (1975)"},{"key":"128_CR6","unstructured":"K\u00f6ppen, M.: The curse of dimensionality. In: Proceedings of 5th Online World Conference on Soft Computing in Industrial Applications (WSC5), pp. 4\u20138 (2000)"},{"key":"128_CR7","doi-asserted-by":"crossref","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: Proceedings of the 7th International Conference on Database Theory (ICDT) (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"128_CR8","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of VLDB (1999)"},{"key":"128_CR9","doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","DOI":"10.1145\/361002.361007"},{"key":"128_CR10","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of International Conference on Management of Data, pp. 47\u201357. ACM (1984)","DOI":"10.1145\/602259.602266"},{"key":"128_CR11","doi-asserted-by":"crossref","unstructured":"Fu, A., Chan, P.M.S., Cheung, Y.L., Moon, Y.S.: Dynamic vp-tree indexing for $$n$$ n -nearest neighbor search given pair-wise distances. VLDB 9(2), 154\u2013173 (2000)","DOI":"10.1007\/PL00010672"},{"key":"128_CR12","doi-asserted-by":"crossref","unstructured":"Burkhard, W.A., Keller, R.M.: Some approaches to best-match file searching. Commun. ACM 16(4), 230\u2013236 (1973)","DOI":"10.1145\/362003.362025"},{"issue":"4","key":"128_CR13","first-page":"792","volume":"14","author":"C Li","year":"2002","unstructured":"Li, C., Chang, E., Garcia, H., Wiederhold, G.: Clustering for approximate similarity search in high-dimensional spaces. TKDE 14(4), 792\u2013808 (2002)","journal-title":"TKDE"},{"key":"128_CR14","doi-asserted-by":"crossref","unstructured":"Patella, M., Ciaccia, P.: The many facets of approximate similarity search. In: Proceedings of the First International Workshop on Similarity Search and Applications (SISAP), (2008)","DOI":"10.1109\/SISAP.2008.18"},{"key":"128_CR15","doi-asserted-by":"crossref","unstructured":"Santini, S., Jain, R.: Beyond query by example. In: Proceedings of the Sixth ACM International Conference on Multimedia (Multimedia) (1998)","DOI":"10.1145\/290747.290800"},{"key":"128_CR16","unstructured":"Bartholdi, J.J. III, Goldsman, P.: Vertex-labeling algorithms for the Hilbert spacingfilling curve. Softw. Pract. Exp. 31(5), 395\u2013408 (2001)"},{"key":"128_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0871-6","volume-title":"Space-Filling Curves","author":"H Sagan","year":"1994","unstructured":"Sagan, H.: Space-Filling Curves. Springer, New York (1994)"},{"key":"128_CR18","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C.: Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neighbor search. In: Proceedings of ACM SIGMOD Conference (2002)","DOI":"10.1145\/564691.564743"},{"key":"128_CR19","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD) (2003)","DOI":"10.1145\/872757.872795"},{"issue":"1","key":"128_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"128_CR21","doi-asserted-by":"crossref","unstructured":"Linial, N., Sasson, O.: Non-expansive hashing. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (STOC) (1996)","DOI":"10.1145\/237814.237999"},{"key":"128_CR22","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of 13th Annual ACM Symposiumon Theory of Computing (1998)","DOI":"10.1145\/276698.276876"},{"key":"128_CR23","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions, In: Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG) (2004)","DOI":"10.1145\/997817.997857"},{"issue":"5","key":"128_CR24","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1093\/bioinformatics\/17.5.419","volume":"17","author":"J Buhler","year":"2001","unstructured":"Buhler, J.: Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics 17(5), 419\u2013428 (2001)","journal-title":"Bioinformatics"},{"key":"128_CR25","volume-title":"High-Dimensional Similarity Search Using Data Sensitive Space Partitioning","author":"S Kulkarni","year":"2006","unstructured":"Kulkarni, S., Orlandic, R.: High-Dimensional Similarity Search Using Data Sensitive Space Partitioning, vol. 4080. Springer, Berlin (2006)"},{"key":"128_CR26","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"128_CR27","unstructured":"Kamel, I., Faloutsos, C.: Hilbert r-tree: an improved r-tree using fractals. In: Proceedings of VLDB, pp. 500\u2013509. Morgan Kaufmann, San Francisco (1994)"},{"key":"128_CR28","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity indexing with the ss-tree. In: Proceedings of the Twelfth International Conference on Data Engineering (ICDE) (1996)","DOI":"10.1109\/ICDE.1996.492202"},{"key":"128_CR29","unstructured":"Digout, C.: Metric techniques for high-dimensional indexing. Technical Report TR 04\u201319, University of Alberta, Canada (2004)"},{"key":"128_CR30","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The sr-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD) (1997)","DOI":"10.1145\/253260.253347"},{"key":"128_CR31","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-trees: an efficient access method for similarity search in metric space. In: Proceedings of the 23rd International Conference on Very Large Data Bases (1997)"},{"key":"128_CR32","unstructured":"Marschner, C.: Mtree tester applet. http:\/\/www.cmarschner.net\/mtree.html"},{"key":"128_CR33","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the 24th International Conference on Very Large Data Bases (VLDB) (1998)"},{"key":"128_CR34","doi-asserted-by":"crossref","unstructured":"Digout, C., Nascimento, M.A.: High-dimensional similarity searches using a metric pseudo-grid. In: Proceedings of the 21st International Conference on Data Engineering Workshops (ICDEW) (2005)","DOI":"10.1109\/ICDE.2005.226"},{"key":"128_CR35","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Proceedings of NIPS (2008)"},{"issue":"8","key":"128_CR36","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1016\/j.sigpro.2012.05.033","volume":"93","author":"F Zou","year":"2013","unstructured":"Zou, F., Liu, C., Ling, H., Feng, H., Yan, L., Li, D.: Least square regularized spectral hashing for similarity search. Signal Process. 93(8), 2265\u20132273 (2013)","journal-title":"Signal Process."},{"key":"128_CR37","unstructured":"Barthholdi, J.J. III, Platzman., L.K.: Heuristics based on spacefilling curves for combinatorial problems in euclidean space. Manag. Sci. 34(3), 291\u2013305 (1988)"},{"key":"128_CR38","doi-asserted-by":"crossref","unstructured":"Liao, S., Lopez, M., Leutenegger, S.: High dimensional similarity search with space filling curves. In: Proceedings of ICDE (2001)","DOI":"10.1109\/ICDE.2001.914876"},{"issue":"1","key":"128_CR39","first-page":"124","volume":"13","author":"B Moon","year":"2001","unstructured":"Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.: Analysis of the clustering properties of the Hilbert space-filling curve. TKDE 13(1), 124\u2013141 (2001)","journal-title":"TKDE"},{"key":"128_CR40","doi-asserted-by":"crossref","unstructured":"Mokbel, M.F., Aref, W.G.: Irregularity in multi-dimensional space-filling curves with applications in multimedia databases. In: Proceedings of CIKM, pp. 512\u2013519 (2001)","DOI":"10.1145\/502585.502671"},{"key":"128_CR41","doi-asserted-by":"crossref","unstructured":"Castro, J., Georgiopoulos, M., Demara, R., Gonzalez, A.: Data-partitioning using the Hilbert space filling curves: effect on the speed of convergence of fuzzy artmap for large database problems. Neural Netw. 18(7), 967\u2013984 (2005)","DOI":"10.1016\/j.neunet.2005.01.007"},{"key":"128_CR42","unstructured":"Abel, D.J., Mark, D.M.: A comparative analysis of some two-dimensional orderings. Int. J. Geogr. Inf. Sci. 4(1), 21\u201331 (1990)"},{"key":"128_CR43","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V.: Linear clustering of objects with multiple attributes. SIGMOD Rec. 19(2), 332\u2013342 (1990)","DOI":"10.1145\/93605.98742"},{"key":"128_CR44","unstructured":"Salton, G., Wong, A., Yang, C.S.: A vector space model for automatic indexing. Technical report, Cornell University, Ithaca (1974)"},{"key":"128_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-3005-5","volume-title":"Information Retrieval: Algorithm and Heuristics","author":"D Grossman","year":"2004","unstructured":"Grossman, D., Frieder, O.: Information Retrieval: Algorithm and Heuristics. Springer, Netherlands (2004)"},{"issue":"4","key":"128_CR46","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/296854.277632","volume":"23","author":"J Zobel","year":"1998","unstructured":"Zobel, J., Moffat, A., Ramamohanarao, K.: Inverted files versus signature files for text indexing. ACM Trans. Database Syst. 23(4), 453\u2013490 (1998)","journal-title":"ACM Trans. Database Syst."},{"key":"128_CR47","unstructured":"Lucene, A. http:\/\/lucene.apache.org\/core\/4_9_0\/index.html"},{"key":"128_CR48","doi-asserted-by":"crossref","unstructured":"Thomee, B., Huiskes, Mark J., Lew, Michael S.: New trends and ideas in visual concept detection: the mir flickr retrieval evaluation initiative. In: Proceedings of MIR (2010)","DOI":"10.1145\/1743384.1743475"}],"container-title":["International Journal on Digital Libraries"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00799-014-0128-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00799-014-0128-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00799-014-0128-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00799-014-0128-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T23:53:08Z","timestamp":1565913188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00799-014-0128-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,12]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["128"],"URL":"https:\/\/doi.org\/10.1007\/s00799-014-0128-9","relation":{},"ISSN":["1432-5012","1432-1300"],"issn-type":[{"value":"1432-5012","type":"print"},{"value":"1432-1300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,12]]},"assertion":[{"value":"5 June 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2014","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2014","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2014","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}