Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IBISML |
2013-11-12 15:45 |
Tokyo |
Tokyo Institute of Technology, Kuramae-Kaikan |
[Poster Presentation]
Safe Sample Screening Rule on Hinge Loss Minimization Kohei Ogawa, Yamato Kawamoto, Yoshiki Suzuki, Ichiro Takeuchi (Nagoya Inst. of Tech.) IBISML2013-39 |
In this paper, we propose the algorithm that can speed up computing problems minimizing Hinge loss such as SVMs, via eli... [more] |
IBISML2013-39 pp.23-30 |
IBISML |
2013-11-13 15:45 |
Tokyo |
Tokyo Institute of Technology, Kuramae-Kaikan |
[Poster Presentation]
Safe Screening Rule for Incmrenetal Learning Yoshiki Suzuki, Shota Okumura, Kohei Ogawa, Ichiro Takeuchi (Nagoya Inst. of Tech.) IBISML2013-64 |
Efficient optimization algorithm is required in online learning or other incremental learning scenario since the model m... [more] |
IBISML2013-64 pp.213-218 |
IBISML |
2013-03-05 16:05 |
Aichi |
Nagoya Institute of Technology |
Computing pathwise SVMs by Using Non-Support Vector Screening Kohei Ogawa, Yoshiki Suzuki, Ichiro Takeuchi (Nagoya Inst. of Tech.) IBISML2012-108 |
In this paper, we claim that some of the non-support vectors (non-SVs) that have no influence on the classifier can be s... [more] |
IBISML2012-108 pp.107-114 |
PRMU |
2013-02-21 15:30 |
Osaka |
|
Recognition of "Want to Speak''/"Want to Hear'' Communicative Expressions from Facial Features Yuichi Watanabe, Daisuke Fukatsu, Naoki Mukawa (Tokyo Denki Univ.) PRMU2012-146 |
In order to realize smooth conversation between human and robots, it is important to read indistinctive behaviors of hum... [more] |
PRMU2012-146 pp.97-102 |
IBISML |
2012-11-08 15:00 |
Tokyo |
Bunkyo School Building, Tokyo Campus, Tsukuba Univ. |
Efficient SVM Bootstrap Computation by Parametric Programming Yoshiki Suzuki, Kohei Ogawa, Ichiro Takeuchi (Nagoya Inst. of Tech.) IBISML2012-73 |
In this paper, we study statistical variability estimation of the support vector machine (SVM) by using bootstrap method... [more] |
IBISML2012-73 pp.277-282 |
PRMU, SP |
2012-02-10 14:50 |
Miyagi |
|
Event detection from Video using GMM-Supervectors and SVMs Yusuke Kamishima, Nakamasa Inoue, Koichi Shinoda (Tokyo Tech), Shunsuke Sato (Canon) PRMU2011-230 SP2011-145 |
In multimedia event detection, complex target events are detected from a large set of consumer domain videos taken in un... [more] |
PRMU2011-230 SP2011-145 pp.195-200 |
PRMU, IBISML, IPSJ-CVIM [detail] |
2011-09-05 13:30 |
Hokkaido |
|
[Invited Talk]
Optimal Solution Path Following Algorithm for Pattern Recognition and Machine Learning Ichiro Takeuchi (NIT) PRMU2011-66 IBISML2011-25 |
Many pattern classification and machine learning algorithms are formulated as mathematical optimization problems. These ... [more] |
PRMU2011-66 IBISML2011-25 pp.59-60 |
MBE, NC (Joint) |
2010-11-18 18:10 |
Miyagi |
Tohoku University |
Comparison of Precision in Posterior Probability Estimation for Classification of Electroencephalogram
-- Comparision of Support Vector Machine and Relevance Vector Machine -- Hiromu Takahashi, Tomohiro Yoshikawa, Takeshi Furuhashi (Nagoya Univ.) NC2010-61 |
The posterior probability in classification is useful information, which can be used for the rejection of uncertain clas... [more] |
NC2010-61 pp.47-52 |
IBISML |
2010-11-04 15:00 |
Tokyo |
IIS, Univ. of Tokyo |
[Poster Presentation]
A Study on Simultaneous Feature Selection for Cost-Sensitive Classifiers Using Mixed-Norm Regularization Toru Sugiura, Kazuaki Koide, Tatsuya Hongo, Masayuki Karasuyama, Ichiro Takeuchi (NIT) IBISML2010-70 |
Cost-sensitive learning is useful for binary classification when the
costs of miss-classifications are not symmetric. I... [more] |
IBISML2010-70 pp.83-90 |
IBISML |
2010-11-05 15:30 |
Tokyo |
IIS, Univ. of Tokyo |
[Poster Presentation]
A Study on the Suboptimal Solution Path Algorithm Masayuki Karasuyama, Ichiro Takeuchi (NIT) IBISML2010-89 |
The solution path algorithms in machine learning trace the exact optimal solutions by exploiting the piecewise linearity... [more] |
IBISML2010-89 pp.221-230 |
NLP |
2010-10-29 12:20 |
Osaka |
Osaka University Machikaneyama Hall |
VC-dimension reduction algorithms for hyperkernel SVM-type machines Kohei Mori, Takashi Okashiro (Kobe Univ.) NLP2010-98 |
This paper introduces a support vector machine like learning algorithm that combines two techniques introduced for enhan... [more] |
NLP2010-98 pp.95-98 |
IBISML |
2010-06-14 15:30 |
Tokyo |
Takeda Hall, Univ. Tokyo |
A Study on the Exact Nonlinear Regularization Path for L2 Loss Support Vector Machines Masayuki Karasuyama, Ichiro Takeuchi (Nagoya Inst. of Tech.) IBISML2010-6 |
Regularization path algorithm has been proposed for model selection
problem of Support Vector Machine (SVM).
The alg... [more] |
IBISML2010-6 pp.23-31 |
NC, MBE (Joint) |
2010-03-10 10:40 |
Tokyo |
Tamagawa University |
A Study on Path Following of Label-Permuted Solution for Support Vector Machine and its Application for Microarray Data Analysis Yuta Ishikawa, Kouta Isobe, Ichiro Takeuchi (Nagoya Inst. of Tech.) NC2009-132 |
Microarray technology enables us to measure expression levels of thousands of genes simultaneously.The fundamental task ... [more] |
NC2009-132 pp.261-266 |
NC, MBE (Joint) |
2010-03-11 13:20 |
Tokyo |
Tamagawa University |
A study on ranking model optimization by following discrete changes of an evaluation value Naoyuki Harada, Takuya Hasegawa, Masayuki Karasuyama, Ichiro Takeuchi (Nagoya Inst. of Tech.) NC2009-166 |
A well-known ranking method, {\it Ranking SVM}, formulates the ranking problem as the binary classification problem on i... [more] |
NC2009-166 pp.461-466 |
NLP |
2009-11-11 16:20 |
Kagoshima |
|
Experimental Evaluation of a Two-Phase Sequential Partial Optimization Algorithm for Convex Quadratic Programming Problems Yuta Kobayashi, Norikazu Takahashi (Kyushu Univ.) NLP2009-97 |
A convex quadratic programming (QP) problem is an optimization problem in which a convex quadratic function is minimized... [more] |
NLP2009-97 pp.85-90 |
IE, ITS, ITE-HI, ITE-ME, ITE-AIT |
2009-02-05 15:20 |
Hokkaido |
Graduate School of Information Science and Technology Hokkaido Univ |
Automatic Detection of Perceptually Salient Objects or Human Beings in an Image Mineki Takaya, Hiroki Takiguchi, Junji Maeda (Muroran Inst. of Tech.) ITS2008-75 IE2008-245 |
In the early process of the human vision,
it is known that people pay preferential attention to salient objects.
Man... [more] |
ITS2008-75 IE2008-245 pp.233-238 |
CAS, NLP |
2009-01-23 13:00 |
Miyazaki |
|
On the Global Convergence of a Decomposition Method for General Convex Quadratic Programming Problems Yuta Kobayashi, Norikazu Takahashi (Kyushu Univ.) CAS2008-92 NLP2008-122 |
A convex quadratic programming (QP) problem, which plays important roles in many fields, is an optimization problem to m... [more] |
CAS2008-92 NLP2008-122 pp.159-163 |
NC, MBE (Joint) |
2008-03-13 13:30 |
Tokyo |
Tamagawa Univ |
A Statistical Analysis of Support Vector Machines of Forgetting Factor Yoshihiko Nomura, Hiroyuki Funaya, Kazushi Ikeda (Kyoto Univ.) NC2007-168 |
Support Vector Machines (SVMs) are, in general, trained in batch but any trick is necessary when the target to be traine... [more] |
NC2007-168 pp.331-336 |
PRMU |
2008-02-22 11:15 |
Ibaraki |
Univ. of Tsukuba |
Influence of viewing behavior on estimation performance of certainty using features of eye-movements Minoru Nakayama, Yosiyuki Takahasi (Tokyo Tech) PRMU2007-237 |
To determine the performance of estimating the degree of
``strength of belief'' (SOB) of responses using eye-movements... [more] |
PRMU2007-237 pp.131-136 |
MBE, NC (Joint) |
2007-12-22 09:50 |
Aichi |
|
Optimizing SVR Hyperparameters via Fast Cross-Validation Masayuki Karasuyama, Ryohei Nakano (Nagoya Inst. of Tech.) NC2007-73 |
The performance of Support Vector Regression (SVR) deeply depends on its hyperparameters such as an insensitive zone thi... [more] |
NC2007-73 pp.13-18 |