Kaushik Sinha

Orcid: 0000-0002-0025-5754

According to our database1, Kaushik Sinha authored at least 41 papers between 2005 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Domain Mapping Matrix-Based Metric for Measuring System Design Complexity.
IEEE Trans. Engineering Management, 2022

Federated Nearest Neighbor Classification with a Colony of Fruit-Flies.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Random projection-based auxiliary information can improve tree-based nearest neighbor search.
Inf. Sci., 2021

Federated Nearest Neighbor Classification with a Colony of Fruit-Flies: With Supplement.
CoRR, 2021

Fruit-fly Inspired Neighborhood Encoding for Classification.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020
Design structure matrix-based modularization approach for complex systems with multiple design constraints.
Syst. Eng., 2020

Neural Neighborhood Encoding for Classification.
CoRR, 2020

IBeaconMap: Automated Indoor Space Representation for Beacon-Based Wayfinding.
Proceedings of the Computers Helping People with Special Needs, 2020

2019
Revisiting kd-tree for Nearest Neighbor Search.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

2018
Improved maximum inner product search with better theoretical guarantee using randomized partition trees.
Mach. Learn., 2018

Robotic Understanding of Scene Contents and Spatial Constraints.
Proceedings of the Social Robotics - 10th International Conference, 2018

K-means clustering using random matrix sparsification.
Proceedings of the 35th International Conference on Machine Learning, 2018

Improved nearest neighbor search using auxiliary information and priority functions.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Improved maximum inner product search with better theoretical guarantees.
Proceedings of the 2017 International Joint Conference on Neural Networks, 2017

A novel machine learning framework for phenotype prediction based on genome-wide DNA methylation data.
Proceedings of the 2017 International Joint Conference on Neural Networks, 2017

A support vector machine approach to identification of proteins relevant to learning in a mouse model of Down Syndrome.
Proceedings of the 2017 International Joint Conference on Neural Networks, 2017

Sparse Randomized Partition Trees for Nearest Neighbor Search.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
Empirical Validation of Structural Complexity Metric and Complexity Management for Engineering Systems.
Syst. Eng., 2016

Matrix Energy as a Measure of Topological Complexity of a Graph.
CoRR, 2016

Exploring Early Stage Cost-Estimation Methods Using Off-the-Shelf Tools: A Preliminary Study.
Proceedings of the Complex Systems Design & Management, 2016

Complexity Management for Engineered Systems Using System Value Definition.
Proceedings of the Complex Systems Design & Management, 2016

2015
Polynomial Learning of Distribution Families.
SIAM J. Comput., 2015

Randomized Partition Trees for Nearest Neighbor Search.
Algorithmica, 2015

Fast £1-norm Nearest Neighbor Search Using A Simple Variant of Randomized Partition Tree.
Proceedings of the INNS Conference on Big Data 2015, 2015

2014
LSH vs Randomized Partition Trees: Which One to Use for Nearest Neighbor Search?
Proceedings of the 13th International Conference on Machine Learning and Applications, 2014

Semi-Supervised Learning.
Proceedings of the Data Classification: Algorithms and Applications, 2014

2013
A near-optimal algorithm for differentially-private principal components.
J. Mach. Learn. Res., 2013

A network-based structural complexity metric for engineered complex systems.
Proceedings of the IEEE International Systems Conference, 2013

Randomized partition trees for exact nearest neighbor search.
Proceedings of the COLT 2013, 2013

2012
Near-Optimal Algorithms for Differentially-Private Principal Components
CoRR, 2012

Near-optimal Differentially Private Principal Components.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2010
Toward Learning Gaussian Mixtures with Arbitrary Separation.
Proceedings of the COLT 2010, 2010

2009
Learning Gaussian Mixtures with Arbitrary Separation
CoRR, 2009

Semi-Supervised Learning Using Sparse Eigenfunction Bases.
Proceedings of the Manifold Learning and Its Applications, 2009

2007
A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow.
Oper. Res., 2007

The Value of Labeled and Unlabeled Examples when the Model is Imperfect.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006
Exploratory Tools for Follow­Up Studies to Microarray Experiments.
Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006

2005
A framework to support multiple query optimization for complex mining tasks.
Proceedings of the 6th international workshop on Multimedia data mining, 2005

Simultaneous optimization of complex mining tasks with a knowledgeable cache.
Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

Learning Layouts of Biological Datasets Semi-automatically.
Proceedings of the Data Integration in the Life Sciences, Second InternationalWorkshop, 2005

Using Data Mining Techniques to Learn Layouts of Flat-File Biological Datasets.
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005


  Loading...