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.
? Tutorial for this page

Hiroki Toda

dblp:241/7069 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-1596-4131ORCID · corroborated

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

Artificial intelligence and machine learning · 3Databases, data management, data science and information retrieval · 3 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
2 papers
Generative modeling · 25% Probabilistic and Bayesian machine learning · 25% Learning theory · 25%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 77% Spatial and temporal data management · 23%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
pattern mining
0.612022
Stat-DSM: Statistically Discriminative Sub-Trajectory Mining With Multiple Testing Correction · IEEE Trans. Knowl. Data Eng. 2022
Machine learning › Time series and sequential data
change-point detection
0.412020
Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming · NeurIPS 2020
Machine learning › Generative modeling › molecular generation
molecular graph generation
0.412020
Molecular Inverse-Design Platform for Material Industries · KDD 2020
Machine learning › Learning theory › hypothesis testing
selective inference
0.412020
Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning
statistical inference
0.412020
Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming · NeurIPS 2020
Computational science and engineering › materials informatics
inverse molecular design
0.412020
Molecular Inverse-Design Platform for Material Industries · KDD 2020
Computational science and engineering › materials science
materials discovery
0.412020
Molecular Inverse-Design Platform for Material Industries · KDD 2020
Algorithms and data structures
dynamic programming
0.412020
Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming · NeurIPS 2020
Spatial and temporal data management
trajectory data
0.212022
Stat-DSM: Statistically Discriminative Sub-Trajectory Mining With Multiple Testing Correction · IEEE Trans. Knowl. Data Eng. 2022

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

substructure-based feature encoding · 0.9selective inference · 0.9hypothesis testing · 0.9graph generation · 0.9dynamic programming · 0.9tree representation · 0.6permutation-based statistical inference · 0.6
YearPublicationVenuePosition
2022 Stat-DSM: Statistically Discriminative Sub-Trajectory Mining With Multiple Testing Correction
abstract
We propose a novelstatistical approachto evaluate thestatistical significance(reliability) of the results from discriminative sub-trajectory mining, which we callStatistically Discriminative Sub-trajectory Mining (Stat-DSM). Given two groups of trajectories, the goal of Stat-DSM is to extract moving patterns in the form of sub-trajectories that occur statistically significantly more often in one group than in the other. An advantage of the proposed method is that the statistical significance of the extracted sub-trajectories are properly controlled in the sense that the probability of finding a falsely discriminative sub-trajectory is smaller than a specified significance threshold$\alpha$(e.g., 0.05), which is crucial when the method is used in scientific or social science studies under noisy environments. Finding such statistically discriminative sub-trajectories from a massive trajectory dataset is both computationally and statistically challenging. In the Stat-DSM method, we address these difficulties by introducing a tree representation of sub-trajectories, and applying an efficient permutation-based statistical inference method to the tree. To the best of our knowledge, Stat-DSM is the first method that provides a statistical approach to quantify the reliability of discriminative sub-trajectory mining results. We illustrate the effectiveness and scalability of the Stat-DSM method by applying it to a real-world dataset containing 1,000,000 trajectories.
Vo Nguyen Le Duy, Takuto Sakuma, Taiju Ishiyama, Hiroki Toda, Kazuya Arai, Masayuki Karasuyama, Yuta Okubo, Masayuki Sunaga, Hiroyuki Hanada, Yasuo Tabei, Ichiro Takeuchi
IEEE Trans. Knowl. Data Eng.4
2020 Molecular Inverse-Design Platform for Material Industries
abstract
The discovery of new materials has been the essential force which brings a discontinuous improvement to industrial products' performance. However, the extra-vast combinatorial design space of material structures exceeds human experts' capability to explore all, thereby hampering material development. In this paper, we present a material industry-oriented web platform of an AI-driven molecular inverse-design system, which automatically designs brand new molecular structures rapidly and diversely. Different from existing inverse-design solutions, in this system, the combination of substructure-based feature encoding and molecular graph generation algorithms allows a user to gain high-speed, interpretable, and customizable design process. Also, a hierarchical data structure and user-oriented UI provide a flexible and intuitive workflow. The system is deployed on IBM's and our client's cloud servers and has been used by 5 partner companies. To illustrate actual industrial use cases, we exhibit inverse-design of sugar and dye molecules, that were carried out by experimental chemists in those client companies. Compared to a general human chemist's standard performance, the molecular design speed was accelerated more than 10 times, and greatly increased variety was observed in the inverse-designed molecules without loss of chemical realism.
Seiji Takeda, Toshiyuki Hama, Hsiang-Han Hsu, Victoria A. Piunova, Dmitry Zubarev, Dan Sanders 0002, Jed W. Pitera, Makoto Kogoh, Takumi Hongo, Yenwei Cheng, Wolf Bocanett, Hideaki Nakashika, Akihiro Fujita, Yuta Tsuchiya, Katsuhiko Hino, Kentaro Yano, Shuichi Hirose, Hiroki Toda, Yasumitsu Orii, Daiju Nakano
KDD18
2020 Computing Valid p-value for Optimal Changepoint by Selective Inference using Dynamic Programming
abstract
Although there is a vast body of literature related to methods for detecting change-points (CPs), less attention has been paid to assessing the statistical reliability of the detected CPs. In this paper, we introduce a novel method to perform statistical inference on the significance of the CPs, estimated by a Dynamic Programming (DP)-based optimal CP detection algorithm. Our main idea is to employ a Selective Inference (SI) approach---a new statistical inference framework that has recently received a lot of attention---to compute exact (non-asymptotic) valid p-values for the detected optimal CPs. Although it is well-known that SI has low statistical power because of over-conditioning, we address this drawback by introducing a novel method called parametric DP, which enables SI to be conducted with the minimum amount of conditioning, leading to high statistical power. We conduct experiments on both synthetic and real-world datasets, through which we offer evidence that our proposed method is more powerful than existing methods, has decent performance in terms of computational efficiency, and provides good results in many practical applications.
Vo Nguyen Le Duy, Hiroki Toda, Ryota Sugiyama, Ichiro Takeuchi
NeurIPS2
2019 Statistically Discriminative Sub-trajectory Mining with Multiple Testing Correction
abstract
We propose a novel statistical approach to evaluate the statistical significance (reliability) of the findings in the discriminative sub-trajectory mining problem, called Statistically Discriminative Sub-trajectory Mining (Stat-DSM). Given two groups of trajectories, the goal is to extract moving patterns in the form of sub-trajectories that occur statistically significantly more often in one group than in the other. An advantage of the Stat-DSM method is that the statistical significance of the extracted sub-trajectories are properly controlled in the sense that the probability of finding a false discriminative sub-trajectory is smaller than a specified significance threshold a (e.g., 0.05). We conduct experiments on real-world datasets to demonstrate the effectiveness of the Stat-DSM method.
Vo Nguyen Le Duy, Takuto Sakuma, Taiju Ishiyama, Hiroki Toda, Kazuya Arai, Masayuki Karasuyama, Yuta Okubo, Masayuki Sunaga, Yasuo Tabei, Ichiro Takeuchi
SIGSPATIAL/GIS4