A new approach for training Lagrangian twin support vector machine via unconstrained convex minimization. Balasundaram, S., Gupta, D., & Prasad, S. C. Appl. Intell., 46(1):124-134, 2017.
Link
Paper bibtex @article{journals/apin/BalasundaramGP17,
added-at = {2017-01-13T00:00:00.000+0100},
author = {Balasundaram, S. and Gupta, Deepak and Prasad, Subhash Chandra},
biburl = {https://www.bibsonomy.org/bibtex/2f602c801e5b7fca56c01c9b904461ed8/dblp},
ee = {http://dx.doi.org/10.1007/s10489-016-0809-8},
interhash = {927d5e152c00d0efe11a8287d375cde1},
intrahash = {f602c801e5b7fca56c01c9b904461ed8},
journal = {Appl. Intell.},
keywords = {dblp},
number = 1,
pages = {124-134},
timestamp = {2017-01-14T11:34:06.000+0100},
title = {A new approach for training Lagrangian twin support vector machine via unconstrained convex minimization.},
url = {http://dblp.uni-trier.de/db/journals/apin/apin46.html#BalasundaramGP17},
volume = 46,
year = 2017
}
Downloads: 0
{"_id":"Sp7d3ME72iKJAgZ3o","bibbaseid":"balasundaram-gupta-prasad-anewapproachfortraininglagrangiantwinsupportvectormachineviaunconstrainedconvexminimization-2017","author_short":["Balasundaram, S.","Gupta, D.","Prasad, S. C."],"bibdata":{"bibtype":"article","type":"article","added-at":"2017-01-13T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Balasundaram"],"firstnames":["S."],"suffixes":[]},{"propositions":[],"lastnames":["Gupta"],"firstnames":["Deepak"],"suffixes":[]},{"propositions":[],"lastnames":["Prasad"],"firstnames":["Subhash","Chandra"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2f602c801e5b7fca56c01c9b904461ed8/dblp","ee":"http://dx.doi.org/10.1007/s10489-016-0809-8","interhash":"927d5e152c00d0efe11a8287d375cde1","intrahash":"f602c801e5b7fca56c01c9b904461ed8","journal":"Appl. Intell.","keywords":"dblp","number":"1","pages":"124-134","timestamp":"2017-01-14T11:34:06.000+0100","title":"A new approach for training Lagrangian twin support vector machine via unconstrained convex minimization.","url":"http://dblp.uni-trier.de/db/journals/apin/apin46.html#BalasundaramGP17","volume":"46","year":"2017","bibtex":"@article{journals/apin/BalasundaramGP17,\n added-at = {2017-01-13T00:00:00.000+0100},\n author = {Balasundaram, S. and Gupta, Deepak and Prasad, Subhash Chandra},\n biburl = {https://www.bibsonomy.org/bibtex/2f602c801e5b7fca56c01c9b904461ed8/dblp},\n ee = {http://dx.doi.org/10.1007/s10489-016-0809-8},\n interhash = {927d5e152c00d0efe11a8287d375cde1},\n intrahash = {f602c801e5b7fca56c01c9b904461ed8},\n journal = {Appl. Intell.},\n keywords = {dblp},\n number = 1,\n pages = {124-134},\n timestamp = {2017-01-14T11:34:06.000+0100},\n title = {A new approach for training Lagrangian twin support vector machine via unconstrained convex minimization.},\n url = {http://dblp.uni-trier.de/db/journals/apin/apin46.html#BalasundaramGP17},\n volume = 46,\n year = 2017\n}\n\n","author_short":["Balasundaram, S.","Gupta, D.","Prasad, S. C."],"key":"journals/apin/BalasundaramGP17","id":"journals/apin/BalasundaramGP17","bibbaseid":"balasundaram-gupta-prasad-anewapproachfortraininglagrangiantwinsupportvectormachineviaunconstrainedconvexminimization-2017","role":"author","urls":{"Link":"http://dx.doi.org/10.1007/s10489-016-0809-8","Paper":"http://dblp.uni-trier.de/db/journals/apin/apin46.html#BalasundaramGP17"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Deepak Gupta?items=1000","dataSources":["umko553fg3EvKKHEW"],"keywords":["dblp"],"search_terms":["new","approach","training","lagrangian","twin","support","vector","machine","via","unconstrained","convex","minimization","balasundaram","gupta","prasad"],"title":"A new approach for training Lagrangian twin support vector machine via unconstrained convex minimization.","year":2017}