Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Nobuo Suematsu

dblp:21/6426 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorSecurity and privacy · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Reinforcement learning · 68% Kernel, tree and ensemble methods · 16% Planning, search and constraint satisfaction · 16%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
partially observable reinforcement learning
0.021998
A Reinforcement Learning Algorithm in Partially Observable Environments Using Short-Term Memory · NIPS 1998
Viewing Classifier Systems as Model Free Learning in POMDPs · NIPS 1998
Machine learning › Kernel, tree and ensemble methods
classifier systems
0.011998
Viewing Classifier Systems as Model Free Learning in POMDPs · NIPS 1998
Machine learning › Reinforcement learning › partially observable reinforcement learning
memory-based reinforcement learning
0.011998
A Reinforcement Learning Algorithm in Partially Observable Environments Using Short-Term Memory · NIPS 1998
Machine learning › Reinforcement learning
model-free reinforcement learning
0.011998
Viewing Classifier Systems as Model Free Learning in POMDPs · NIPS 1998
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable markov decision process
0.011998
Viewing Classifier Systems as Model Free Learning in POMDPs · NIPS 1998

Methods — techniques the papers use, named apart from their topics

short-term memory · 0.0classifier systems · 0.0bayesian inference · 0.0
YearPublicationVenuePosition
2018 Typical Performance of Sparse Signal Recovery from a Linear Measurement with Large Coherence
abstract
We discuss typical `potential' performance of sparse signal recovery in the case where iterative recovery algorithms fail to converge. We especially focus on sparse signal recovery from a linear measurement whose measurement matrix has large coherence and evaluate the mean square error of the estimate in such a case by using the statistical mechanical method. It can be considered that this kind of analysis gives a theoretical limit for iterative sparse recovery algorithms. When coherence of the measurement matrix is large, the mean square error between an original signal to be estimated and its estimate tends not to depend on the compression rate.
Minori Ihara, Kazunori Iwata 0001, Nobuo Suematsu, Kazushi Mimura
ISITA3
2013 Marginalized Viterbi algorithm for hierarchical hidden Markov models
Akira Hayashi, Kazunori Iwata 0002, Nobuo Suematsu
Pattern Recognit.3
2012 Time series alignment with Gaussian processes
Nobuo Suematsu, Akira Hayashi
ICPR1
2007 Component Reduction for Hierarchical Mixture Model Construction
Kumiko Maebashi, Nobuo Suematsu, Akira Hayashi
ICONIP (2)2
2006 View Independent Gait Identification Using a Particle Filter
abstract
We challenge the human identification problem from the perspective of gait and body shape. Conventional methods depend on the camera viewing direction, and since they are based on matching image silhouettes or features their identification accuracy is low when there is a big difference between the camera viewing direction of the test and training data. Thus, if a person is walking in an arbitrary direction, they may not be accurately identified. In this paper, we propose a novel method that does not depend on the camera viewing direction. We develop a state space model called a "cyclic motion model" whose state variables are not only the phase of the motions but also the camera viewing direction. We learn model parameters for each candidate person, and represent their walking with the cyclic motion model. To identify a person from the observed image sequence, we first compute the model likelihoods for the sequence using a particle filter that represents a probability distribution by a set of weighted samples, We then identify the person from model likelihoods.
Mitsuharu Emoto, Akira Hayashi, Nobuo Suematsu, Kazunori Iwata 0001
AVSS3
1998 Viewing Classifier Systems as Model Free Learning in POMDPs
Akira Hayashi, Nobuo Suematsu
NIPS2
1998 A Reinforcement Learning Algorithm in Partially Observable Environments Using Short-Term Memory
Nobuo Suematsu, Akira Hayashi
NIPS1
1997 A Bayesian Approach to Model Learning in Non-Markovian Environments
Nobuo Suematsu, Akira Hayashi, Shigang Li 0001
ICML1