Santosh Srivastava
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Santosh Srivastava has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Maya R. Gupta
Department of Electrical Engineering, University of Washington, Seattle, WA 98195, USA
3 shared publications - B. A. Frigyik
Department of Mathematics, Purdue University, West Lafayette, USA
1 shared publication Francis J. Huber
1 shared publication- Luca Cazzanti
Dept. of Electrical Engineering University of Washington Seattle 98195 WA USA
1 shared publication
Latest Publications
- Open Access
- 25 March 2008
- Published by Defense Technical Information Center (DTIC)
Command and Control Organizations for Network Enabled Warfare
We consider the problems of class probability estimation and classification when using near-neighbor classifiers, such as k-nearest neighbors (kNN). This paper investigates minimum expected risk estimates for neighborhood learning methods. We give analytic solutions for the minimum expected risk estimate for weighted kNN classifiers with different prior information, for a broad class of risk functions. Theory and simulations show how significant the difference is compared to the standard maximum likelihood weighted kNN estimates. Comparisons are made with uniform weights, symmetric weights (tricube kernel), and asymmetric weights (LIME kernel). Also, it is shown that if the uncertainty in the class probability is modeled by a random variable, and the expected misclassification cost is minimized, the result is equivalent to using a classifier with a minimum expected risk estimate. For symmetric costs and uniform priors, it is seen that minimum expected risk estimates have no advantage over the standard maximum likelihood estimates. For asymmetric costs, simulations show that the differences can be striking.
- 25 March 2008
- Published by Defense Technical Information Center (DTIC)
Open AccessCommand and Control Organizations for Network Enabled Warfare
We consider the problems of class probability estimation and classification when using near-neighbor classifiers, such as k-nearest neighbors (kNN). This paper investigates minimum expected risk estimates for neighborhood learning methods. We give analytic solutions for the minimum expected risk estimate for weighted kNN classifiers with different prior information, for a broad class of risk functions. Theory and simulations show how significant the difference is compared to the standard maximum likelihood weighted kNN estimates. Comparisons are made with uniform weights, symmetric weights (tricube kernel), and asymmetric weights (LIME kernel). Also, it is shown that if the uncertainty in the class probability is modeled by a random variable, and the expected misclassification cost is minimized, the result is equivalent to using a classifier with a minimum expected risk estimate. For symmetric costs and uniform priors, it is seen that minimum expected risk estimates have no advantage over the standard maximum likelihood estimates. For asymmetric costs, simulations show that the differences can be striking.
- Open Access
Functional Bregman Divergence and Bayesian Estimation of Distributions
A class of distortions termed functional Bregman divergences is defined, which includes squared error and relative entropy. A functional Bregman divergence acts on functions or distributions, and generalizes the standard Bregman divergence for vectors and a previous pointwise Bregman divergence that was defined for functions. A recently published result showed that the mean minimizes the expected Bregman divergence. The new functional definition enables the extension of this result to the continuous case to show that the mean minimizes the expected functional Bregman divergence over a set of functions or distributions. It is shown how this theorem applies to the Bayesian estimation of distributions. Estimation of the uniform distribution from independent and identically drawn samples is used as a case study.
Open AccessFunctional Bregman Divergence and Bayesian Estimation of Distributions
A class of distortions termed functional Bregman divergences is defined, which includes squared error and relative entropy. A functional Bregman divergence acts on functions or distributions, and generalizes the standard Bregman divergence for vectors and a previous pointwise Bregman divergence that was defined for functions. A recently published result showed that the mean minimizes the expected Bregman divergence. The new functional definition enables the extension of this result to the continuous case to show that the mean minimizes the expected functional Bregman divergence over a set of functions or distributions. It is shown how this theorem applies to the Bayesian estimation of distributions. Estimation of the uniform distribution from independent and identically drawn samples is used as a case study.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2294-2298
Distribution-based Bayesian Minimum Expected Risk for Discriminant Analysis
This paper considers a distribution-based Bayesian estimation for classification by quadratic discriminant analysis, instead of the standard parameter-based Bayesian estimation. This approach also yields closed form solutions, but removes the parameter-based restriction of requiring more training samples than feature dimensions. We investigate how to define a prior so that it has an adaptively regularizing effect: yielding robust estimation when the number of training samples are small compared to the number of feature dimensions, but converging as the number of data points grows large. Comparative performance on a suite of simulations shows that the distribution-based Bayesian discriminant analysis is advantageous in terms of average error
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2294-2298
Distribution-based Bayesian Minimum Expected Risk for Discriminant Analysis
This paper considers a distribution-based Bayesian estimation for classification by quadratic discriminant analysis, instead of the standard parameter-based Bayesian estimation. This approach also yields closed form solutions, but removes the parameter-based restriction of requiring more training samples than feature dimensions. We investigate how to define a prior so that it has an adaptively regularizing effect: yielding robust estimation when the number of training samples are small compared to the number of feature dimensions, but converging as the number of data points grows large. Comparative performance on a suite of simulations shows that the distribution-based Bayesian discriminant analysis is advantageous in terms of average error