IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 28  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2024-05-08
15:05
Kyoto Kyoto University (Rakuyu-kaikan) An Algorithm for Finding the Condorcet Winner Die
Ro Sho, Hatano Kohei (Kyushu Univ.), Kijima Shuji (Shiga Univ.), Takimoto Eiji (Kyushu Univ.)
 [more]
NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] 2022-06-28
17:20
Okinawa
(Primary: On-site, Secondary: Online)
Reduction Scheme for Empirical Risk Minimization and Its Applications to Multiple-Instance Learning
Daiki Suehiro (Kyushu Univ./RIKEN AIP), Eiji Takimoto (Kyushu Univ.) NC2022-24 IBISML2022-24
 [more] NC2022-24 IBISML2022-24
pp.170-177
IBISML 2020-03-11
14:35
Kyoto Kyoto University
(Cancelled but technical report was issued)
IBISML2019-47  [more] IBISML2019-47
pp.95-100
IBISML 2019-03-06
11:00
Tokyo RIKEN AIP Shapelet-based Multiple-Instance Learning
Daiki Suehiro, Kohei Hatano (Kyushu Univ./RIKEN AIP), Eiji Takimoto (Kyushu Univ.), Shuji Yamamoto, Kenichi Bannai (Keio Univ./RIKEN AIP), Akiko Takeda (The Univ. of Tokyo/RIKEN AIP) IBISML2018-112
 [more] IBISML2018-112
pp.51-58
IBISML 2017-11-10
13:00
Tokyo Univ. of Tokyo IBISML2017-85 We consider binary classification problems using local features of objects. One of motivating applications is time-serie... [more] IBISML2017-85
pp.361-368
IBISML 2017-03-06
13:30
Tokyo Tokyo Institute of Technology Tighter generalization bounds for matrix completion based on non-negative matrix factorization with norm constraints
Ken-ichiro Moridomi, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2016-100
 [more] IBISML2016-100
pp.1-8
NC, IPSJ-BIO, IBISML, IPSJ-MPS [detail] 2016-07-06
13:25
Okinawa Okinawa Institute of Science and Technology Bandit Algorithm For k-Sets Based On Projection And Decomposition
Ryohei Nagaura, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2016-7
(To be available after the conference date) [more] IBISML2016-7
pp.225-229
IBISML 2016-03-17
13:00
Tokyo Institute of Statistical Mathematics Collaborative ranking based on relative preference
Ken-ichiro Moridomi, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2015-94
We consider a collaborative filtering problem with pairwise preference information. In this setting, the algorithm recei... [more] IBISML2015-94
pp.1-8
NC, IPSJ-BIO, IBISML, IPSJ-MPS
(Joint) [detail]
2015-06-25
09:30
Okinawa Okinawa Institute of Science and Technology Online Density Estimation of Bradley-Terry Models
Issei Matsumoto (Toyota), Kohei Hatano, Eiji Takimoto (Kyushu U.) IBISML2015-21
We consider an online density estimation problem for Bradley-Terry models that determine the probability of a match resu... [more] IBISML2015-21
pp.173-180
IBISML 2014-03-07
10:05
Nara Nara Women's University Online Prediction with Bradley-Terry Models and Logistic Models
Issei Matsumoto, Kohei Hatano, Eiji Takimoto (Kyushu Univ) IBISML2013-74
We consider an online density estimation problem under the Bradley-Terry model which determines the probability of the o... [more] IBISML2013-74
pp.55-62
IBISML 2014-03-07
10:30
Nara Nara Women's University Online Matrix Prediction with Log-Determinant Regularizer
Kenichiro Moridomi, Kohei Hatano, Eiji Takimoto (Kyushu Univ.), Koji Tsuda (AIST) IBISML2013-75
We consider an online symmetric positive semi-definite matrix prediction problem with convex loss function and Frobenius... [more] IBISML2013-75
pp.63-70
IBISML 2013-03-04
14:15
Aichi Nagoya Institute of Technology Passive-Aggressive Algorithm with Bias
Daigo Tateishi, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2012-93
We consider online binary classi cation problems by using linear classi ers. Among online learning
algorithms for linea... [more]
IBISML2012-93
pp.1-8
IBISML 2012-11-08
15:00
Tokyo Bunkyo School Building, Tokyo Campus, Tsukuba Univ. Efficient AUC Maximization by Approximate Reduction of Ranking SVMs
Daiki Suehiro, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2012-68
 [more] IBISML2012-68
pp.243-249
IBISML 2012-06-19
11:00
Kyoto Campus plaza Kyoto Online Prediction under Submodular Constraints
Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto (Kyushu Univ.), Kiyohito Nagano (Tokyo Univ.) IBISML2012-3
 [more] IBISML2012-3
pp.15-22
IBISML 2011-11-09
15:45
Nara Nara Womens Univ. Approximate Reduction from AUC Maximization to 1-norm Soft Margin Optimization
Daiki Suehiro, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2011-48
Finding linear classifi ers that maximize AUC scores is important in ranking research. This is naturally
formulated as ... [more]
IBISML2011-48
pp.39-46
COMP, IPSJ-AL 2011-09-06
15:40
Hokkaido Hakodate City Central Library Lower Bounds for Linear Decision Trees via An Energy Complexity Argument
Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.) COMP2011-26
A linear decision tree is a binary decision tree in which
a classification rule at each internal node is defined by
a ... [more]
COMP2011-26
pp.67-73
IBISML 2010-11-04
15:00
Tokyo IIS, Univ. of Tokyo [Poster Presentation] Learning Evaluation Functions for Shogi Using SVM-based Bipartite Ranking Learning
Daiki Suehiro, Kohei Hatano, Hideo Bannai, Eiji Takimoto, Masayuki Takeda (Kyushu Univ.) IBISML2010-74
Recently, automatic optimization of parameters by applying machine learning methods has become a mainstream approach for... [more] IBISML2010-74
pp.113-118
COMP 2010-01-25
16:10
Fukuoka Nishijin Plaza, Kyushu University Size-Energy Tradeoff of Unate Circuits Computing Symmetric Functions
Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Takao Nishizeki (Tohoku Univ.) COMP2009-47
A unate gate is a logical gate computing a unate Boolean function.
Examples of unate gates are
AND-gates, OR-gates, NO... [more]
COMP2009-47
pp.57-64
COMP 2009-03-02
09:10
Tokyo Tokyo Institute of Technology Generating NPN-representatives of a Set of Optimal Boolean Formulas
Hideaki Fukuhara (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Kazuyuki Amano (Gunma Univ.) COMP2008-54
For $k$ variable function $h$ and $k$ functions
$g_1, \ldots, g_k$, $f = h \circ (g_1, \ldots, g_k)$denotes
a composit... [more]
COMP2008-54
pp.1-8
COMP 2008-10-10
14:00
Miyagi Tohoku Univ. Lower bounds on quantum query complexity for decision trees
Hideaki Fukuhara (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.) COMP2008-40
 [more] COMP2008-40
pp.47-54
 Results 1 - 20 of 28  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan