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 689 for “"Nearest neighbors"”.

  1. Multi-scale Deep Nearest Neighbors

    … nature. We propose Multi-scale Deep Nearest Neighbour (MsDNN) which is a differentiable loss function that aims to maximize the expected sample margin for every training sample. The output of MsDNN is an embedding space. We evaluate the resulting space from two angles. From the …

    carleton Repository record for Multi-scale Deep Nearest Neighbors (opens in a new tab)

  2. K-NEAREST NEIGHBORS DENSITY-BASED CLUSTERING

    … scale of the distances). Connectivity by k-nearest neighbors and density by the number of reverse k-nearest neighbors (i.e., vertex in-degree in the directed k-nearest neighbors graph). Two novel density-based clustering algorithms are proposed, the non-hierarchical RNN-DBSCAN and its …

    vcu Repository record for K-NEAREST NEIGHBORS DENSITY-BASED CLUSTERING (opens in a new tab)

  3. Handling class imbalance in k-nearest neighbors /

    … an inference-time modification of the k-nearest neighbor classifier for imbalanced binary classification. The proposed method aims to improve minority-class recall while limiting the corresponding loss in majority-class precision, without modifying the training data. STIR-kNN combines …

    vilnius Repository record for Handling class imbalance in k-nearest neighbors / (opens in a new tab)

  4. APF-50: A Robotic Search for Earth's Nearest Neighbors

    The discovery of thousands of exoplanets during the past decade opened the door to detailed studies of exoplanet demographics. Now we are able to group planets into di erent categories based on observable characteristics and study population-level properties. Patterns and trends in the known …

    hawaii Repository record for APF-50: A Robotic Search for Earth's Nearest Neighbors (opens in a new tab)

  5. SCANNER: Sequence Clustering of resource Access to find Nearest Neighbors

    … the applications are clustered to find the nearest neighbors. A set of metrics is defined to quantify how well the neighbors resemble each application and the compactness of the clusters. Our results show that the use of LCS features helps identify similarly behaving applications with …

    rit Repository record for SCANNER: Sequence Clustering of resource Access to find Nearest Neighbors (opens in a new tab)

  6. Massively parallel nearest neighbors searches in dynamic point clouds on GPU

    Esta dissertação introduz uma estrutura de dados baseada em gride implementada em GPU. Ela foi desenvolvida para pesquisa dos vizinhos mais próximos em nuvens de pontos dinâmicas, de uma forma massivamente paralela. A implementação possui desempenho em tempo real e é executada em GPU, ambas …

    brazil-ufpe Repository record for Massively parallel nearest neighbors searches in dynamic point clouds on GPU (opens in a new tab)

  7. Landmine classification using possibilistic K-nearest neighbors with wideband electromagnetic induction data

    … REQUEST.] In this thesis, a possibilistic K-nearest neighbor classifier is presented to distinguish between and classify mine and non-mine targets on data obtained from wideband electromagnetic induction sensors. The goal of this work is to develop methods for classifying wide-band …

    missouri Repository record for Landmine classification using possibilistic K-nearest neighbors with wideband electromagnetic induction data (opens in a new tab)

  8. Flexible Weighted Nearest Neighbors Classifiers for Transfer Learning and Multi-Label Classification

    Weighted nearest neighbors (WNN) classifier is a widely used nonparametric binary classification method where the class label of a test sample is predicted by the weighted majority vote of its nearest neighbors. Most existing WNN methods are designed under the traditional supervised learning …

    buffalo Repository record for Flexible Weighted Nearest Neighbors Classifiers for Transfer Learning and Multi-Label Classification (opens in a new tab)

  9. K-Nearest Neighbors para detecção de anomalias e manutenção preditiva em sistemas de abastecimento hídrico

    … The method used in this study employed the K-Nearest Neighbors (KNN) algorithm for correlational analysis and failure prediction. The algorithm was applied to predict pump failure based on sensor data and integrate different approaches to improve the accuracy of the results. The model …

    brazil-ufrn Repository record for K-Nearest Neighbors para detecção de anomalias e manutenção preditiva em sistemas de abastecimento hídrico (opens in a new tab)

  10. CONTINUAL LEARNING FOR MULTI-LABEL DRIFTING DATA STREAMS USING HOMOGENEOUS ENSEMBLE OF SELF-ADJUSTING NEAREST NEIGHBORS

    … named Homogeneous Ensemble of Self-Adjusting Nearest Neighbors (HESAkNN). It leverages a self-adjusting kNN as a base classifier with the advantages of ensembles to adapt to concept drift in the multi-label environment. To promote diverse knowledge within the ensemble, each base classifier is …

    vcu Repository record for CONTINUAL LEARNING FOR MULTI-LABEL DRIFTING DATA STREAMS USING HOMOGENEOUS ENSEMBLE OF SELF-ADJUSTING NEAREST NEIGHBORS (opens in a new tab)

  11. USING A K-NEAREST NEIGHBORS MACHINE LEARNING APPROACH TO DETECT CYBERATTACKS ON THE NAVY SMART GRID

    … detector, and response manager. We use the K-Nearest Neighbors machine learning algorithm to show that various attacks (web attacks, FTP/SSH attacks, DOS, DDOS and port scanning) can be grouped into broader attack classes of Active, Denial, and Probe for appropriate response management. We …

    nps Repository record for USING A K-NEAREST NEIGHBORS MACHINE LEARNING APPROACH TO DETECT CYBERATTACKS ON THE NAVY SMART GRID (opens in a new tab)

  12. Algorithms for processing closest-pairs and nearest-neighbors queries on big spatial data in parallel and distributed frameworks

    … are candidates for the final result) and nearest-neighbor queries (since the final result is formed according to a neighboring criterion).• The K Closest-Pairs Query (KCPQ): for each possible pair of elements from the two datasets, it discovers K pairs with the smallest distances among …

    greece Repository record for Algorithms for processing closest-pairs and nearest-neighbors queries on big spatial data in parallel and distributed frameworks (opens in a new tab)

  13. Determining Biogeochemical Assemblages on the Stony River, Grant County, WV, using Fuzzy C-Means and k-Nearest Neighbors Clustering

    … each site during the study. Fuzzy C-means and k-nearest neighbor clustering on the combined, normalized dataset produced similar results. Clustering separated species occurring in each tributary from each other and those dominating the mainstem. Nearly every bioaccumulated metal was associated …

    marshall Repository record for Determining Biogeochemical Assemblages on the Stony River, Grant County, WV, using Fuzzy C-Means and k-Nearest Neighbors Clustering (opens in a new tab)

  14. PREDICTING LUXURY CAR SALES USING MACHINE LEARNING: A COMPARATIVE STUDY OF LINEAR REGRESSION, K-NEAREST NEIGHBORS, AND SUPPORT VECTOR MACHINES

    … which include the Linear Regression, K-Nearest Neighbours (KNN) and Support Vector Machines (SVM) and sees their predictive accuracy, generalisation performance and business applicability. In Python with the help of the Google Colab, an end-to-end analytical pipeline was developed …

    rit Repository record for PREDICTING LUXURY CAR SALES USING MACHINE LEARNING: A COMPARATIVE STUDY OF LINEAR REGRESSION, K-NEAREST NEIGHBORS, AND SUPPORT VECTOR MACHINES (opens in a new tab)

  15. Using Machine Learning to Identify Causes of Differential Item Functioning

    … item functioning. Logistic regression, k-nearest neighbors, random forest, naïve Bayes, support vector machines, and artificial neural network models were estimated to predict item responses for items flagged for evidence of differential item functioning using estimated attribute mastery …

    ku Repository record for Using Machine Learning to Identify Causes of Differential Item Functioning (opens in a new tab)

  16. KNN Optimization for Multi-Dimensional Data

    The K-Nearest Neighbors (KNN) algorithm is a simple but powerful technique used in the field of data analytics. It uses a distance metric to identify existing samples in a dataset which are similar to a new sample. The new sample can then be classified via a class majority voting of its most …

    kennesaw Repository record for KNN Optimization for Multi-Dimensional Data (opens in a new tab)

  17. Multi-directional Rapidly Exploring Random Graph (mRRG) for Motion Planning

    … methods involves finding candidate nearest neighbors to attempt to connect to a node. Generally, the entire graph is considered to search for the nearest neighbors. In this thesis, we propose a heuristic method for finding nearest neighbors based on the hop limit, i.e., the maximum …

    tamu Repository record for Multi-directional Rapidly Exploring Random Graph (mRRG) for Motion Planning (opens in a new tab)

  18. Simple, Faster Kinetic Data Structures

    … pair among a set P of points, finding the k-nearest neighbors to each point p in P, answering reverse k-nearest neighbor queries, computing the Yao graph, the Semi-Yao graph and the Euclidean minimum spanning tree of P, and mapping the vertices of a planar graph to a set P of points without …

    uvic Repository record for Simple, Faster Kinetic Data Structures (opens in a new tab)

Page 1 of 35