Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 70 for “"locality sensitive hashing"”.

  1. Identificando plágio externo com Locality-sensitive hashing

    … proposed for handling high-dimensional spaces, hashing them to a lower number of hash values. Our two Minmax Circular Sector Arcs methods, Minmax Circular Sector Arcs Lower Bound and Minmax Circular Sector Arcs Full Bound, achieved Recall levels slightly more imprecise than Minmaxwise hashing in …

    brazil-uerj Repository record for Identificando plágio externo com Locality-sensitive hashing (opens in a new tab)

  2. Distributed Local Outlier Factor with Locality-Sensitive Hashing

    … LOF method is proposed, which relies on locality-sensitive hashing (LSH) for partitioning data and enables fully distributed local computation. We name it MR-LOF-LSH. To further improve the approximate LOF, we introduce a process called cross-partition updating. With cross-partition …

    ottawa-retro Repository record for Distributed Local Outlier Factor with Locality-Sensitive Hashing (opens in a new tab)

  3. Efficient locality sensitive hashing: solutions, primitives, and applications

    … arising in many areas of computer science. Locality-sensitive hashing (LSH) is a longstanding and principled solution scheme for ANNS. In this dissertation, we aim to design new LSH-based ANNS solutions, to improve the performance of existing ones by designing new algorithmic primitives for …

    gatech Repository record for Efficient locality sensitive hashing: solutions, primitives, and applications (opens in a new tab)

  4. Malware Classification using Locality Sensitive Hashing and Neural Networks

    In this thesis, we explore the idea of using locality sensitive hashes as input features to a feedforward neural network to perform static analysis to detect JavaScript malware. An experiment is conducted using a dataset containing 1.5M evenly distributed benign and malicious samples provided by …

    chalmers Repository record for Malware Classification using Locality Sensitive Hashing and Neural Networks (opens in a new tab)

  5. Parallel locality sensitive hashing for network discovery from time series

    … noise, high dimensionality and time dependency. Locality sensitive hashing (LSH) has shown advancement in limiting the number of comparisons required for similarity operations, thus reducing the overall time, by pre-processing the data into buckets as candidates for approximate nearest …

    ubc Repository record for Parallel locality sensitive hashing for network discovery from time series (opens in a new tab) Download PDF for Parallel locality sensitive hashing for network discovery from time series (opens in a new tab)

  6. AI Enabled IoT Network Traffic Fingerprinting With Locality Sensitive Hashing

    … to remain effective. We apply a combination of locality sensitive hashing and machine learning techniques to identify specific devices based on their network traffic, eliminating the need for complex feature engineering and model retraining. This approach achieves an accuracy identifying known …

    unr Repository record for AI Enabled IoT Network Traffic Fingerprinting With Locality Sensitive Hashing (opens in a new tab)

  7. Protein Sequence Similarity Search using Locality-Sensitive Hashing and MapReduce

    … sequence similarity search that builds on Locality-Sensitive Hashing (LSH), a well-known methodology for high-performance similarity search over large-scale, multi-dimensional sets of documents. LSH has been demonstrated to be easily adaptable for distribution over cloud infrastructure …

    unsw Repository record for Protein Sequence Similarity Search using Locality-Sensitive Hashing and MapReduce (opens in a new tab)

  8. Efficient video identification based on locality sensitive hashing and triangle inequality

    … similarity search in high-dimensional space. Locality sensitive hashing, or LSH, is a well-known indexing method for efficient approximate similarity search in such space. In this thesis, we present a highly efficient video identification method for transcoded video content based on locality …

    nus Repository record for Efficient video identification based on locality sensitive hashing and triangle inequality (opens in a new tab) Download file for Efficient video identification based on locality sensitive hashing and triangle inequality (opens in a new tab)

  9. Resource-Efficient Machine Learning via Count-Sketches and Locality-Sensitive Hashing (LSH)

    … items. In this thesis, we explore how to use locality-sensitive hashing (LSH) and the count-sketch data structure for addressing the computational and memory challenges in four distinct areas. (1) The LSH Sampling algorithm uses the LSH data structure as an adaptive sampler. We demonstrate …

    rice Repository record for Resource-Efficient Machine Learning via Count-Sketches and Locality-Sensitive Hashing (LSH) (opens in a new tab)

  10. Abordagens de particionamento utilizando locality-sensitive hashing aplicada a busca heurística na detecção de plágio externo

    … and vocabulary partitioning. Both use Locality-Sensitive Hashing (LSH) and are based on the mathematical concept known as partition of a set. Partitioning any set can generate remainders, and to address this issue, the Remainder at End (RaE), Remainder at Cell (RaC) and Distributed at …

    brazil-uerj Repository record for Abordagens de particionamento utilizando locality-sensitive hashing aplicada a busca heurística na detecção de plágio externo (opens in a new tab)

  11. Aplicação de rede neural sem peso e locality-sensitive hashing para o problema de cold-start item em filtragem colaborativa

    … filtering for recommender systems. We used the Locality-Sensitive Hashing (LSH) technique with the MinMaxwise method for word processing in order to find similarities among the items. LSH was incorporated into traditional literature approaches and other machine learning methods, generating good …

    brazil-uerj Repository record for Aplicação de rede neural sem peso e locality-sensitive hashing para o problema de cold-start item em filtragem colaborativa (opens in a new tab)

  12. Image search with LSH and shape context

    … for high dimension. In our paper, we present locality sensitive hashing for image search, it is a randomized algorithms, which does not guarantee an exact answer but instead provides a high probability guarantee that it will return the correct answer or one close to it. With locality sensitive …

    missouri Repository record for Image search with LSH and shape context (opens in a new tab)

  13. Probabilistic Hashing Techniques For Big Data

    We investigate probabilistic hashing techniques for addressing computational and memory challenges in large scale machine learning and data mining systems. In this thesis, we show that the traditional idea of hashing goes far beyond near-neighbor search and there are some striking new …

    cornell Repository record for Probabilistic Hashing Techniques For Big Data (opens in a new tab)

  14. Metody hledání k-nejbližších sousedů

    … detailní popis metod KD-Strom, Kulovitý strom, Locality-Sensitive Hashing, Strom náhodných projekcí a rodiny algoritmů založené na grafu nejbližších sousedů. Ke každé metodě je poskytnuto vysvětlení ideje s vizualizacemi, pseudokódy a asymptotickými složitostmi. Metody byly podrobeny …

    brno-tech Repository record for Metody hledání k-nejbližších sousedů (opens in a new tab)

  15. Low-quality dimension reduction and high-dimensional Approximate Nearest Neighbor

    … όταν η διάσταση είναι σχετικά μικρή και το locality sensitive hashing το οποίο αποτελεί μια τυχαιοκρατική μέθοδο η οποία λειτουργεί αποδοτικά και όταν η διάσταση είναι υψηλή. Γενικεύουμε το Johnson-Lindenstrauss λήμμα και ορίζουμε εμβαπτίσεις χαμηλής ποιότητας σε έναν ευκλείδειο χώρο αρκετά …

    athens Repository record for Low-quality dimension reduction and high-dimensional Approximate Nearest Neighbor (opens in a new tab)

  16. Some Rare LSH Gems for Large-scale Machine Learning

    Locality Sensitive Hashing (LSH) is an algorithm for approximate nearest neighbor (ANN) search in high dimensional space. In this thesis, instead of using LSH as an ANN tool, we investigate the possibility of using LSH for addressing the computational and memory challenges in large scale machine …

    rice Repository record for Some Rare LSH Gems for Large-scale Machine Learning (opens in a new tab)

  17. SUPPORTING GENERIC CLUSTERING AND SIMILARITY SEARCH FOR MASSIVE DATASETS

    … distance functions by leveraging different Locality-Sensitive Hashing. We further investigate the clustering problem in sparse data and introduce a new method k-FreqItems with a novel sparse center representation called FreqItem. Additionally, we present a seeding technique that …

    nus Repository record for SUPPORTING GENERIC CLUSTERING AND SIMILARITY SEARCH FOR MASSIVE DATASETS (opens in a new tab) Download file for SUPPORTING GENERIC CLUSTERING AND SIMILARITY SEARCH FOR MASSIVE DATASETS (opens in a new tab)

  18. THE DISTANCE-AGGREGATION QUERY IN SUB-LINEAR TIME

    … the DAQ problem, we propose a framework named Locality-Sensitive Hashing (LSH) based Distance Aggregation Search (LSH-DAS), which can handle many instances of DAQ with various distance functions and aggregation operators by using proper LSH families and search frameworks. To further enable more …

    nus Repository record for THE DISTANCE-AGGREGATION QUERY IN SUB-LINEAR TIME (opens in a new tab) Download file for THE DISTANCE-AGGREGATION QUERY IN SUB-LINEAR TIME (opens in a new tab)

  19. Fast high dimensional approximation via random embeddings

    … This thesis focuses on two such problems - hashing and parameter estimation. We study locality sensitive hashing(LSH), which is a framework for randomized hashing that efficiently solves an approximate version of nearest neighbor search. We propose an efficient and provably optimal hash …

    texas Repository record for Fast high dimensional approximation via random embeddings (opens in a new tab)

  20. Similarity computation in modern applications

    … Hyperplane Projection (RHP) method (i.e. a locality sensitive hashing method). We present algorithms that materialize RHP dimensions that better describe the underlying data, while additional dimensions are derived in real-time using simple stored statistics we maintain. Our method is …

    greece Repository record for Similarity computation in modern applications (opens in a new tab)

Page 1 of 4