{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:05:11Z","timestamp":1743033911849,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252544"},{"type":"electronic","value":"9783319252551"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25255-1_31","type":"book-chapter","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T05:39:46Z","timestamp":1443073186000},"page":"377-388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tree-Based Metric Learning for Distance Computation in Data Mining"],"prefix":"10.1007","author":[{"given":"Ming","family":"Yan","sequence":"first","affiliation":[]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,13]]},"reference":[{"key":"31_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131035. Society for Industrial and Applied Mathematics (2007)"},{"issue":"6","key":"31_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. Journal of Machine Learning Research\u00a06(6), 937\u2013965 (2005)","journal-title":"Journal of Machine Learning Research"},{"key":"31_CR3","unstructured":"Bishop, C.M., et al.: Pattern recognition and machine learning, vol.\u00a01. Springer New York (2006)"},{"key":"31_CR4","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press (2009)"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L. Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Machine Learning\u00a045(1), 5\u201332 (2001)","journal-title":"Machine Learning"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Davis, J.V., Kulis, B., Jain, P., Sra, S., Dhillon, I.S.: Information-theoretic metric learning. In: Proceedings of the 24th International Conference on Machine Learning, pp. 209\u2013216. ACM (2007)","DOI":"10.1145\/1273496.1273523"},{"key":"31_CR7","unstructured":"Goldberger, J., Roweis, S., Hinton, G., Salakhutdinov, R.: Neighbourhood components analysis (2004)"},{"key":"31_CR8","volume-title":"Data mining: concepts and techniques","author":"H. Jiawei","year":"2001","unstructured":"Jiawei, H., Kamber, M.: Data mining: concepts and techniques, vol.\u00a05. Morgan Kaufmann, San Francisco (2001)"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1561\/2200000019","volume":"5","author":"B. Kulis","year":"2012","unstructured":"Kulis, B.: Metric learning: A survey. Foundations & Trends in Machine Learning\u00a05(4), 287\u2013364 (2012)","journal-title":"Foundations & Trends in Machine Learning"},{"key":"31_CR10","unstructured":"Louppe, G.: Understanding random forests: From theory to practice. arXiv preprint arXiv:1407.7502 (2014)"},{"key":"31_CR11","unstructured":"McFee, B., Lanckriet, G.R.: Metric learning to rank. In: Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pp. 775\u2013782 (2010)"},{"key":"31_CR12","unstructured":"Pang-Ning, T., Steinbach, M., Kumar, V., et al.: Introduction to data mining. In: Library of Congress (2006)"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Rajaraman, A., Ullman, J.D.: Mining of massive datasets. Cambridge University Press (2011)","DOI":"10.1017\/CBO9781139058452"},{"key":"31_CR14","unstructured":"Weinberger, K.Q., Blitzer, J., Saul, L.K.: Distance metric learning for large margin nearest neighbor classification. In: Advances in Neural Information Processing Systems, pp. 1473\u20131480 (2005)"},{"key":"31_CR15","unstructured":"Xing, E.P., Jordan, M.I., Russell, S., Ng, A.Y.: Distance metric learning with application to clustering with side-information. In: Advances in Neural Information Processing Systems, pp. 505\u2013512 (2002)"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Xiong, C., Johnson, D., Xu, R., Corso, J.J.: Random forests for metric learning with implicit pairwise position dependence. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 958\u2013966. ACM (2012)","DOI":"10.1145\/2339530.2339680"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25255-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T13:42:31Z","timestamp":1692020551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25255-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252544","9783319252551"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25255-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}