Balanced Large Scale Knowledge Matching Using LSH Forest

Cochez, Michael; Terziyan, Vagan; Ermolayev, Vadim

doi:10.1007/978-3-319-27932-9_4

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our previous work [2] we only used Jaccard distance to evaluate the use of LSH Forests. Typical metrics used in the literature for distance between textual documents are Jaccard and angular distance.…”

Section: Distance Metrics and Locality-sensitive Hash Functionsmentioning

confidence: 99%

Large Scale Knowledge Matching with Balanced Efficiency-Effectiveness Using LSH Forest

Cochez

Terziyan

Ermolayev

2017

Transactions on Computational Collective Intelligence XXVI

Self Cite

View full text Add to dashboard Cite

Abstract. Evolving Knowledge Ecosystems were proposed to approach the Big Data challenge, following the hypothesis that knowledge evolves in a way similar to biological systems. Therefore, the inner working of the knowledge ecosystem can be spotted from natural evolution. An evolving knowledge ecosystem consists of Knowledge Organisms, which form a representation of the knowledge, and the environment in which they reside. The environment consists of contexts, which are composed of so-called knowledge tokens. These tokens are ontological fragments extracted from information tokens, in turn, which originate from the streams of information flowing into the ecosystem. In this article we investigate the use of LSH Forest (a self-tuning indexing schema based on locality-sensitive hashing) for solving the problem of placing new knowledge tokens in the right contexts of the environment. We argue and show experimentally that LSH Forest possesses required properties and could be used for large distributed set-ups. Further, we show experimentally that for our type of data minhashing works better than random hyperplane hashing. This paper is an extension of the paper "Balanced Large Scale Knowledge Matching Using LSH Forest" presented at the International Keystone Conference 2015.

show abstract

Section: Distance Metrics and Locality-sensitive Hash Functionsmentioning

confidence: 99%