{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:45:35Z","timestamp":1743075935780,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642231988"},{"type":"electronic","value":"9783642231995"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23199-5_2","type":"book-chapter","created":{"date-parts":[[2011,8,13]],"date-time":"2011-08-13T00:34:17Z","timestamp":1313195657000},"page":"16-30","source":"Crossref","is-referenced-by-count":13,"title":["Hubness-Based Fuzzy Measures for High-Dimensional k-Nearest Neighbor Classification"],"prefix":"10.1007","author":[{"given":"Nenad","family":"Toma\u0161ev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milo\u0161","family":"Radovanovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dunja","family":"Mladeni\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirjana","family":"Ivanovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"2_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1109\/TKDE.2007.1037","volume":"19","author":"D. Fran\u00e7ois","year":"2007","unstructured":"Fran\u00e7ois, D., Wertz, V., Verleysen, M.: The concentration of fractional distances. IEEE Transactions on Knowledge and Data Engineering\u00a019(7), 873\u2013886 (2007)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-44503-X_27","volume-title":"Database Theory - ICDT 2001","author":"C.C. Aggarwal","year":"2000","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional spaces. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 420\u2013434. Springer, Heidelberg (2000)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-13818-8_34","volume-title":"Scientific and Statistical Database Management","author":"M.E. Houle","year":"2010","unstructured":"Houle, M.E., Kriegel, H.P., Kr\u00f6ger, P., Schubert, E., Zimek, A.: Can shared-neighbor distances defeat the curse of dimensionality? In: Gertz, M., Lud\u00e4scher, B. (eds.) SSDBM 2010. LNCS, vol.\u00a06187, pp. 482\u2013500. Springer, Heidelberg (2010)"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jco.2009.02.011","volume":"25","author":"R.J. Durrant","year":"2009","unstructured":"Durrant, R.J., Kab\u00e1n, A.: When is \u2018nearest neighbour\u2019 meaningful: A converse theorem and implications. Journal of Complexity\u00a025(4), 385\u2013397 (2009)","journal-title":"Journal of Complexity"},{"key":"2_CR5","first-page":"2487","volume":"11","author":"M. Radovanovi\u0107","year":"2010","unstructured":"Radovanovi\u0107, M., Nanopoulos, A., Ivanovi\u0107, M.: Hubs in space: Popular nearest neighbors in high-dimensional data. Journal\u00a0of Machine Learning Research\u00a011, 2487\u20132531 (2010)","journal-title":"Journal\u00a0of Machine Learning Research"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Radovanovi\u0107, M., Nanopoulos, A., Ivanovi\u0107, M.: Nearest neighbors in high-dimensional data: The emergence and influence of hubs. In: Proc. 26th Int. Conf. on Machine Learning (ICML), pp. 865\u2013872 (2009)","DOI":"10.1145\/1553374.1553485"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Radovanovi\u0107, M., Nanopoulos, A., Ivanovi\u0107, M.: On the existence of obstinate results in vector space models. In: Proc. 33rd Annual Int. ACM SIGIR Conf. on Research and Development in Information Retrieval, pp. 186\u2013193 (2010)","DOI":"10.1145\/1835449.1835482"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Radovanovi\u0107, M., Nanopoulos, A., Ivanovi\u0107, M.: Time-series classification in many intrinsic dimensions. In: Proc. 10th SIAM Int. Conf. on Data Mining (SDM), pp. 677\u2013688 (2010)","DOI":"10.1137\/1.9781611972801.59"},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TSMC.1985.6313426","volume":"15","author":"J.E. Keller","year":"1985","unstructured":"Keller, J.E., Gray, M.R., Givens, J.A.: A fuzzy k-nearest neighbor algorithm. IEEE Transactions on Systems, Man and Cybernetics\u00a015(4), 580\u2013585 (1985)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10044-007-0100-z","volume":"11","author":"W. Zuo","year":"2008","unstructured":"Zuo, W., Zhang, D., Wang, K.: On kernel difference-weighted k-nearest neighbor classification. Pattern Analysis and Applications\u00a011, 247\u2013257 (2008)","journal-title":"Pattern Analysis and Applications"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L.A. Zadeh","year":"1965","unstructured":"Zadeh, L.A.: Fuzzy sets. Information and Control\u00a08(3), 338\u2013353 (1965)","journal-title":"Information and Control"},{"key":"2_CR12","unstructured":"Cintra, M.E., Camargo, H.A., Monard, M.C.: A study on techniques for the automatic generation of membership functions for pattern recognition. In: Congresso da Academia Trinacional de Ci\u00eancias (C3N), vol.\u00a01, pp. 1\u201310 (2008)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Zheng, K., Fung, P.C., Zhou, X.: K-nearest neighbor search for fuzzy objects. In: Proc. 36th ACM SIGMOD Int. Conf. on Management of Data, pp. 699\u2013710 (2010)","DOI":"10.1145\/1807167.1807243"},{"issue":"9","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.patcog.2008.11.021","volume":"42","author":"V.S. Babu","year":"2009","unstructured":"Babu, V.S., Viswanath, P.: Rough-fuzzy weighted k-nearest leader classifier for large data sets. Pattern Recognition\u00a042(9), 1719\u20131731 (2009)","journal-title":"Pattern Recognition"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/11551188_26","volume-title":"Pattern Recognition and Data Mining","author":"T.D. Pham","year":"2005","unstructured":"Pham, T.D.: An optimally weighted fuzzy k-NN algorithm. In: Singh, S., Singh, M., Apte, C., Perner, P. (eds.) ICAPR 2005. LNCS, vol.\u00a03686, pp. 239\u2013247. Springer, Heidelberg (2005)"},{"key":"2_CR16","first-page":"1989","volume":"10","author":"J. Chen","year":"2009","unstructured":"Chen, J., Fang, H., Saad, Y.: Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection. Journal of Machine Learning Research\u00a010, 1989\u20132012 (2009)","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1023\/A:1024068626366","volume":"52","author":"C. Nadeau","year":"2003","unstructured":"Nadeau, C., Bengio, Y.: Inference for the generalization error. Machine Learning\u00a052(3), 239\u2013281 (2003)","journal-title":"Machine Learning"},{"key":"2_CR18","volume-title":"Multimedia Data Mining","author":"Z. Zhang","year":"2009","unstructured":"Zhang, Z., Zhang, R.: Multimedia Data Mining, 1st edn. Chapman and Hall, Boca Raton (2009)","edition":"1"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23199-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T21:33:22Z","timestamp":1560461602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23199-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231988","9783642231995"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23199-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}