activity
20152023
most citedDynamic Feature Scaling for K-Nearest Neighbor Algorithm

4 citations · 4 across the 4 of their papers we have counts for

collaborators

5 papers

math.CO2023

Eigenvalue Interlacing of Bipartite Graphs and Construction of Expander Code using Vertex-split of a Bipartite Graph

Machasri Manickam, Kalyani Desikan

The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are h…

cs.LG2018★ 4 cited

Dynamic Feature Scaling for K-Nearest Neighbor Algorithm

Chandrasekaran Anirudh Bhardwaj, Megha Mishra, Kalyani Desikan

Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training data…

cs.FL2017

Language properties and Grammar of Parallel and Series Parallel Languages

N. Mohana, Kalyani Desikan, V. Rajkumar Dare

In this paper we have defined the language theoretical properties of Parallel languages and series parallel languages. Parallel languages and Series parallel languages play vital r…

cs.LG2017

A Maximal Heterogeneity Based Clustering Approach for Obtaining Samples

Megha Mishra, Chandrasekaran Anirudh Bhardwaj, Kalyani Desikan

Medical and social sciences demand sampling techniques which are robust, reliable, replicable and have the least dissimilarity between the samples obtained. Majority of the applica…

cs.IR2015

Experimental Estimation of Number of Clusters Based on Cluster Quality

G. Hannah Grace, Kalyani Desikan

Text Clustering is a text mining technique which divides the given set of text documents into significant clusters. It is used for organizing a huge number of text documents into a…