{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T19:49:32Z","timestamp":1759693772135,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T00:00:00Z","timestamp":1454457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61170076","U1301252","61471243"],"award-info":[{"award-number":["61170076","U1301252","61471243"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"China-863","award":["2015AA015305"],"award-info":[{"award-number":["2015AA015305"]}]},{"name":"Guangdong Key Laboratory Project","award":["2012A061400024"],"award-info":[{"award-number":["2012A061400024"]}]},{"name":"NSF-Shenzhen","award":["JCYJ20150731160834611","JCYJ20140418095735561"],"award-info":[{"award-number":["JCYJ20150731160834611","JCYJ20140418095735561"]}]},{"name":"Shenzhen-Hong Kong Innovation circle project","award":["SGLH20131010163759789"],"award-info":[{"award-number":["SGLH20131010163759789"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s13042-016-0504-4","type":"journal-article","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T09:36:11Z","timestamp":1454492171000},"page":"311-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Pivot selection for metric-space indexing"],"prefix":"10.1007","volume":"7","author":[{"given":"Rui","family":"Mao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peihan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minhua","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,3]]},"reference":[{"issue":"1","key":"504_CR1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MCOM.2015.7010514","volume":"53","author":"R Mao","year":"2015","unstructured":"Mao R, Honglong X, Wenbo W, Li J, Li Y, Minhua L (2015) Overcoming the challenge of variety: big data abstraction, the next evolution of data management for AAL communication systems. IEEE Commun Mag 53(1):42\u201347","journal-title":"IEEE Commun Mag"},{"key":"504_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2178-2","volume-title":"Advanced linear. Algebra graduate texts in mathematics","author":"S Roman","year":"1992","unstructured":"Roman S (1992) Advanced linear. Algebra graduate texts in mathematics, vol 135. Springer, Berlin"},{"issue":"3","key":"504_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Chavez","year":"2001","unstructured":"Chavez E, Navarro G, Baeza-Yates R, Marroqu J (2001) Searching in metric spaces. ACM Comput Surv 33(3):273\u2013321","journal-title":"ACM Comput Surv"},{"key":"504_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity search: the metric space approach","author":"P Zezula","year":"2006","unstructured":"Zezula P, Amato G, Dohnal V, Batko M (2006) Similarity search: the metric space approach. Springer, Heidelberg"},{"key":"504_CR5","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 Francisco"},{"issue":"4","key":"504_CR6","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G Hjaltason","year":"2003","unstructured":"Hjaltason G, Samet H (2003) Index-driven similarity search in metric spaces. ACM Trans Database Syst (TODS) 28(4):517\u2013580","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"504_CR7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.jda.2011.10.004","volume":"13","author":"R Mao","year":"2012","unstructured":"Mao R, Miranker W, Miranker DP (2012) Pivot Selection: dimension reduction for distance-based indexing. J Discret Algorithm Elsevier 13:32\u201346","journal-title":"J Discret Algorithm Elsevier"},{"issue":"4","key":"504_CR8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann JK (1991) Satisfying general proximity\/similarity queries with metric trees. Inf Proc Lett 40(4):175\u2013179","journal-title":"Inf Proc Lett"},{"key":"504_CR9","unstructured":"Yianilos PN (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In the fourth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics"},{"issue":"3","key":"504_CR10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T Bozkaya","year":"1999","unstructured":"Bozkaya T, Ozsoyoglu M (1999) Indexing large metric spaces for similarity search queries. ACM Trans Database Syst 24(3):361\u2013404","journal-title":"ACM Trans Database Syst"},{"issue":"14","key":"504_CR11","doi-asserted-by":"crossref","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B Bustos","year":"2003","unstructured":"Bustos B, Navarro G, Chavez E (2003) Pivot selection techniques for proximity searching in metric spaces. Pattern Recogn Lett 24(14):2357\u20132366","journal-title":"Pattern Recogn Lett"},{"key":"504_CR12","unstructured":"Clarkson KL (2006) Nearest-neighbor searching and metric space dimensions, In: Nearest-neighbor methods for learning and vision: theory and practice, MIT Press, pp. 15\u201359"},{"key":"504_CR13","first-page":"681","volume":"15","author":"B Kegl","year":"2003","unstructured":"Kegl B (2003) Intrinsic dimension estimation using packing numbers. Adv Neural Inf Proc Syst 15:681\u2013688","journal-title":"Adv Neural Inf Proc Syst"},{"issue":"12","key":"504_CR14","doi-asserted-by":"crossref","first-page":"2945","DOI":"10.1016\/S0031-3203(03)00176-6","volume":"36","author":"F Camastra","year":"2003","unstructured":"Camastra F (2003) Data dimensionality estimation methods: a survey. Pattern Recogn 36(12):2945\u20132954","journal-title":"Pattern Recogn"},{"key":"504_CR15","doi-asserted-by":"crossref","unstructured":"Mao R, Xu W, Ramakrishnan S, Nuckolls G, Miranker DP (2005) On optimizing distance-based similarity search for biological databases. In the 2005 IEEE computational systems bioinformatics conference (CSB 2005)","DOI":"10.1109\/CSB.2005.42"},{"key":"504_CR16","doi-asserted-by":"crossref","unstructured":"Traina C, Jr, Traina A, Faloutsos C (1999) Distance exponent: a new concept for selectivity estimation in metric trees, Technical Report CMU-CS-99-110, Computer Science Department, Carnegie Mellon University","DOI":"10.21236\/ADA363780"},{"key":"504_CR17","doi-asserted-by":"crossref","unstructured":"Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201cnearest neighbor\u201d meaningful? The 7th international conference on database theory. Springer, Berlin","DOI":"10.1007\/3-540-49257-7_15"},{"key":"504_CR18","doi-asserted-by":"crossref","unstructured":"Shaft U, Ramakrishnan R (2005) When is nearest neighbors indexable? In the tenth international conference on database theory (ICDT 2005). Springer, Berlin","DOI":"10.1007\/978-3-540-30570-5_11"},{"issue":"1\u20132","key":"504_CR19","first-page":"189","volume":"9D","author":"P Grassberger","year":"1983","unstructured":"Grassberger P, Procaccia I (1983) Measuring the strangeness of strange attractors. Physica 9D(1\u20132):189\u2013208","journal-title":"Physica"},{"key":"504_CR20","first-page":"626","volume":"10","author":"S Roweis","year":"1997","unstructured":"Roweis S (1997) EM Algorithms for PCA and SPCA. Neural Inf Proc Syst 10:626\u2013632","journal-title":"Neural Inf Proc Syst"},{"key":"504_CR21","unstructured":"Brin S (1995) Near neighbor search in large metric spaces. In the 21th international conference on very large data bases (VLDB\u201995). 1995. Zurich, Switzerland, Morgan Kaufmann Publishers Inc"},{"key":"504_CR22","doi-asserted-by":"crossref","unstructured":"Ciaccia P, Patella M (1997) Bulk loading the M-tree. In 9th Australasian database conference (ADO\u201998)","DOI":"10.1007\/BFb0100974"},{"key":"504_CR23","doi-asserted-by":"crossref","unstructured":"Navarro G (1999) Searching in metric spaces by spatial approximation. In: Proceedings of the string processing and information retrieval symposium and international workshop on groupware. IEEE Computer Society","DOI":"10.1109\/SPIRE.1999.796589"},{"key":"504_CR24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theoret Comput Sci 38:293\u2013306","journal-title":"Theoret Comput Sci"},{"issue":"2","key":"504_CR25","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, David B (1985) Shmoys, A best possible heuristic for the k-center problem. Math Op Res 10(2):180\u2013184","journal-title":"Math Op Res"},{"key":"504_CR26","unstructured":"The UMAD project: https:\/\/github.com\/ruimao\/UMAD"},{"key":"504_CR27","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman SB, Wunsch CD (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 48:443\u2013453","journal-title":"J Mol Biol"},{"issue":"8","key":"504_CR28","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1093\/bioinformatics\/bth065","volume":"20","author":"W Xu","year":"2004","unstructured":"Xu W, Miranker DP (2004) A metric model of amino acid substitution. Bioinformatics 20(8):1214\u20131221","journal-title":"Bioinformatics"},{"key":"504_CR29","doi-asserted-by":"crossref","unstructured":"Navarro G (2009) Analyzing metric space indexes: what for? In the proceedings of the second international conference on similarity search and applications (SISAP2009), pp. 3\u201310","DOI":"10.1109\/SISAP.2009.17"},{"issue":"5","key":"504_CR30","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1007\/s00778-007-0062-1","volume":"17","author":"J Venkateswaran","year":"2008","unstructured":"Venkateswaran J, Kahveci T, Jermaine CM, Lachwani D (2008) Reference-based indexing for metric spaces with costly distance measures. VLDB J 17(5):1231\u20131251 Springer","journal-title":"VLDB J"},{"key":"504_CR31","doi-asserted-by":"crossref","unstructured":"Celik C (2002) Priority vantage points structures for similarity queries in metric spaces. In: Proceedings of EurAsia-ICT 2002: information and communication technology, ser. LNCS(2510). pp. 256\u2013263. Springer","DOI":"10.1007\/3-540-36087-5_30"},{"key":"504_CR32","doi-asserted-by":"crossref","unstructured":"Celik C (2008) Effective use of space for pivot-based metric indexing structures. In: Proceedings of international workshop on similarity search and applications (SISAP\u201908). IEEE Press, pp. 402\u2013409","DOI":"10.1109\/SISAP.2008.22"},{"issue":"1","key":"504_CR33","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"5","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 Recognition Letters 5(1):9\u201317","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"504_CR34","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0031-3203(00)00120-5","volume":"35","author":"J Vleugels","year":"2002","unstructured":"Vleugels J, Veltkamp RC (2002) Efficient image retrieval through vantage objects. Pattern Recogn. 35(1):69\u201380 Elsevier","journal-title":"Pattern Recogn."},{"issue":"3","key":"504_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2000486.2000490","volume":"7","author":"RH Leuken Van","year":"2011","unstructured":"Van Leuken RH, Veltkamp RC (2011) Selecting vantage objects for similarity indexing. ACM Trans Multim Comput Commun Appl 7(3):1\u201318","journal-title":"ACM Trans Multim Comput Commun Appl"},{"issue":"5","key":"504_CR36","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/359581.359599","volume":"20","author":"M Shapiro","year":"1977","unstructured":"Shapiro M (1977) The choice of reference points in best-match file searching. Commun ACM 20(5):339\u2013343","journal-title":"Commun ACM"},{"issue":"7","key":"504_CR37","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0167-8655(92)90064-7","volume":"13","author":"V Ramasubramanian","year":"1992","unstructured":"Ramasubramanian V, Paliwal KK (1992) An efficient approximation-elimination algorithm for fast nearest-neighbor search based on a spherical distance coordinate formulation. Pattern Recogn Lett 13(7):471\u2013480","journal-title":"Pattern Recogn Lett"},{"issue":"4","key":"504_CR38","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s00778-005-0178-0","volume":"16","author":"C Traina Jr","year":"2007","unstructured":"Traina C Jr, Filho RF, Traina AJ, Vieira MR, Faloutsos C (2007) The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J 16(4):483\u2013505","journal-title":"VLDB J"},{"issue":"5","key":"504_CR39","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1142\/S0218213005002430","volume":"14","author":"R Mao","year":"2005","unstructured":"Mao R, Xu W, Singh N, Miranker DP (2005) An assessment of a metric space database index to support sequence homology. Int J Artif Intell Tools 14(5):867\u2013885","journal-title":"Int J Artif Intell Tools"},{"issue":"9","key":"504_CR40","doi-asserted-by":"crossref","first-page":"2187","DOI":"10.1016\/S0031-3203(02)00326-6","volume":"36","author":"C Hennig","year":"2003","unstructured":"Hennig C, Latecki LJ (2003) The choice of vantage objects for image retrieval. Pattern Recognit 36(9):2187\u20132196","journal-title":"Pattern Recognit"},{"key":"504_CR41","doi-asserted-by":"crossref","unstructured":"Brisaboa NR, Farina A, Pedreira O, Reyes N (2006) Similarity search using sparse pivots for efficient multimedia information retrieval. In Proceedings of the 8th IEEE international symposium on multimedia (ISM\u201906). IEEE Press, pp. 881\u2013888","DOI":"10.1109\/ISM.2006.137"},{"key":"504_CR42","doi-asserted-by":"crossref","unstructured":"Bustos B, Pedreira O, Brisaboa NR (2008) A dynamic pivot selection technique for similarity search in metric spaces. In Proceedings of 1st international workshop on similarity search and applications (SISAP\u201908). IEEE Press, pp. 105\u2013112","DOI":"10.1109\/SISAP.2008.12"},{"key":"504_CR43","doi-asserted-by":"crossref","unstructured":"Berman A, Shapiro LG (1998) Selecting good keys for triangle-inequality-based pruning algorithms. In: Proceedings of the 1998 international workshop on content-based access of image and video databases (CAIVD \u201898), pp. 12\u201319,1998, Bombay, India","DOI":"10.1109\/CAIVD.1998.646029"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-016-0504-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-016-0504-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-016-0504-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T04:08:15Z","timestamp":1718338095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-016-0504-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,3]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["504"],"URL":"https:\/\/doi.org\/10.1007\/s13042-016-0504-4","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2016,2,3]]}}}