activity
19992021
collaborators

5 papers

cs.LG2021

Cube Sampled K-Prototype Clustering for Featured Data

Seemandhar Jain, Aditya A. Shastri, Kapil Ahuja +2

Clustering large amount of data is becoming increasingly important in the current times. Due to the large sizes of data, clustering algorithm often take too much time. Sampling thi…

cs.LG2020

Probabilistically Sampled and Spectrally Clustered Plant Genotypes using Phenotypic Characteristics

Aditya A. Shastri, Kapil Ahuja, Milind B. Ratnaparkhe +1

Clustering genotypes based upon their phenotypic characteristics is used to obtain diverse sets of parents that are useful in their breeding programs. The Hierarchical Clustering (…

q-bio.QM2018

Vector Quantized Spectral Clustering applied to Soybean Whole Genome Sequences

Aditya A. Shastri, Kapil Ahuja, Milind B. Ratnaparkhe +3

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 geno…

cs.CV2017

Density-Wise Two Stage Mammogram Classification using Texture Exploiting Descriptors

Aditya A. Shastri, Deepti Tamrakar, Kapil Ahuja

Breast cancer is becoming pervasive with each passing day. Hence, its early detection is a big step in saving the life of any patient. Mammography is a common tool in breast cancer…

math.CO1999

Edge-bandwidth of graphs

Tao Jiang, Dhruv Mubayi, Aditya Shastri +1

The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that…