Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IBISML |
2018-11-05 15:10 |
Hokkaido |
Hokkaido Citizens Activites Center (Kaderu 2.7) |
[Poster Presentation]
Algorithms for Checking Existence of a Bad Arm Utilizing Asymmetry Koji Tabata, Atsuyoshi Nakamura, Tamiki Komatsuzaki (Hokkaido Univ.) IBISML2018-91 |
We study a problem called a bad arm existence checking problem in which, given two thresholds $theta_L$ and $theta_U$ ($... [more] |
IBISML2018-91 pp.353-360 |
HCGSYMPO (2nd) |
2017-12-13 - 2017-12-15 |
Ishikawa |
THE KANAZAWA THEATRE |
Development of emotional expression mechanism SHIPPO in hearing assistance dog robot Yuji Kameda, Daisuke Katagami (Tokyo Polytechnic Univ.), Tsuyoshi Nakamura (Nagoya Industry Univ.), Yoichi Yamazaki (Kanagawa Institute of Technology Univ.) |
In this study, we develop an emotional expression system adopt a tail system and the movements for a hearing assistance ... [more] |
|
IBISML |
2017-11-10 13:00 |
Tokyo |
Univ. of Tokyo |
Good Arm Identification via Bandit Feedback Hideaki Kano, Junya Honda (UTokyo/RIKEN), Kentaro Sakamaki (UTokyo), Kentaro Matsuura (Johnson & Johnson), Atsuyoshi Nakamura (HU), Masashi Sugiyama (RIKEN/UTokyo) IBISML2017-82 |
In this paper, we consider and discuss a new stochastic multi-armed bandit problem called {em good arm identification} (... [more] |
IBISML2017-82 pp.339-346 |
NC, IPSJ-BIO, IBISML, IPSJ-MPS [detail] |
2017-06-24 09:55 |
Okinawa |
Okinawa Institute of Science and Technology |
Algorithms for Bad Arm Existence Checking Problem Atsuyoshi Nakamura (Hokkaido Univ.) IBISML2017-2 |
We study a bad arm existence checking problem, in which a solver algorithm must judge whether
an arm with an expected... [more] |
IBISML2017-2 pp.49-54 |
AI |
2016-06-27 13:00 |
Tokyo |
|
Proposal of Behavior Model for Hearing-Dog Robot Hoshito Kudo, Tsuyoshi Nakamura (NIT), Masayoshi Kanoh (Chukyo Univ.), Kouji Yamada (IAMAS) AI2016-4 |
Hearing dogs play a role of assisting hearing-impaired people. The touch of the dog to the people can alert the people t... [more] |
AI2016-4 pp.19-23 |
WIT, HI-SIGACI |
2015-12-09 14:00 |
Tokyo |
AIST Tokyo Waterfront |
Assistance for Urgent Notification using Hearing-dog Robot AcToR Michihiko Furuhashi, Tsuyoshi Nakamura (NIT), Masayoshi Kanoh (Chukyo Univ.), Kouji Yamada (IAMAS) WIT2015-79 |
We proposed the robot which was inspired by the behavior of hearing dogs. A hearing dog is a type of dog assist hearing-... [more] |
WIT2015-79 pp.103-107 |
IBISML |
2015-11-27 14:00 |
Ibaraki |
Epochal Tsukuba |
[Poster Presentation]
Extended KL-UCB Policy for the Budgeted Multi-Armed Bandits Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) IBISML2015-75 |
[more] |
IBISML2015-75 pp.167-174 |
NC, IPSJ-BIO, IBISML, IPSJ-MPS (Joint) [detail] |
2015-06-23 15:45 |
Okinawa |
Okinawa Institute of Science and Technology |
A Bridge between Hedge and Exp3 Algorithms Atsuyoshi Nakamura (Hokkaido Univ.) IBISML2015-13 |
Hedge is an online learning algorithm that draws an expert according to a probability distribution which depends on the ... [more] |
IBISML2015-13 pp.81-86 |
COMP |
2013-09-03 10:45 |
Tottori |
|
A New UCB-based Algorithm for the Matching-Selection Multi-armed Bandit Problem Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) COMP2013-26 |
Permutation bandit problem is a kind of combinatorial multi-armed bandit problem in which an $M$-permutation of $N$ elem... [more] |
COMP2013-26 pp.9-16 |
COMP |
2011-10-21 10:35 |
Miyagi |
Tohoku Univ. |
Fast Algorithm for Finding a Graph Node with High Closeness Centrality Koji Tabata, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) COMP2011-29 |
The Closeness Centrality is one of centrality measures of a node in a graph.
It is calculated as the reciprocal of the ... [more] |
COMP2011-29 pp.7-14 |
IBISML |
2010-11-04 15:00 |
Tokyo |
IIS, Univ. of Tokyo |
[Poster Presentation]
Efficient Implementation of Greedy Cover Learning by Hyper-Rectangles and Its Classification Performance Evaluation Using Real Data Koji Ouchi, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) IBISML2010-72 |
Blumer et al. showed that
the class of concepts represented by finite unions
of hyper-rectangles
in $d$-dimensional ... [more] |
IBISML2010-72 pp.99-104 |
PRMU |
2009-10-23 15:20 |
Hiroshima |
Hiroshima Univ. |
Image Rendering of Color Textured Object Using Self-Calibration and Neural Network Learning Yi Ding (Nagoya Inst. of Tech.), Yuji Iwahori (Chubu Univ.), Tsuyoshi Nakamura (Nagoya Inst. of Tech.), Lifeng He (Aichi Pref. Univ.), Hidenori Itoh (Nagoya Inst. of Tech.) PRMU2009-91 |
This paper describes a new approach for self-calibration and color image rendering using radial basis function (RBF) neu... [more] |
PRMU2009-91 pp.115-120 |
COMP |
2009-09-14 13:00 |
Tottori |
Tottori University of Environmental Studies |
Adversarial Bandit Problems with Multiple Plays Taishi Uchiya, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaidou Univ.) COMP2009-27 |
[more] |
COMP2009-27 pp.13-20 |
PRMU |
2008-12-18 11:15 |
Kumamoto |
Kumamoto Univ. |
Classifier selection in a family of polyhedron classifiers Tetsuji Takahashi, Mineichi Kudo, Atsuyoshi Nakamura (Hokkaido Univ.) PRMU2008-153 |
It is an efficient way to approximate a class region by convex hulls of
samples. However, the convex hull is computat... [more] |
PRMU2008-153 pp.37-41 |
PRMU |
2008-12-19 13:45 |
Kumamoto |
Kumamoto Univ. |
On effect of balancing investment in nonstochastic multi-armed bandit problems Taishi Uchiya, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaidou Univ.) PRMU2008-183 |
[more] |
PRMU2008-183 pp.213-218 |
COMP |
2008-10-10 09:30 |
Miyagi |
Tohoku Univ. |
Packing Alignment and Its Application to Music Mining Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) COMP2008-35 |
We propose packing alignment as an alignment for sequences of lengthened symbols like musical notes.
Furthermore, we co... [more] |
COMP2008-35 pp.9-16 |
COMP |
2007-09-20 14:25 |
Aichi |
|
Complexity and Enumeration of Subclasses Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) COMP2007-37 |
[more] |
COMP2007-37 pp.35-42 |
PRMU, DE |
2007-06-28 11:00 |
Hokkaido |
Hokkaido Univ. |
Finding of Frequent Similar Subtrees in Tree-Structured Data Hisashi Tosaka, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) DE2007-2 PRMU2007-28 |
We study a novel problem of mining subtrees with frequent occurrence of
similar subtrees, and propose an efficient algo... [more] |
DE2007-2 PRMU2007-28 pp.7-12 |
SIP, WBS |
2006-07-21 11:50 |
Niigata |
Nagaoka Univ. of Tech. |
Generation of the Binary Chaotic Signal using Chaotic Neurons and its Application Tsuyoshi Nakamura, Akihiro Fujii, Hiroyuki Irikura, Hiroyuki Kamata (Meiji Univ.) |
[more] |
SIP2006-59 WBS2006-23 pp.31-36 |
COMP |
2005-09-15 16:35 |
Osaka |
Osaka Univ., Toyonaka Campus |
How Easy to Learn Linear Ranking Functions Atsuyoshi Nakamura (Hokkaido Univ.) |
In this paper, we study how easy to learn the class of {\em linear ranking functions}
from $n$-dimensional Euclidean sp... [more] |
COMP2005-35 pp.49-53 |