Predictive Approaches for Sparse Model Learning (2004)
Shevade, SK, Sundararajan, S, Keerthi, SS
In this paper we investigate cross validation and Geisser’s sample reuse approaches for designing linear regression models. These approaches generate sparse models by optimizing multiple smoothing...
Predictive Approaches for Sparse Model Learning (2004)
Shevade, SK, Sundararajan, S, Keerthi, SS
In this paper we investigate cross validation and Geisser’s sample reuse approaches for designing linear regression models. These approaches generate sparse models by optimizing multiple smoothing...
A simple and efficient algorithm for gene selection using sparse logistic regression (2003)
Motivation: This paper gives a new and efficient algorithm for the sparse logistic regression problem. The proposed algorithm is based on the Gauss–Seidel method and is asymptotically convergent....
A simple and efficient algorithm for gene selection using sparse logistic regression (2003)
Motivation: This paper gives a new and efficient algorithm for the sparse logistic regression problem. The proposed algorithm is based on the Gauss–Seidel method and is asymptotically convergent....
Rule prepending and post-pruning approach to incremental learning of decision lists (2001)
Murthy, KRK, Keerthi, SS, Murty, MN
A decision list [1], DL, is defined as a list of ordered pairs $\{(T_1,V_1), (T_2,V_2),... , (T_r,V_r)\}$. These pairs are called nodes and they are denoted as $N_1,N_2,...,N_r$, where...
Improvements to Platt's SMO algorithm for SVM classifier design (2001)
Keerthi, SS, Shevade, SK, Bhattacharyya, C, Murthy, KRK
This article points out an important source of inefficiency in Platt's sequential minimal optimization (SMO) algorithm that is caused by the use of a single threshold value. Using clues from the KKT...
Rule prepending and post-pruning approach to incremental learning of decision lists (2001)
Murthy, KRK, Keerthi, SS, Murty, MN
A decision list [1], DL, is defined as a list of ordered pairs $\{(T_1,V_1), (T_2,V_2),... , (T_r,V_r)\}$. These pairs are called nodes and they are denoted as $N_1,N_2,...,N_r$, where...
Improvements to the SMO algorithm for SVM regression (2000)
Shevade, SK, Keerthi, SS, Bhattacharyya, C, Murthy, KRK
This paper points out an important source of inefficiency in Smola and Scholkopfs sequential minimal optimization (SMO) algorithm for support vector machine (SVM)regression that is caused by the use...
A Fast Iterative Nearest Point Algorithm for Support Vector Machine Classifier Design (2000)
Keerthi, SS, Shevade, SK, Bhattacharyya, C, Murthy, KRK
In this paper we give a new fast iterative algorithm for support vector machine (SVM) classifier design. The basic problem treated is one that does not allow classification violations. The problem is...
Improvements to the SMO algorithm for SVM regression (2000)
Shevade, SK, Keerthi, SS, Bhattacharyya, C, Murthy, KRK
This paper points out an important source of inefficiency in Smola and Scholkopfs sequential minimal optimization (SMO) algorithm for support vector machine (SVM)regression that is caused by the use...
A Fast Iterative Nearest Point Algorithm for Support Vector Machine Classifier Design (2000)
Keerthi, SS, Shevade, SK, Bhattacharyya, C, Murthy, KRK
In this paper we give a new fast iterative algorithm for support vector machine (SVM) classifier design. The basic problem treated is one that does not allow classification violations. The problem is...
Context Filters for Document-Based Information Filtering (1999)
In this paper we propose a keyphrase-sense disambiguation methodology called "context filters" for use in keyphrase based information filtering systems. A context filter finds whether an input...
A Study of Representations for Pen based Handwriting Recognition of Tamil Characters (1999)
In this paper we study the important issue of choosing representations that are suitable for recognizing pen based handwriting of characters in Tamil, a language of India. Four different choices,...
EquiDistance Diagram - A New Roadmap Method for Path Planning (1999)
Keerthi, SS, Ong, CJ, Huang, E, Gilbert, EG
This paper introduces a novel heuristic roadmap method for path planning, one that is inspired by the Voronoi diagram concept, but easily applicable to general configuration spaces. The roadmap is...
Context Filters for Document-Based Information Filtering (1999)
In this paper we propose a keyphrase-sense disambiguation methodology called "context filters" for use in keyphrase based information filtering systems. A context filter finds whether an input...
A Study of Representations for Pen based Handwriting Recognition of Tamil Characters (1999)
In this paper we study the important issue of choosing representations that are suitable for recognizing pen based handwriting of characters in Tamil, a language of India. Four different choices,...
EquiDistance Diagram - A New Roadmap Method for Path Planning (1999)
Keerthi, SS, Ong, CJ, Huang, E, Gilbert, EG
This paper introduces a novel heuristic roadmap method for path planning, one that is inspired by the Voronoi diagram concept, but easily applicable to general configuration spaces. The roadmap is...
Algorithms for the optimal loading of recursive neural nets (1995)
Chandru, V, Dattasharma, A, Keerthi, SS, Sancheti, NK, Vinay, V
The authors address the problem of choosing synaptic weights in a recursive (Hopfield) neural network so as to “optimize�? the performance of the network on the recognition of binary strings. The...
Algorithms for the optimal loading of recursive neural nets (1995)
Chandru, V, Dattasharma, A, Keerthi, SS, Sancheti, NK, Vinay, V
The authors address the problem of choosing synaptic weights in a recursive (Hopfield) neural network so as to “optimize�? the performance of the network on the recognition of binary strings. The...
We consider the problem of moving a convex polyhedral object among convex polyhedral obstacles which have pairwise disjoint interiors in three dimensional Euclidean space. We use an augmented Voronoi...
We consider the problem of moving a convex polyhedral object among convex polyhedral obstacles which have pairwise disjoint interiors in three dimensional Euclidean space. We use an augmented Voronoi...
A New Approach to Global Optimization Using Ideas from Nonlinear Stability Theory (1992)
Shashikala, H, Sancheti, NK, Keerthi, SS
A new method for determing and connecting all the local minima and local maxima of a function on a compact manifold is given. The method is based on properties of stability regions associated with...
A New Approach to the Numerical Solution of Constrained Mechanical System Dynamics (1992)
Keerthi, SS, Sudarsan, R, Sancheti, NK
A new approach to the numerical solution of the vector field associated with constrained mechanical systems, called as the perturbation approach is introduced. It is a specialization of a method of...
Computation of Certain Measures of Proximity Between Convex Polytopes: A Complexity Viewpoint (1992)
Four problems of proximity between two convex polytopes in R^8 are considered. The convex polytopes are represented as convex hulls of finite sets of points. Let the total number of points in the two...
Shashikala, H, Sancheti, NK, Keerthi, SS
An improved potential-based method for robot path planning is developed by connecting all the local minima and local maxima of the potential function defined in fhe configurntion space of the robot....
Transversality theorem : A Useful Tool for Establishing Genericity (1992)
Keerthi, SS, Sancheti, NK, Dattasharma, A
It is shown, via a number of examples in linear algebra and control, optimization, and geometry, that the transversality theorem of differential topology is a useful tool for establishing genericity...
The dynamic simulation of constrained mechanical systems formed by interconnected rigid bodies that undergo large displacements is a research area with applications in a broad range of engineering...
Transversality theorem : A Useful Tool for Establishing Genericity (1992)
Keerthi, SS, Sancheti, NK, Dattasharma, A
It is shown, via a number of examples in linear algebra and control, optimization, and geometry, that the transversality theorem of differential topology is a useful tool for establishing genericity...
A New Approach to Global Optimization Using Ideas from Nonlinear Stability Theory (1992)
Shashikala, H, Sancheti, NK, Keerthi, SS
A new method for determing and connecting all the local minima and local maxima of a function on a compact manifold is given. The method is based on properties of stability regions associated with...
A New Approach to the Numerical Solution of Constrained Mechanical System Dynamics (1992)
Keerthi, SS, Sudarsan, R, Sancheti, NK
A new approach to the numerical solution of the vector field associated with constrained mechanical systems, called as the perturbation approach is introduced. It is a specialization of a method of...
Computation of Certain Measures of Proximity Between Convex Polytopes: A Complexity Viewpoint (1992)
Four problems of proximity between two convex polytopes in R^8 are considered. The convex polytopes are represented as convex hulls of finite sets of points. Let the total number of points in the two...
Shashikala, H, Sancheti, NK, Keerthi, SS
An improved potential-based method for robot path planning is developed by connecting all the local minima and local maxima of the potential function defined in fhe configurntion space of the robot....
The dynamic simulation of constrained mechanical systems formed by interconnected rigid bodies that undergo large displacements is a research area with applications in a broad range of engineering...
Measures of intensity of collision between convex objects and their efficient computation (1991)
class of measures for quantifying the intensity of collision between two intersecting convex, compact objects is given. A general algorithm is derived for computing these measures when the objects...
Measures of intensity of collision between convex objects and their efficient computation (1991)
class of measures for quantifying the intensity of collision between two intersecting convex, compact objects is given. A general algorithm is derived for computing these measures when the objects...
Solution of parametrized linear inequalities by fourier elimination and its applications (1990)
The parametric solution of a linear system of inequalities $Ax\leq Bb$, with parameter b, is considered. Fourier elimination is used to give a facial representation for the set of b-values for which...
Solution of parametrized linear inequalities by fourier elimination and its applications (1990)
The parametric solution of a linear system of inequalities $Ax\leq Bb$, with parameter b, is considered. Fourier elimination is used to give a facial representation for the set of b-values for which...