Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/10235
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tomašev N. | en |
dc.contributor.author | Radovanović M. | en |
dc.contributor.author | Mladenić D. | en |
dc.contributor.author | Ivanović, Mirjana | en |
dc.date.accessioned | 2020-03-03T14:38:27Z | - |
dc.date.available | 2020-03-03T14:38:27Z | - |
dc.date.issued | 2011-06-08 | en |
dc.identifier.isbn | 9783642208409 | en |
dc.identifier.issn | 03029743 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/10235 | - |
dc.description.abstract | High-dimensional data arise naturally in many domains, and have regularly presented a great challenge for traditional data-mining techniques, both in terms of effectiveness and efficiency. Clustering becomes difficult due to the increasing sparsity of such data, as well as the increasing difficulty in distinguishing distances between data points. In this paper we take a novel perspective on the problem of clustering high-dimensional data. Instead of attempting to avoid the curse of dimensionality by observing a lower-dimensional feature subspace, we embrace dimensionality by taking advantage of some inherently high-dimensional phenomena. More specifically, we show that hubness, i.e., the tendency of high-dimensional data to contain points (hubs) that frequently occur in k-nearest neighbor lists of other points, can be successfully exploited in clustering. We validate our hypothesis by proposing several hubness-based clustering algorithms and testing them on high-dimensional data. Experimental results demonstrate good performance of our algorithms in multiple settings, particularly in the presence of large quantities of noise. © 2011 Springer-Verlag. | en |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en |
dc.title | The role of hubness in clustering high-dimensional data | en |
dc.type | Conference Paper | en |
dc.identifier.doi | 10.1007/978-3-642-20841-6-16 | en |
dc.identifier.scopus | 2-s2.0-79957951698 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/79957951698 | en |
dc.relation.lastpage | 195 | en |
dc.relation.firstpage | 183 | en |
dc.relation.issue | PART 1 | en |
dc.relation.volume | 6634 LNAI | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0003-1946-0384 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
36
checked on Aug 26, 2023
Page view(s)
16
Last Week
1
1
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.