{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:33:35Z","timestamp":1743140015038,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540896883"},{"type":"electronic","value":"9783540896890"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89689-0_90","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T07:32:14Z","timestamp":1228116734000},"page":"862-873","source":"Crossref","is-referenced-by-count":0,"title":["Local Metric Learning on Manifolds with Application to Query\u2013Based Operations"],"prefix":"10.1007","author":[{"given":"Karim","family":"Abou-Moustafa","sequence":"first","affiliation":[]},{"given":"Frank","family":"Ferrie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"90_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-74936-3_34","volume-title":"Pattern Recognition","author":"K. Abou-Moustafa","year":"2007","unstructured":"Abou-Moustafa, K., Ferrie, F.: The minimum volume ellipsoid metric. In: Hamprecht, F.A., Schn\u00f6rr, C., J\u00e4hne, B. (eds.) DAGM 2007. LNCS, vol.\u00a04713, pp. 335\u2013344. Springer, Heidelberg (2007)"},{"key":"90_CR2","first-page":"937","volume":"6","author":"A. Bar-Hillel","year":"2005","unstructured":"Bar-Hillel, A., Hertz, T., Shental, N., Weinshall, D.: Learning a mahalanobis metric from equivalence constraints. JMLR\u00a06, 937\u2013965 (2005)","journal-title":"JMLR"},{"issue":"6","key":"90_CR3","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1162\/neco.1992.4.6.888","volume":"4","author":"L. Bottou","year":"1992","unstructured":"Bottou, L., Vapnik, V.: Local learning algorithms. Neural Computation\u00a04(6), 888\u2013900 (1992)","journal-title":"Neural Computation"},{"volume-title":"Convex Optimization","year":"2004","key":"90_CR4","unstructured":"Boyd, S., Vandenberghe, L. (eds.): Convex Optimization. Cambridge Univ. Press, Cambridge (2004)"},{"key":"90_CR5","doi-asserted-by":"crossref","unstructured":"Ding, C., Li, T.: Adaptive dimension reduction using discriminant analysis and k\u2013means clustering. In: Proceedings of the 24th ICML, Corvallis, OR (2007)","DOI":"10.1145\/1273496.1273562"},{"key":"90_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Machine Learning: ECML 2006","author":"A. Dolia","year":"2006","unstructured":"Dolia, A., De Bie, T., Harris, C., Shawe-Taylor, J., Titterington, D.: The minimum volume covering ellipsoid estimation in kernel-defined feature spaces. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS, vol.\u00a04212. Springer, Heidelberg (2006)"},{"issue":"405","key":"90_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/01621459.1989.10478752","volume":"84","author":"J. Friedman","year":"1989","unstructured":"Friedman, J.: Regularized discriminant analysis. J. of the American Statistical Assoc.\u00a084(405), 165\u2013175 (1989)","journal-title":"J. of the American Statistical Assoc."},{"issue":"2","key":"90_CR8","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/T-C.1971.223208","volume":"20","author":"K. Fukunaga","year":"1971","unstructured":"Fukunaga, K., Olsen, R.: An algorithm for finding intrinsic dimensionality of data. IEEE Trans. on Computers\u00a020(2), 176\u2013183 (1971)","journal-title":"IEEE Trans. on Computers"},{"key":"90_CR9","first-page":"451","volume-title":"NIPS","author":"A. Globerson","year":"2006","unstructured":"Globerson, A., Roweis, S., Hinton, G., Salakhutdinov, R.: Metric learning by collapsing classes. In: NIPS, vol.\u00a018, pp. 451\u2013458. MIT Press, Cambridge (2006)"},{"key":"90_CR10","first-page":"513","volume-title":"NIPS","author":"J. Goldberg","year":"2005","unstructured":"Goldberg, J., Roweis, S.: Neighbourhood component analysis. In: NIPS, vol.\u00a017, pp. 513\u2013520. MIT Press, Cambridge (2005)"},{"key":"90_CR11","unstructured":"Grant, M., Boyd, S., Yinyu, Y.: Matlab software for disciplined convex programming (2005), http:\/\/www.stanford.edu\/~boyd\/cvx"},{"issue":"6","key":"90_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1109\/34.506411","volume":"18","author":"T. Hastie","year":"1996","unstructured":"Hastie, T., Tibshirani, R.: Discriminant adaptive nearest neighbour classification. IEEE Trans. PAMI\u00a018(6), 607\u2013615 (1996)","journal-title":"IEEE Trans. PAMI"},{"issue":"4","key":"90_CR13","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TPAMI.2006.77","volume":"28","author":"G. Lebanon","year":"2006","unstructured":"Lebanon, G.: Metric learning for text documents. IEEE Trans. PAMI\u00a028(4), 497\u2013508 (2006)","journal-title":"IEEE Trans. PAMI"},{"issue":"5","key":"90_CR14","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1109\/TPAMI.2007.70735","volume":"30","author":"T. Lin","year":"2008","unstructured":"Lin, T., Zha, H.: Riemannian manifold learning. IEEE. Trans. PAMI\u00a030(5), 796\u2013809 (2008)","journal-title":"IEEE. Trans. PAMI"},{"key":"90_CR15","unstructured":"Newman, D., Hettich, S., Blake, C., Merz, C.: UCI repository of machine learning databases (1998)"},{"key":"90_CR16","doi-asserted-by":"crossref","unstructured":"Rousseeuw, P.: Multivariate estimation with high breakdown point. In: Proc. of the 4th Pannonian Symp. on Mathematical Statistics, vol.\u00a03, pp. 283\u2013297 (1983)","DOI":"10.1007\/978-94-009-5438-0_20"},{"issue":"5500","key":"90_CR17","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"S. Roweis","year":"2000","unstructured":"Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding (LLE). Science\u00a0290(5500), 2323\u20132326 (2000)","journal-title":"Science"},{"key":"90_CR18","volume-title":"NIPS","author":"M. Schultz","year":"2004","unstructured":"Schultz, M., Joachims, T.: Learning a distance metric from relative comparisons. In: NIPS, vol.\u00a016. MIT Press, Cambridge (2004)"},{"issue":"5","key":"90_CR19","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/TIT.1981.1056403","volume":"27","author":"R. Short","year":"1981","unstructured":"Short, R., Fukunaga, K.: The optimal distance measure for nearest neighbour classification. IEEE Trans. on Information Theory\u00a027(5), 622\u2013627 (1981)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"5500","key":"90_CR20","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"J. Tenenbaum","year":"2000","unstructured":"Tenenbaum, J., de Silva, V., Langford, J.: A global geometric framework for nonlinear dimensionality reduction. Science\u00a0290(5500), 2319\u20132323 (2000)","journal-title":"Science"},{"issue":"3","key":"90_CR21","first-page":"227","volume":"27","author":"D. Titterington","year":"1978","unstructured":"Titterington, D.: Estimation of correleation coefficients by ellipsoidal trimming. J. of Royal Statistical Society\u00a027(3), 227\u2013234 (1978)","journal-title":"J. of Royal Statistical Society"},{"key":"90_CR22","first-page":"1473","volume-title":"NIPS","author":"K. Weinberger","year":"2006","unstructured":"Weinberger, K., Blitzer, J., Saul, L.: Distance metric learning for large margin nearest neighbor classification. In: NIPS, vol.\u00a018, pp. 1473\u20131480. MIT Press, Cambridge (2006)"},{"key":"90_CR23","unstructured":"Xing, E., Ng, A., Jordan, M., Russell, S.: Distance metric learning with application to clustering with side-information. In: NIPS, vol. 15, pp. 505\u2013512 (2003)"},{"key":"90_CR24","unstructured":"Yang, L.: Distance metric learning: A comprehensive review. Technical report, Dept. of Computer Science and Engineering, Michigan State University (2006)"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89689-0_90","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:58:31Z","timestamp":1557943111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89689-0_90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540896883","9783540896890"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89689-0_90","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}