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 137 for “"Distance metrics"”.

  1. Systematic benchmark evaluation of distance metrics for scRNA-seq data

    … to generate statistical inference, the notion of distance or (dis)similarity among observations is a crucial for understanding the data's structure. When the data are sparse, as in Single-cell RNA-seq (scRNA-seq), some notions of distance can give false signals regarding observation structure. …

    jhu Repository record for Systematic benchmark evaluation of distance metrics for scRNA-seq data (opens in a new tab)

  2. Approximate Nearest Neighbor Search for Multiple Distance Metrics: Algorithms, Index Structures, and Applications

    … indexes provide effective solutions for standard metrics, high-dimensional search remains challenging when the target distance is non-Euclidean, expensive to compute, or specified only at query time. This dissertation studies ANNS for multiple distance metrics by using compact, reusable, or …

    gatech Repository record for Approximate Nearest Neighbor Search for Multiple Distance Metrics: Algorithms, Index Structures, and Applications (opens in a new tab)

  3. Improved methods to compare distance metrics using uniform random spanning trees and their applications in network analysis

    … the network analytics problem of comparing two distance metrics on the same set of $n$ entities. The classical solution proposed in 1967 is the Mantel test: a permutation-based hypothesis test whose complexity of $\Theta(n^2)$ per permutation makes it intractable for even medium-sized data sets. …

    colo-mines Repository record for Improved methods to compare distance metrics using uniform random spanning trees and their applications in network analysis (opens in a new tab)

  4. Parametric kernels for structured data analysis

    … the conventional machine learning algorithms and distance metrics because they assume vector inputs. To learn from input patterns with variable structure is thus challenging. To address this problem, I propose a general and systematic method to design distance metrics between structured inputs …

    texas Repository record for Parametric kernels for structured data analysis (opens in a new tab)

  5. A scale-independent clustering method with automatic variable selection based on trees

    … putting observations into groups based on their distance, or dissimilarity, from one another. Measuring distance for continuous variables often requires scaling or monotonic transformation. Determining dissimilarity when observations have both continuous and categorical measurements can be …

    nps Repository record for A scale-independent clustering method with automatic variable selection based on trees (opens in a new tab)

  6. Adaptation For Multi-Antenna Systems

    … assignment. Utilizing minimum Euclidean distances of MoDem constellations and the minimum free Hamming distance metrics for channel codes, we develop distance metrics to describe the MIMO schemes which are considered. A minimum required distance is then determined as a function of desired …

    vt Repository record for Adaptation For Multi-Antenna Systems (opens in a new tab)

  7. Similarity maximization and shrinkage approach in kernel metric learning for clustering mixed-type data

    … a new kernel-based shrinkage approach to distance metric learning for mixed-type datasets--a mix of continuous, nominal, and ordinal variables. Mixed-type data is common across many research fields and domains, and is used extensively in machine learning tasks that require a comparison …

    ubc Repository record for Similarity maximization and shrinkage approach in kernel metric learning for clustering mixed-type data (opens in a new tab) Download PDF for Similarity maximization and shrinkage approach in kernel metric learning for clustering mixed-type data (opens in a new tab)

  8. Explorations of the lineup protocol for visual inference: application to high dimension, low sample size problems and metrics to assess the quality

    … in microarray data. The thesis also describes metrics developed to assist the use of lineups for making inferential statements. Metrics measure the quality of the lineup, and help to understand what people see in the data plots. The null plots represent a finite sample from a null distribution, …

    iastate Repository record for Explorations of the lineup protocol for visual inference: application to high dimension, low sample size problems and metrics to assess the quality (opens in a new tab)

  9. Classification of small optimal linear codes over Z₄

    … of Z4 linear codes for lengths up to 7. Three distance metrics are considered, Lee distance, Hamming distance and Euclidean distance. The inequivalent codes are determined from the optimal codes constructed. Self-orthogonal codes, self-dual codes, isodual codes, formally self-dual codes and …

    uvic Repository record for Classification of small optimal linear codes over Z₄ (opens in a new tab)

  10. PyAline: Automatically Growing Language Family Trees Using the ALINE Distance

    Several methods for determining a numerical distance between languages have been proposed in the literature. In this thesis I implement one of them, the ALINE distance, and develop a methodology for comparing its results with other language distance metrics. I then compare it with a leading …

    byu Repository record for PyAline: Automatically Growing Language Family Trees Using the ALINE Distance (opens in a new tab) Download PDF for PyAline: Automatically Growing Language Family Trees Using the ALINE Distance (opens in a new tab)

  11. Analyzing databases using data analytics

    … arbitrary reservoir is selected, and different distance metrics were used to rank analog reservoirs. Because no one distance metric (and hence the given reservoir analog list) is superior to the other, the reservoirs given in the recommended list are compared along with the characteristics of …

    texas Repository record for Analyzing databases using data analytics (opens in a new tab)

  12. Top-k similarity join over multi-valued objects

    … between two objects is usually measured by distance metrics such as Euclidean distance. However, in many applications such as decision making and e-business, an object may be described by multiple values (instances) and the conventional model is not applicable since it does not address the …

    unsw Repository record for Top-k similarity join over multi-valued objects (opens in a new tab)

  13. Modeling (un)binding kinetics of biologically relevant systems using resampling of ensembles by variation optimization

    … results to experiment. Finally, we developed new distance metrics that use experimental data to help guide simulations to a desired conformation. We tested these new distance metrics using Hydrogen deuterium exchange (HDX) data to form the ternary complex between a ligase-proteolysis-targeting …

    msu Repository record for Modeling (un)binding kinetics of biologically relevant systems using resampling of ensembles by variation optimization (opens in a new tab)

  14. AffectiveTDA: Using Topological Data Analysis to Improve Analysis and Explainability in Affective Computing

    … irrespective of time, with multiple topological distance metrics, dimension reduction techniques, and face subsections (e.g., eyes, nose, mouth, etc.). The results confirm that our topology-based approach captures known patterns, distinctions between emotions, and distinctions between …

    usf Repository record for AffectiveTDA: Using Topological Data Analysis to Improve Analysis and Explainability in Affective Computing (opens in a new tab)

  15. Computing the attention center of a simple polygon

    … c inside P that minimizes the maximum geodesic distance from any p ∈ P to the visibility region of c. We survey various definitions of center which use geodesically convex distance metrics on simple polygons and their algorithms. We show attention distance is not geodesically convex but instead …

    ubc Repository record for Computing the attention center of a simple polygon (opens in a new tab) Download PDF for Computing the attention center of a simple polygon (opens in a new tab)

  16. Information retrieval and mining in high dimensional databases

    … MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional pseudo-Euclidean space in such a way that the distances among objects are approximately preserved. Our approach employs sampling and the calculation of eigenvalues and eigenvectors. The …

    njit Repository record for Information retrieval and mining in high dimensional databases (opens in a new tab)

  17. Consensus-Based Decision-Making for Improving Person Re-Identification and Similar Systems

    … as the ``probe image'') and to compute the ``distance'' of these features from the features extracted from a set of gallery images. These distances or similarity scores are then used for ranking the gallery images in terms of their similarity with the probe. Not only does the process of …

    houston Repository record for Consensus-Based Decision-Making for Improving Person Re-Identification and Similar Systems (opens in a new tab)

  18. Hybrid recommender system using association rules

    … the use of association mining with the use of distance metrics such as the Jaccard measure to identify movies that belong to the same genre. Our experimental results on the MovieLens dataset shows that the use of the Jaccard metric improved the coverage of recommendations over the use of the …

    auckland-tech Repository record for Hybrid recommender system using association rules (opens in a new tab)

  19. Detecting and Leveraging Changes in Temporal Data

    … we explore how supervision can help learn distance metrics for designing robust change-point detection methods. For improving machine learning, we explore how change-points can provide weak supervision for supervised machine learning tasks. We also investigate how machine learning models …

    gatech Repository record for Detecting and Leveraging Changes in Temporal Data (opens in a new tab)

Page 1 of 7