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 210 for “"Spectral clustering"”.

  1. Vertex Weighted Spectral Clustering

    Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An …

    etsu Repository record for Vertex Weighted Spectral Clustering (opens in a new tab) Download PDF for Vertex Weighted Spectral Clustering (opens in a new tab)

  2. Online Spectral Clustering on Network Streams

    … significant research interests have arisen on spectral clustering for network streams (or evolving networks). Compared with the general spectral clustering problem, the data analysis of this new type of problems may have additional requirements, such as short processing time, scalability in …

    ku Repository record for Online Spectral Clustering on Network Streams (opens in a new tab)

  3. Scalable centralized and distributed spectral clustering

    Spectral clustering approaches have led to well-accepted algorithms for finding accurate clusters in a given dataset. However, their application to large-scale datasets has been hindered by the computational complexity of eigenvalue decompositions. Several algorithms have been proposed in the …

    uiuc Repository record for Scalable centralized and distributed spectral clustering (opens in a new tab)

  4. Using asymmetry in the spectral clustering of trajectories.

    … trajectories that are needed for tasks such as clustering fail to satisfy basic metric properties like the triangle inequality, or even symmetry. While in some simple practical applications such measures have been quite successful, the violation of basic properties poses unique challenges for …

    umn Repository record for Using asymmetry in the spectral clustering of trajectories. (opens in a new tab)

  5. Spectral clustering: An explorative study of proximity measures

    … such cluster analysis algorithm is called the spectral clustering algorithm, which originated from the area of graph partitioning. The input, in this case, is a similarity matrix, constructed from the pair-wise similarity between data objects. The algorithm uses the eigenvalues and eigenvectors …

    ottawa-retro Repository record for Spectral clustering: An explorative study of proximity measures (opens in a new tab)

  6. The Application of Spectral Clustering in Drug Discovery

    The application of clustering algorithms to chemical datasets is well established and has been reviewed extensively. Recently, a number of ‘modern’ clustering algorithms have been reported in other fields. One example is spectral clustering, which has yielded promising results in areas such as …

    whiterose Download PDF for The Application of Spectral Clustering in Drug Discovery (opens in a new tab)

  7. Consistency of Spectral Clustering with Functional Magnetic Resonance Image Data

    … that are used for a brain parcellation is spectral clustering. It is a well-used technique in many areas of studies, such as physics and engineering. However, its asymptotic behavior, whether spectral clustering will produce consistent clustering as samples grow large, is not fully …

    maryland Repository record for Consistency of Spectral Clustering with Functional Magnetic Resonance Image Data (opens in a new tab)

  8. Spectral clustering and downsampling-based model selection for functional data

    … economics. A crucial but challenging problem is clustering of functional data. In this thesis, we review the main contributions in this field and discuss the strengthens and weaknesses of the different clustering functional data approaches. We propose a new framework for clustering functional …

    glasgow Repository record for Spectral clustering and downsampling-based model selection for functional data (opens in a new tab) Download PDF for Spectral clustering and downsampling-based model selection for functional data (opens in a new tab)

  9. ALGORITHMIC CONSIDERATIONS FOR SPECTRAL CLUSTERING, AND LEARNING GRAPHS FROM LABELED DATA

    Spectral clustering is an extensively-used algorithm to identify well-connected sets of nodes, or clusters, in graphs. Generally, the approach involves computing a suitable number of eigenvectors from the (normalized) graph Laplacian and thereafter applying a downstream clustering algorithm, such …

    cornell Repository record for ALGORITHMIC CONSIDERATIONS FOR SPECTRAL CLUSTERING, AND LEARNING GRAPHS FROM LABELED DATA (opens in a new tab)

  10. Spectral Clustering for Electrical Phase Identification Using Advanced Metering Infrastructure Voltage Time Series

    … voltage timeseries. This thesis proposes to use Spectral Clustering, combined with a sliding window ensemble method for utilizing a long-term, time-series dataset that includes missing data, to group customers within a lateral by phase. These clustering phase predictions validate over 90% of the …

    portland-state Repository record for Spectral Clustering for Electrical Phase Identification Using Advanced Metering Infrastructure Voltage Time Series (opens in a new tab)

  11. Characterization of Traffic Dynamics in Automated Guided Vehicle Systems: Analyzing and visualizing congestion patterns using causal chains and spectral clustering

    … data structures, interactive visualization, and spectral clustering; with the final aim being to describe and analyze congestion in these systems. Our study shows promise in streamlining design processes by providing more sophisticated analysis tools, data-structures for describing congestion, as …

    chalmers Repository record for Characterization of Traffic Dynamics in Automated Guided Vehicle Systems: Analyzing and visualizing congestion patterns using causal chains and spectral clustering (opens in a new tab)

  12. On non-linear network embedding methods

    As a linear method, spectral clustering is the only network embedding algorithm that offers both a provably fast computation and an advanced theoretical understanding. The accuracy of spectral clustering depends on the Cheeger ratio defined as the ratio between the graph conductance and the 2nd …

    njit Repository record for On non-linear network embedding methods (opens in a new tab)

  13. Efficient Community Detection for Large Scale Networks via Sub-sampling

    … various community detection algorithms such as spectral clustering and extreme point algorithm. One of the main contributions is proposing a new sub-sampling method to make existing spectral clustering method scalable by reducing the computational complexity. Also, we have implemented extreme …

    vt Repository record for Efficient Community Detection for Large Scale Networks via Sub-sampling (opens in a new tab)

  14. Spectral Analysis of the Degree-Corrected Laplacian

    … A common approach for estimating communities is spectral clustering, a dimension reduction technique that maps the nodes to a lower-dimensional space while preserving the relevant information. Specifically, the eigenvectors of a particular matrix are used as a representation of each node. These …

    arizona-thes Repository record for Spectral Analysis of the Degree-Corrected Laplacian (opens in a new tab)

  15. Algorithms for partitioning well-clustered graphs

    … according to some connectivity measure. Graph clustering has been widely applied to many fields of computer science, from machine learning to bioinformatics and social network analysis.<br/><br/>The focus of this thesis is to design and analyse algorithms for partitioning graphs presenting a …

    bristol Repository record for Algorithms for partitioning well-clustered graphs (opens in a new tab) Download PDF for Algorithms for partitioning well-clustered graphs (opens in a new tab)

  16. GRAPH-BASED CLUSTERING ALGORITHMS FOR SINGLE-CELL RNA SEQUENCING DATA : METHODS AND THEORY

    … tens of thousands to millions of points (cells). Clustering of cells based on the similarity of their gene expression enables the understanding of their functions and hence the characterization of cell types in a tissue. This dissertation focuses on the most widely used clustering methodology for …

    msu Repository record for GRAPH-BASED CLUSTERING ALGORITHMS FOR SINGLE-CELL RNA SEQUENCING DATA : METHODS AND THEORY (opens in a new tab)

  17. Unsupervised learning in high-dimensional space

    … unsupervised learning scenarios: graph based clustering with imbalanced data, point-wise anomaly detection and anomalous cluster detection on graphs. In the first part we study spectral clustering, a popular graph based clustering technique. We investigate the reason why spectral clustering …

    bu Repository record for Unsupervised learning in high-dimensional space (opens in a new tab)

Page 1 of 11