Hiroyuki Hanada

According to our database, Hiroyuki Hanada authored at least 15 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Efficient model selection for predictive pattern mining model by safe pattern pruning.

Takumi Yoshida, Hiroyuki Hanada, Kazuya Nakagawa, Kouichi Taji, Koji Tsuda, Ichiro Takeuchi

Patterns, December, 2023

Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modifications.

Hiroyuki Hanada, Noriaki Hashimoto, Kouichi Taji, Ichiro Takeuchi

Neural Comput., December, 2023

Safe RuleFit: Learning Optimal Sparse Rule Model by Meta Safe Screening.

Hiroki Kato, Hiroyuki Hanada, Ichiro Takeuchi

IEEE Trans. Pattern Anal. Mach. Intell., 2023

2022

Stat-DSM: Statistically Discriminative Sub-Trajectory Mining With Multiple Testing Correction.

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., 2022

Fast and More Powerful Selective Inference for Sparse High-Order Interaction Model.

Diptesh Das, Vo Nguyen Le Duy, Hiroyuki Hanada, Koji Tsuda, Ichiro Takeuchi

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2020

Supervised sequential pattern mining of event sequences in sport to identify important patterns of play: an application to rugby union.

Rory P. Bunker, Keisuke Fujii, Hiroyuki Hanada, Ichiro Takeuchi

CoRR, 2020

2018

Learning sparse optimal rule fit by safe screening.

Hiroki Kato, Hiroyuki Hanada, Ichiro Takeuchi

CoRR, 2018

Interval-based Prediction Uncertainty Bound Computation in Learning with Missing Values.

Hiroyuki Hanada, Toshiyuki Takada, Jun Sakuma, Ichiro Takeuchi

CoRR, 2018

Efficiently Monitoring Small Data Modification Effect for Large-Scale Learning in Changing Environment.

Hiroyuki Hanada, Atsushi Shibagaki, Jun Sakuma, Ichiro Takeuchi

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

On Practical Accuracy of Edit Distance Approximation Algorithms.

Hiroyuki Hanada, Mineichi Kudo, Atsuyoshi Nakamura

CoRR, 2017

2016

Efficiently Bounding Optimal Solutions after Small Data Modification in Large-Scale Empirical Risk Minimization.

Hiroyuki Hanada, Atsushi Shibagaki, Jun Sakuma, Ichiro Takeuchi

CoRR, 2016

Secure Approximation Guarantee for Cryptographically Private Empirical Risk Minimization.

Toshiyuki Takada, Hiroyuki Hanada, Yoshiji Yamada, Jun Sakuma, Ichiro Takeuchi

Proceedings of The 8th Asian Conference on Machine Learning, 2016

2015

Enumerating Eulerian Trails via Hamiltonian Path Enumeration.

Hiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, Shin-ichi Minato

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

Average-case linear-time similar substring searching by the q-gram distance.

Hiroyuki Hanada, Mineichi Kudo, Atsuyoshi Nakamura

Theor. Comput. Sci., 2014

2011

A practical comparison of edit distance approximation algorithms.

Hiroyuki Hanada, Atsuyoshi Nakamura, Mineichi Kudo

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011