Vector Quantized Spectral Clustering applied to Soybean Whole Genome Sequences

09/30/2018
by   Aditya A. Shastri, et al.
0

We develop a Vector Quantized Spectral Clustering (VQSC) algorithm that is a combination of Spectral Clustering (SC) and Vector Quantization (VQ) sampling for grouping Soybean genomes. The inspiration here is to use SC for its accuracy and VQ to make the algorithm computationally cheap (the complexity of SC is cubic in-terms of the input size). Although the combination of SC and VQ is not new, the novelty of our work is in developing the crucial similarity matrix in SC as well as use of k-medoids in VQ, both adapted for the Soybean genome data. We compare our approach with commonly used techniques like UPGMA (Un-weighted Pair Graph Method with Arithmetic Mean) and NJ (Neighbour Joining). Experimental results show that our approach outperforms both these techniques significantly in terms of cluster quality (up to 25 quality) and time complexity (order of magnitude faster).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2020

Probabilistically Sampled and Spectrally Clustered Plant Genotypes using Phenotypic Characteristics

Clustering genotypes based upon their phenotypic characteristics is used...
research
09/15/2020

Approximate spectral clustering using both reference vectors and topology of the network generated by growing neural gas

Spectral clustering (SC) is one of the most popular clustering methods a...
research
10/23/2022

Local and Global Structure Preservation Based Spectral Clustering

Spectral Clustering (SC) is widely used for clustering data on a nonline...
research
08/23/2021

Cube Sampled K-Prototype Clustering for Featured Data

Clustering large amount of data is becoming increasingly important in th...
research
10/03/2020

Sparse Quantized Spectral Clustering

Given a large data matrix, sparsifying, quantizing, and/or performing ot...
research
03/07/2022

State space partitioning based on constrained spectral clustering for block particle filtering

The particle filter (PF) is a powerful inference tool widely used to est...
research
05/25/2023

Efficient Approximation Algorithms for Spanning Centrality

Given a graph 𝒢, the spanning centrality (SC) of an edge e measures the ...

Please sign up or login with your details

Forgot password? Click here to reset