Suresh Chandra
Research Subjects
Suresh Chandra has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Jayadeva
Yardi School of Artificial Intelligence, the Department of Electrical Engineering, Indian Institute of Technology Delhi, India
7 shared publications - Reshma Khemchandani
RBS India Development Centre, Gurgaon, India
6 shared publications - Reshma Rastogi
South Asian University
3 shared publications - Sameena Shah
Thomson Reuters Corp. R & D
3 shared publications A. Aggarwal
University School of Basic and Applied Sciences, Guru Gobind Singh Indraprastha University, Delhi- 110078, India
2 shared publications- Abha Aggarwal
University School of Basic and Applied Sciences, Guru Gobind Singh Indraprastha University, New Delhi, India
2 shared publications
Latest Publications
- Open Access
A $ν$- support vector quantile regression model with automatic accuracy control
This paper proposes a novel '$\nu$-support vector quantile regression' ($\nu$-SVQR) model for the quantile estimation. It can facilitate the automatic control over accuracy by creating a suitable asymmetric $\epsilon$-insensitive zone according to the variance present in data. The proposed $\nu$-SVQR model uses the $\nu$ fraction of training data points for the estimation of the quantiles. In the $\nu$-SVQR model, training points asymptotically appear above and below of the asymmetric $\epsilon$-insensitive tube in the ratio of $1-\tau$ and $\tau$. Further, there are other interesting properties of the proposed $\nu$-SVQR model, which we have briefly described in this paper. These properties have been empirically verified using the artificial and real world dataset also.Open AccessA $ν$- support vector quantile regression model with automatic accuracy control
This paper proposes a novel '$\nu$-support vector quantile regression' ($\nu$-SVQR) model for the quantile estimation. It can facilitate the automatic control over accuracy by creating a suitable asymmetric $\epsilon$-insensitive zone according to the variance present in data. The proposed $\nu$-SVQR model uses the $\nu$ fraction of training data points for the estimation of the quantiles. In the $\nu$-SVQR model, training points asymptotically appear above and below of the asymmetric $\epsilon$-insensitive tube in the ratio of $1-\tau$ and $\tau$. Further, there are other interesting properties of the proposed $\nu$-SVQR model, which we have briefly described in this paper. These properties have been empirically verified using the artificial and real world dataset also. - 23 May 2017
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 9 (12) , 2059-2070
Generalized eigenvalue proximal support vector regressor for the simultaneous learning of a function and its derivatives
- 23 May 2017
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 9 (12) , 2059-2070
Generalized eigenvalue proximal support vector regressor for the simultaneous learning of a function and its derivatives
- 1 July 2016
- Published by Elsevier in Neural Networks
- Vol. 79, 97-107
Improvements on -Twin Support Vector Machine- 1 July 2016
- Published by Elsevier in Neural Networks
- Vol. 79, 97-107
Improvements on -Twin Support Vector Machine- 1 February 2016
- Published by Elsevier in Neural Networks
- Vol. 74, 14-21
TWSVR: Regression via Twin Support Vector Machine
- 1 February 2016
- Published by Elsevier in Neural Networks
- Vol. 74, 14-21
TWSVR: Regression via Twin Support Vector Machine
- 23 August 2014
- Published by Springer Nature in Annals of Operations Research
- Vol. 243 (1-2) , 211-228
Single asset optimal trading strategies with stochastic dominance constraints
- 23 August 2014
- Published by Springer Nature in Annals of Operations Research
- Vol. 243 (1-2) , 211-228
Single asset optimal trading strategies with stochastic dominance constraints
- Open Access
- 1 June 2014
- Published by Tsinghua University Press in Fuzzy Information and Engineering
- Vol. 6 (2) , 167-192
Solving Matrix Games with I-fuzzy Payoffs: Pareto-optimal Security Strategies Approach
A recent research work of Clemente et al. [12] on Pareto-optimal security strategies (POSS) in matrix games with fuzzy payoffs is extended to I-fuzzy scenario. Besides, the membership and the non-membership functions of the I-fuzzy values for both players are obtained by employing the technique of multiobjective optimization. The presented approach provides an efficient solution to a class of I-fuzzy matrix games with piecewise linear membership and non-membership functions. This class also includes I-fuzzy matrix games with triangular and trapezoidal I-fuzzy numbers as special cases. Further, POSS approach also provides an approximate solution to I-fuzzy matrix games with payoffs as general I-fuzzy numbers.
- 1 June 2014
- Published by Tsinghua University Press in Fuzzy Information and Engineering
- Vol. 6 (2) , 167-192
Open AccessSolving Matrix Games with I-fuzzy Payoffs: Pareto-optimal Security Strategies Approach
A recent research work of Clemente et al. [12] on Pareto-optimal security strategies (POSS) in matrix games with fuzzy payoffs is extended to I-fuzzy scenario. Besides, the membership and the non-membership functions of the I-fuzzy values for both players are obtained by employing the technique of multiobjective optimization. The presented approach provides an efficient solution to a class of I-fuzzy matrix games with piecewise linear membership and non-membership functions. This class also includes I-fuzzy matrix games with triangular and trapezoidal I-fuzzy numbers as special cases. Further, POSS approach also provides an approximate solution to I-fuzzy matrix games with payoffs as general I-fuzzy numbers.
- 1 January 2014
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 27 (5) , 2603-2610
On solving fuzzy Linear programming problems: A revisit to zimmermann's approach
The celebrated Zimmermann's approach for solving fuzzy linear programming problems is re-looked and apparently a new formulation leading to a new interpretation is presented. The basic feature of this formulation is that it attempts to trade-off between the twin objectives of ‘satisfaction of fuzzy constraints’ and ‘attainment of the aspiration level of the objective function’. For this a bi-objective optimization problem involving these twin objectives is constructed and its efficient solution is interpreted as a solution of the given fuzzy linear programming problem. As an outcome of this study a new two phase approach to solve fuzzy linear programming problems is obtained. This new two phase approach is different from those available in the literature and is in the true spirit of conventional two phase approach for solving crisp linear programming problems. Further, two additional models are also proposed on similar lines which also provide an efficient solution of the bi-objective optimization problem under consideration. Certain small numerical examples are included to illustrate the results.
- 1 January 2014
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 27 (5) , 2603-2610
On solving fuzzy Linear programming problems: A revisit to zimmermann's approach
The celebrated Zimmermann's approach for solving fuzzy linear programming problems is re-looked and apparently a new formulation leading to a new interpretation is presented. The basic feature of this formulation is that it attempts to trade-off between the twin objectives of ‘satisfaction of fuzzy constraints’ and ‘attainment of the aspiration level of the objective function’. For this a bi-objective optimization problem involving these twin objectives is constructed and its efficient solution is interpreted as a solution of the given fuzzy linear programming problem. As an outcome of this study a new two phase approach to solve fuzzy linear programming problems is obtained. This new two phase approach is different from those available in the literature and is in the true spirit of conventional two phase approach for solving crisp linear programming problems. Further, two additional models are also proposed on similar lines which also provide an efficient solution of the bi-objective optimization problem under consideration. Certain small numerical examples are included to illustrate the results.
- 8 February 2013
- Published by Springer Nature in Swarm Intelligence
- Vol. 7 (1) , 43-62
Ants find the shortest path: a mathematical proof
- 8 February 2013
- Published by Springer Nature in Swarm Intelligence
- Vol. 7 (1) , 43-62
Ants find the shortest path: a mathematical proof
- 1 December 2012
- Published by Tsinghua University Press in Fuzzy Information and Engineering
- Vol. 4 (4) , 401-414
Application of Atanassov's I-fuzzy Set Theory to Matrix Games with Fuzzy Goals and Fuzzy Payoffs
We aim to extend some results in [6, 7, 8, 2] on two person zero sum matrix games (TPZSMG) with fuzzy goals and fuzzy payoffs to I-fuzzy scenario. Because the payoffs of the matrix game are fuzzy numbers, the aspiration levels of the players are fuzzy as well. It is reasonable to believe that there is some indeterminacy in estimating the aspiration levels of both players from their respective expected pay offs. This situation is modeled in the game using Atanassov’s I-fuzzy set theory. A new solution concept is proposed for such games and a procedure is outlined to obtain the degrees of suitability of the aspiration levels for each of the two players.
- 1 December 2012
- Published by Tsinghua University Press in Fuzzy Information and Engineering
- Vol. 4 (4) , 401-414
Application of Atanassov's I-fuzzy Set Theory to Matrix Games with Fuzzy Goals and Fuzzy Payoffs
We aim to extend some results in [6, 7, 8, 2] on two person zero sum matrix games (TPZSMG) with fuzzy goals and fuzzy payoffs to I-fuzzy scenario. Because the payoffs of the matrix game are fuzzy numbers, the aspiration levels of the players are fuzzy as well. It is reasonable to believe that there is some indeterminacy in estimating the aspiration levels of both players from their respective expected pay offs. This situation is modeled in the game using Atanassov’s I-fuzzy set theory. A new solution concept is proposed for such games and a procedure is outlined to obtain the degrees of suitability of the aspiration levels for each of the two players.
- 25 March 2012
- Published by Springer Nature in Fuzzy Optimization and Decision Making
- Vol. 11 (4) , 465-480
Application of linear programming with I-fuzzy sets to matrix games with I-fuzzy goals
- 25 March 2012
- Published by Springer Nature in Fuzzy Optimization and Decision Making
- Vol. 11 (4) , 465-480
Application of linear programming with I-fuzzy sets to matrix games with I-fuzzy goals