title: Hierarchical clustering of large text datasets using Locality-Sensitive Hashing
metadata.name: dc.contributor.author
metadata.value: Blekanov, Иван
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Korelin, Vasilii
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2016-04-13T23:15:11Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2016-04-13T23:15:11Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2015
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/2092
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: In this paper, we present a hierarchical clustering algorithm of the large text datasets using Locality-Sensitive Hashing (LSH). The main idea of the LSH is to “hash” items several times, in such a way that similar items are more likely to be hashed to the same bucket than dissimilar are. The main drawback of the conventional hierarchical algorithms is a large time complexity (e.g. Single Linkage method has time complexity of O(n^2)) Proposed algorithm reduces the time complexity to O(Pn). Here, P represents the maximum number of items going to the single bucket. P is a small constant as compared to n for the large number of buckets.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: Proceedings of the International Workshop on Applications in Information Technology (IWAIT-2015)
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Hierarchical clustering of large text datasets using Locality-Sensitive Hashing
metadata.lang: en_GB
resources.filename: Clustering using LSH eng v1.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/2092/1/Clustering%20using%20LSH%20eng%20v1.pdf
resources.format: Adobe PDF
resources.size: 436,82 kB