default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYasutoshi Yajima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j10]Tien-Fang Kuo, Yasutoshi Yajima:
Ranking and selecting terms for text categorization via SVM discriminate boundary. Int. J. Intell. Syst. 25(2): 137-154 (2010)
2000 – 2009
- 2009
- [r3]Yasutoshi Yajima:
Convex Envelopes in Optimization Problems. Encyclopedia of Optimization 2009: 550-551 - [r2]Panos M. Pardalos, Yasutoshi Yajima:
Integer Linear Complementary Problem. Encyclopedia of Optimization 2009: 1608-1610 - [r1]Yasutoshi Yajima:
Quadratic Knapsack. Encyclopedia of Optimization 2009: 3159-3161 - 2007
- [c8]Yasutoshi Yajima, Teppei Sato:
Semi-supervised Kernel Logistic Regression and Its Extension to Active Learning Based on A-Optimality. ICDM Workshops 2007: 277-282 - [c7]Yasutoshi Yajima:
Predicting purchase preferences using semi-supervised one-class SVM with graph kernels. SMC 2007: 3505-3511 - 2006
- [j9]Yasutoshi Yajima, Tien-Fang Kuo:
Efficient Formulations for 1-SVM and their Application to Recommendation Tasks. J. Comput. 1(3): 27-34 (2006) - [c6]Tien-Fang Kuo, Yasutoshi Yajima:
A cutting plane algorithm for multiclass kernel discriminations. GrC 2006: 223-228 - [c5]Yasutoshi Yajima, Tien-Fang Kuo:
Optimization Approaches for Semi-Supervised Multiclass Classification. ICDM Workshops 2006: 863-867 - [c4]Yasutoshi Yajima:
One-Class Support Vector Machines for Recommendation Tasks. PAKDD 2006: 230-239 - 2005
- [j8]Yasutoshi Yajima:
Linear programming approaches for multicategory support vector machines. Eur. J. Oper. Res. 162(2): 514-531 (2005) - [c3]Tien-Fang Kuo, Yasutoshi Yajima:
Ranking and selecting terms for text categorization via SVM discriminate boundary. GrC 2005: 496-501 - [c2]Yasutoshi Yajima, Takashi Hoshiba:
Optimization approaches for semi-supervised learning. ICMLA 2005 - 2003
- [c1]Tien-Fang Kuo, Yasutoshi Yajima:
Approximate Reducts of an Information System. RSFDGrC 2003: 291-294
1990 – 1999
- 1998
- [j7]Yasutoshi Yajima, Tetsuya Fujie:
A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints. J. Glob. Optim. 13(2): 151-170 (1998) - 1994
- [j6]Hiroshi Konno, Yasutoshi Yajima, Ayumi Ban:
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities. Comput. Optim. Appl. 3(2): 181-191 (1994) - [j5]Hiroshi Konno, Takahito Kuno, Yasutoshi Yajima:
Global minimization of a generalized convex multiplicative function. J. Glob. Optim. 4(1): 47-62 (1994) - 1993
- [j4]Takahito Kuno, Yasutoshi Yajima, Hiroshi Konno:
An outer approximation method for minimizing the product of several convex functions on a convex set. J. Glob. Optim. 3(3): 325-335 (1993) - 1992
- [j3]Hiroshi Konno, Takahito Kuno, Yasutoshi Yajima:
Parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomial. Comput. Optim. Appl. 1(2): 227-239 (1992) - 1991
- [j2]Hiroshi Konno, Yasutoshi Yajima, Tomomi Matsui
:
Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J. Glob. Optim. 1(1): 65-81 (1991) - [j1]Yasutoshi Yajima, Hiroshi Konno:
Efficient algorithms for solving rank two and rank three bilinear programming problems. J. Glob. Optim. 1(2): 155-171 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
