Zobrazeno 1 - 10
of 15
pro vyhledávání: '"J. Saketha Nath"'
Publikováno v:
npj Systems Biology and Applications, Vol 10, Iss 1, Pp 1-14 (2024)
Abstract Biological systems are robust and redundant. The redundancy can manifest as alternative metabolic pathways. Synthetic double lethals are pairs of reactions that, when deleted simultaneously, abrogate cell growth. However, removing one reacti
Externí odkaz:
https://doaj.org/article/016e41de1aaf4d598b9c4c179bcfaea4
Publikováno v:
PRICAI 2019: Trends in Artificial Intelligence ISBN: 9783030299101
PRICAI (2)
PRICAI (2)
We address the challenge of high speed autonomous navigation of micro aerial vehicles (MAVs) using DNNs in GPS-denied environments with limited computational resources; specifically, we use the ODROID XU4 and the Raspberry Pi 3. The high computation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f5dea983717be584111e9437bf4ba64
https://doi.org/10.1007/978-3-030-29911-8_36
https://doi.org/10.1007/978-3-030-29911-8_36
Publikováno v:
KDD
In this paper we present learning models for the class ratio estimation problem, which takes as input an unlabeled set of instances and predicts the proportions of instances in the set belonging to the different classes. This problem has applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f9fa2e75b5a8c14c5b1344488678650
https://doi.org/10.1145/2939672.2939806
https://doi.org/10.1145/2939672.2939806
Autor:
Shirish Shevade, J. Saketha Nath
Publikováno v:
Pattern Recognition. 39:1473-1480
Support vector clustering involves three steps-solving an optimization problem, identification of clusters and tuning of hyper-parameters. In this paper, we introduce a pre-processing step that eliminates data points from the training data that are n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9e8b8fe1d9f97a715f6cd6fa73cead5
https://doi.org/10.1016/j.patcog.2006.03.012
https://doi.org/10.1016/j.patcog.2006.03.012
Autor:
Pratik Jawanpuria, J. Saketha Nath
Publikováno v:
Proceedings of the 2011 SIAM International Conference on Data Mining.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86bf8ac13b6ca2d3b01618a5cfa095cc
https://doi.org/10.1137/1.9781611972818.71
https://doi.org/10.1137/1.9781611972818.71
Publikováno v:
Mathematical Programming, 127(1), 145-173. Springer
This paper studies the problem of constructing robust classifiers when the training is plagued with uncertainty. The problem is posed as a Chance-Constrained Program (CCP) which ensures that the uncertain data points are classified correctly with hig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ff073358a693086f9c185c04384bc19
http://eprints.iisc.ac.in/36569/1/Chance.pdf
http://eprints.iisc.ac.in/36569/1/Chance.pdf
Publikováno v:
Advances in Knowledge Discovery and Data Mining ISBN: 9783642013065
PAKDD
PAKDD
This paper presents a Chance-constraint Programming approach for constructing maximum-margin classifiers which are robust to interval-valued uncertainty in training examples. The methodology ensures that uncertain examples are classified correctly wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99befc352f53cb1a6f0f141e4352ec95
https://doi.org/10.1007/978-3-642-01307-2_21
https://doi.org/10.1007/978-3-642-01307-2_21
Autor:
Sivaramakrishnan K R, Chiranjib Bhattacharyya, J. Saketha Nath, Rashmin Babaria, M. N. Murty, Krishnan S
Publikováno v:
ICML
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone (SOC) constraint. The main contribution of the paper is a fast algorith
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b9726bf6ff56e6b988e3606c101524d
https://doi.org/10.1145/1273496.1273504
https://doi.org/10.1145/1273496.1273504
Autor:
J. Saketha Nath, C. Bhattacharyya
Publikováno v:
IndraStra Global.
This paper addresses the problem of maximum margin classification given the moments of class conditional densities and the false positive and false negative error rates. Using Chebyshev inequalities, the problem can be posed as a second order cone pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::65e0032c9db3ba3cd4be5b6f2b68a2cc
http://eprints.iisc.ac.in/41463/1/Maximum_Margi.pdf
http://eprints.iisc.ac.in/41463/1/Maximum_Margi.pdf
Publikováno v:
KDD
This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture distributions, where each component of the mixture has a spherical cov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ca4829553fe28ac4e0b176e76f8c4b0
http://eprints.iisc.ac.in/41966/1/Clustering_Based.pdf
http://eprints.iisc.ac.in/41966/1/Clustering_Based.pdf