Proceedings ArticleDOI
A Locality Sensitive Hashing Approach for Conceptual Classification
Luciano B. de Paula,Rodolfo da Silva Villaça,Mauricio Ferreira Magalhães +2 more
- pp 408-413
Reads0
Chats0
TLDR
In this paper, the authors propose the creation of hash values that keep similar data stored near to each other in a P2P network, reducing the effort to retrieve similar data.Abstract:
The increasing volume of semantic content available in the Web, generally classified by concept hierarchies or simple ontologies, turns the searching and reasoning upon these data a great challenge. Generally, a search in Semantic Web may not be addressed to a specific document, but to a group of data classified in the same concept. Several structures used to distribute data, e.g. P2P networks, use hash values to identify these data, without maintaining the semantic values of the stored data. This paper contributes by proposing the creation of hash values that keep similar data stored near to each other in a P2P network, reducing the effort to retrieve similar data. The proposed hash values are derived from the data classification based on ontologies, using locality sensitive hashing (LSH) functions.read more
Citations
More filters
Proceedings ArticleDOI
Locality-Sensitive Hashing for Massive String-Based Ontology Matching
TL;DR: Initial research results related to the use of locality-sensitive hashing (LSH) for string-based matching of big ontologies show that using LSH for ontology matching could lead to a very fast matching process.
Proceedings ArticleDOI
Analysis of Concept Similarity Methods Applied to an LSH Function
TL;DR: This paper proposes a method for combining the idea of conceptual similarity with LSH functions, which permits the data classified as similar concepts to be indexed close to each other respecting some metric.
Proceedings ArticleDOI
MIXED-LSH: Reduction of Remote Accesses in Distributed Locality-Sensitive Hashing Based on L1-distance
TL;DR: This paper proposes to reduce remote accesses by assigning hash buckets smartly to the nodes, if the hash buckets store the same points, and can access multiple hash buckets that should be accessed in processing a query with a single remote access, thereby decreasingRemote accesses.
References
More filters
Proceedings ArticleDOI
Chord: A scalable peer-to-peer lookup service for internet applications
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Proceedings ArticleDOI
Approximate nearest neighbors: towards removing the curse of dimensionality
Piotr Indyk,Rajeev Motwani +1 more
TL;DR: In this paper, the authors present two algorithms for the approximate nearest neighbor problem in high-dimensional spaces, for data sets of size n living in R d, which require space that is only polynomial in n and d.
Proceedings ArticleDOI
Similarity estimation techniques from rounding algorithms
TL;DR: It is shown that rounding algorithms for LPs and SDPs used in the context of approximation algorithms can be viewed as locality sensitive hashing schemes for several interesting collections of objects.
Journal Article
The Semantic Web: A new form of Web content that is meaningful to computers will unleash a revolution of new possibilities
Journal ArticleDOI
Ontologies and semantics for seamless connectivity
TL;DR: It is argued that ontologies in particular and semantics-based technologies in general will play a key role in achieving seamless connectivity.