Hiroyuki Hanada

Orcid: 0000-0002-2139-3857

According to our database1, Hiroyuki Hanada authored at least 18 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Distributionally Robust Safe Sample Screening.
CoRR, 2024

Distributionally Robust Safe Screening.
CoRR, 2024

Bounding Box-based Multi-objective Bayesian Optimization of Risk Measures under Input Uncertainty.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Efficient model selection for predictive pattern mining model by safe pattern pruning.
Patterns, December, 2023

Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modifications.
Neural Comput., December, 2023

Safe RuleFit: Learning Optimal Sparse Rule Model by Meta Safe Screening.
IEEE Trans. Pattern Anal. Mach. Intell., 2023

2022
Stat-DSM: Statistically Discriminative Sub-Trajectory Mining With Multiple Testing Correction.
IEEE Trans. Knowl. Data Eng., 2022

Fast and More Powerful Selective Inference for Sparse High-Order Interaction Model.
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.
CoRR, 2020

2018
Learning sparse optimal rule fit by safe screening.
CoRR, 2018

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

Efficiently Monitoring Small Data Modification Effect for Large-Scale Learning in Changing Environment.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
On Practical Accuracy of Edit Distance Approximation Algorithms.
CoRR, 2017

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

Secure Approximation Guarantee for Cryptographically Private Empirical Risk Minimization.
Proceedings of The 8th Asian Conference on Machine Learning, 2016

2015
Enumerating Eulerian Trails via Hamiltonian Path Enumeration.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014
Average-case linear-time similar substring searching by the q-gram distance.
Theor. Comput. Sci., 2014

2011
A practical comparison of edit distance approximation algorithms.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011


  Loading...