Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IBISML |
2016-03-18 11:05 |
Tokyo |
Institute of Statistical Mathematics |
Block-sparse Extensions of Recovery Conditions of Overcomplete Dictionaries Yasushi Terazono, Kenji Yamanishi (UTokyo) IBISML2015-101 |
In overcomplete dictionary learning problems, observed data are modeled as products of overcomplete dictionaries and spa... [more] |
IBISML2015-101 pp.55-58 |
IBISML |
2013-11-12 15:45 |
Tokyo |
Tokyo Institute of Technology, Kuramae-Kaikan |
[Poster Presentation]
The Method to Extract Latent Skills from Time Series Examination Results with Matrix Factorization Shinichi Oeda, Eriko Amano (KNCT), Kenji Yamanishi (Univ. of Tokyo) IBISML2013-52 |
Examination results are used to judge whether an student possesses desired latent skills. In order to grasp the skills, ... [more] |
IBISML2013-52 pp.123-130 |
PRMU, IBISML, IPSJ-CVIM (Joint) [detail] |
2012-09-02 10:30 |
Tokyo |
|
Detecting Changes of Graph Partitioning Structures using Stochastic Decision Trees Shoichi Sato, Kenji Yamanishi (Univ. of Tokyo) PRMU2012-31 IBISML2012-14 |
We are concerned with the issue of estimating graph partitioning structures
from time series and tracking their changes... [more] |
PRMU2012-31 IBISML2012-14 pp.9-16 |
IBISML |
2012-06-19 - 2012-06-20 |
Kyoto |
Campus plaza Kyoto |
Detecting changes of graph partitioning structures Shoichi Sato, Kenji Yamanishi (Univ. of Tokyo) |
We are concerned with the issue of estimating graph partitioning structures
from time series and tracking their changes... [more] |
|
IBISML |
2012-06-20 14:50 |
Kyoto |
Campus plaza Kyoto |
An MDL-based Change-Detection Algorithm for Piecewise Stationay Memoryless Sources with Multi-dimensional Parameter Hiroki Kanazawa, Kenji Yamanishi (Univ. of Tokyo) IBISML2012-9 |
Kleinberg has proposed an algorithm for detecting bursts from a data sequence, which has turned out to be effective in t... [more] |
IBISML2012-9 pp.57-64 |
IBISML |
2012-03-12 10:50 |
Tokyo |
The Institute of Statistical Mathematics |
Detecting Latent Structural Changes via Latent Dirichlet Allocation Masashi Ueda, Ryota Tomioka, Kenji Yamanishi (The Univ. of Tokyo), Katsuhiko Ishiguro, Hiroshi Sawada, Naonori Ueda (NTT) IBISML2011-89 |
Detecting changes in consumers' latent preference is a fundamental challenge for improving recommendation systems as wel... [more] |
IBISML2011-89 pp.15-20 |
IBISML |
2012-03-12 17:20 |
Tokyo |
The Institute of Statistical Mathematics |
Detecting Long-term Trending Topics in Social Networks Shota Saito, Ryota Tomioka, Kenji Yamanishi (The Univ. of Tokyo) IBISML2011-98 |
In social networking services (SNSs), long-term trending topics are extremely rare and valuable. In this paper, we propo... [more] |
IBISML2011-98 pp.77-84 |
PRMU, SP |
2012-02-10 11:10 |
Miyagi |
|
[Invited Talk]
Kenji Yamanishi (Univ. of Tokyo) PRMU2011-228 SP2011-143 |
[more] |
PRMU2011-228 SP2011-143 p.191 |
IBISML |
2011-11-09 15:45 |
Nara |
Nara Womens Univ. |
Detecting Changes of Clustering Structures using Renormalized Maximum Likelihood Coding So Hirai, Kenji Yamanishi (Univ. of Tokyo) IBISML2011-62 |
Suppose that we sequentially observe multi-dimensional data sets, which are non-stationary. We are concerned with the i... [more] |
IBISML2011-62 pp.135-142 |
IBISML |
2011-11-10 15:45 |
Nara |
Nara Womens Univ. |
Dynamic model selection with resetting distributions Eiichi Sakurai (AIST), Kenji Yamanishi (The Univ. of Tokyo) IBISML2011-66 |
We are concerned with the issue of tracking changes of statistical models (e.g. the number of parameters, a discrete mod... [more] |
IBISML2011-66 pp.163-168 |
IBISML |
2011-11-10 15:45 |
Nara |
Nara Womens Univ. |
Sequential Network Change Detection with Its Applications to Advertisement Impact Relation Analysis Yu Hayashi, Kenji Yamanishi (Univ. of Tokyo.) IBISML2011-71 |
This paper addresses the issue of network change detection from non-stationary time series data. We employ as a represen... [more] |
IBISML2011-71 pp.199-206 |
IBISML |
2011-06-20 14:30 |
Tokyo |
Takeda Hall |
Network Change Detection with Its Applications to Advertisement Impact Relation Analysis Yu Hayashi, Kenji Yamanishi (Univ. of Tokyo.) IBISML2011-9 |
This paper addresses the issue of network change detection with its applications to advertisement impact relation analys... [more] |
IBISML2011-9 pp.59-66 |
IBISML |
2011-06-20 16:15 |
Tokyo |
Takeda Hall |
Efficient Computation of Re-Normalized Maximum Likelihood Coding for Gaussian Mixtures with Its Applications to Optimal Clustering So Hirai, Kenji Yamanishi (Univ. of Tokyo) IBISML2011-5 |
We are concerned with the issue of efficient computation of re-normalized maximum likelihood (RNML) code-lengths for Gau... [more] |
IBISML2011-5 pp.29-35 |
IBISML |
2011-03-29 11:40 |
Osaka |
Nakanoshima Center, Osaka Univ. |
Topic Emergence Detection in Social Networks Using Probabilistic Models of Links Toshimitsu Takahashi, Ryota Tomioka, Kenji Yamanishi (The Univ. of Tokyo) IBISML2010-128 |
Detection of emerging topics from social network streams is becoming increasingly important these days. Conventional app... [more] |
IBISML2010-128 pp.169-176 |
IT |
2010-11-30 14:30 |
Nagano |
|
[Invited Talk]
Recent Advances in Information-Theoretic Learning Theory
-- Tracking Latent Dynamics -- Kenji Yamanishi (Univ. of Tokyo) IT2010-51 |
This paper addresses the issue of detecting changes of latent strucures behind data.The theory of probabilsitic models w... [more] |
IT2010-51 pp.1-8 |
IBISML |
2010-11-05 15:30 |
Tokyo |
IIS, Univ. of Tokyo |
[Poster Presentation]
Efficient Computation of Normalized Maximum Likelihood Coding for Gaussian Mixtures with Its Applications to Model Selection So Hirai, Kenji Yamanishi (Tokyo Univ.) IBISML2010-103 |
We are concerned with the issue of efficient computation of normalized maximum likelihood (NML) code-lengths for Gaussia... [more] |
IBISML2010-103 pp.327-333 |
IBISML |
2010-06-15 16:45 |
Tokyo |
Takeda Hall, Univ. Tokyo |
A linear time algorithm for sequential dynamic model selection Eiichi Sakurai, Kenji Yamanishi (Univ. of Tokyo.) IBISML2010-25 |
This paper addresses the issue of dynamic model selection (DMS), in which the goal is to select an optimal model sequenc... [more] |
IBISML2010-25 pp.175-180 |
IBISML |
2010-06-15 17:15 |
Tokyo |
Takeda Hall, Univ. Tokyo |
Graph Clustering based on Normalized Maximum Likelihood Coding So Hirai, Ryota Tomioka, Kenji Yamanishi (Univ. of Tokyo) IBISML2010-27 |
This paper addresses the issue of graph clustering, i.e., assigning nodes for a given graph into a number of clusters, i... [more] |
IBISML2010-27 pp.189-195 |