{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T22:16:29Z","timestamp":1790633789685,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642208409","type":"print"},{"value":"9783642208416","type":"electronic"}],"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-20841-6_16","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T12:12:54Z","timestamp":1306498374000},"page":"183-195","source":"Crossref","is-referenced-by-count":22,"title":["The Role of Hubness in Clustering High-Dimensional Data"],"prefix":"10.1007","author":[{"given":"Nenad","family":"Toma\u0161ev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milo\u0161","family":"Radovanovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dunja","family":"Mladeni\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mirjana","family":"Ivanovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2006","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2006)","edition":"2"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: Finding generalized projected clusters in high dimensional spaces. In: Proc. 26th ACM SIGMOD Int. Conf. on Management of Data, pp. 70\u201381 (2000)","DOI":"10.1145\/342009.335383"},{"key":"16_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-39804-2_23","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"K. Kailing","year":"2003","unstructured":"Kailing, K., Kriegel, H.P., Kr\u00f6ger, P., Wanka, S.: Ranking interesting subspaces for clustering high dimensional data. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 241\u2013252. Springer, Heidelberg (2003)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Kailing, K., Kriegel, H.P., Kr\u00f6ger, P.: Density-connected subspace clustering for high-dimensional data. In: Proc. 4th SIAM Int. Conf. on Data Mining (SDM), pp. 246\u2013257 (2004)","DOI":"10.1137\/1.9781611972740.23"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kr\u00f6ger, P., Renz, M., Wurst, S.: A generic framework for efficient subspace clustering of high-dimensional data. In: Proc. 5th IEEE Int. Conf. on Data Mining (ICDM), pp. 250\u2013257 (2005)","DOI":"10.1109\/ICDM.2005.5"},{"key":"16_CR6","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 space. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 420\u2013434. Springer, Heidelberg (2000)"},{"issue":"7","key":"16_CR7","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"},{"issue":"4","key":"16_CR8","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":"16_CR9","doi-asserted-by":"crossref","unstructured":"Agirre, E., Mart\u00ednez, D., de Lacalle, O.L., Soroa, A.: Two graph-based algorithms for state-of-the-art WSD. In: Proc. Conf. on Empirical Methods in Natural Language Processing (EMNLP), pp. 585\u2013593 (2006)","DOI":"10.3115\/1610075.1610157"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Tran, T.N., Wehrens, R., Buydens, L.M.C.: Knn density-based clustering for high dimensional multispectral images. In: Proc. 2nd GRSS\/ISPRS Joint Workshop on Remote Sensing and Data Fusion over Urban Areas Workshop, pp. 147\u2013151 (2003)","DOI":"10.1109\/DFUA.2003.1219976"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-540-71618-1_82","volume-title":"Adaptive and Natural Computing Algorithms","author":"E. Bi\u00e7ici","year":"2007","unstructured":"Bi\u00e7ici, E., Yuret, D.: Locally scaled density based clustering. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007, Part\u00a0I. LNCS, vol.\u00a04431, pp. 739\u2013748. Springer, Heidelberg (2007)"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.patrec.2006.07.003","volume":"28","author":"C. Zhang","year":"2007","unstructured":"Zhang, C., Zhang, X., Zhang, M.Q., Li, Y.: Neighbor number, valley seeking and clustering. Pattern Recognition Letters\u00a028(2), 173\u2013180 (2007)","journal-title":"Pattern Recognition Letters"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Hader, S., Hamprecht, F.A.: Efficient density clustering using basin spanning trees. In: Proc. 26th Annual Conf. of the Gesellschaft f\u00fcr Klassifikation, pp. 39\u201348 (2003)","DOI":"10.1007\/978-3-642-18991-3_5"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X.: K-nearest-neighbor consistency in data clustering: Incorporating local information into global optimization. In: Proc. ACM Symposium on Applied Computing (SAC), pp. 584\u2013589 (2004)","DOI":"10.1145\/967900.968021"},{"issue":"12","key":"16_CR15","doi-asserted-by":"publisher","first-page":"3958","DOI":"10.1016\/j.patcog.2010.06.021","volume":"43","author":"C.T. Chang","year":"2010","unstructured":"Chang, C.T., Lai, J.Z.C., Jeng, M.D.: Fast agglomerative clustering using information of k-nearest neighbors. Pattern Recognition\u00a043(12), 3958\u20133968 (2010)","journal-title":"Pattern Recognition"},{"key":"16_CR16","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":"16_CR17","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1027\u20131035 (2007)"},{"key":"16_CR18","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\u00a0of Machine Learning Research\u00a010, 1989\u20132012 (2009)","journal-title":"Journal\u00a0of Machine Learning Research"},{"key":"16_CR19","volume-title":"New Ideas in Optimization","author":"D. Corne","year":"1999","unstructured":"Corne, D., Dorigo, M., Glover, F.: New Ideas in Optimization. McGraw-Hill, New York (1999)"},{"key":"16_CR20","volume-title":"Introduction to Data Mining","author":"P.N. Tan","year":"2005","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison Wesley, Reading (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20841-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T07:27:58Z","timestamp":1560238078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20841-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208409","9783642208416"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20841-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}