default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroyuki Hanada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Yu Inatsu, Shion Takeno, Hiroyuki Hanada, Kazuki Iwata, Ichiro Takeuchi:
Bounding Box-based Multi-objective Bayesian Optimization of Risk Measures under Input Uncertainty. AISTATS 2024: 4564-4572- [i11]Hiroyuki Hanada, Satoshi Akahane, Tatsuya Aoyama, Tomonari Tanaka, Yoshito Okura, Yu Inatsu, Noriaki Hashimoto, Taro Murayama, Lee Hanju, Shinya Kojima, Ichiro Takeuchi:
Distributionally Robust Safe Screening. CoRR abs/2404.16328 (2024) - [i10]Hiroyuki Hanada, Tatsuya Aoyama, Satoshi Akahane, Tomonari Tanaka, Yoshito Okura, Yu Inatsu, Noriaki Hashimoto, Shion Takeno, Taro Murayama, Lee Hanju, Shinya Kojima, Ichiro Takeuchi:
Distributionally Robust Safe Sample Screening. CoRR abs/2406.05964 (2024) - 2023
- [j5]Hiroyuki Hanada, Noriaki Hashimoto, Kouichi Taji, Ichiro Takeuchi:
Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modifications. Neural Comput. 35(12): 1970-2005 (2023) - [j4]Hiroki Kato
, Hiroyuki Hanada, Ichiro Takeuchi:
Safe RuleFit: Learning Optimal Sparse Rule Model by Meta Safe Screening. IEEE Trans. Pattern Anal. Mach. Intell. 45(2): 2330-2343 (2023) - [j3]Takumi Yoshida, Hiroyuki Hanada, Kazuya Nakagawa, Kouichi Taji, Koji Tsuda, Ichiro Takeuchi:
Efficient model selection for predictive pattern mining model by safe pattern pruning. Patterns 4(12): 100890 (2023) - [i9]Hiroyuki Hanada, Noriaki Hashimoto, Kouichi Taji, Ichiro Takeuchi:
Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modifications. CoRR abs/2306.12670 (2023) - [i8]Takumi Yoshida, Hiroyuki Hanada, Kazuya Nakagawa, Kouichi Taji, Koji Tsuda, Ichiro Takeuchi:
Efficient Model Selection for Predictive Pattern Mining Model by Safe Pattern Pruning. CoRR abs/2306.13561 (2023) - 2022
- [j2]Vo Nguyen Le Duy, Takuto Sakuma, Taiju Ishiyama, Hiroki Toda, Kazuya Arai, Masayuki Karasuyama, Yuta Okubo, Masayuki Sunaga, Hiroyuki Hanada, Yasuo Tabei, Ichiro Takeuchi:
Stat-DSM: Statistically Discriminative Sub-Trajectory Mining With Multiple Testing Correction. IEEE Trans. Knowl. Data Eng. 34(3): 1477-1488 (2022) - [c5]Diptesh Das, Vo Nguyen Le Duy, Hiroyuki Hanada, Koji Tsuda, Ichiro Takeuchi:
Fast and More Powerful Selective Inference for Sparse High-Order Interaction Model. AAAI 2022: 9999-10007 - 2021
- [i7]Diptesh Das, Vo Nguyen Le Duy, Hiroyuki Hanada, Koji Tsuda, Ichiro Takeuchi:
Fast and More Powerful Selective Inference for Sparse High-order Interaction Model. CoRR abs/2106.04929 (2021) - 2020
- [i6]Rory P. Bunker, Keisuke Fujii, Hiroyuki Hanada, Ichiro Takeuchi:
Supervised sequential pattern mining of event sequences in sport to identify important patterns of play: an application to rugby union. CoRR abs/2010.15377 (2020)
2010 – 2019
- 2018
- [c4]Hiroyuki Hanada, Atsushi Shibagaki, Jun Sakuma, Ichiro Takeuchi:
Efficiently Monitoring Small Data Modification Effect for Large-Scale Learning in Changing Environment. AAAI 2018: 1314-1321 - [i5]Hiroyuki Hanada, Toshiyuki Takada, Jun Sakuma, Ichiro Takeuchi:
Interval-based Prediction Uncertainty Bound Computation in Learning with Missing Values. CoRR abs/1803.00218 (2018) - [i4]Hiroki Kato, Hiroyuki Hanada, Ichiro Takeuchi:
Learning sparse optimal rule fit by safe screening. CoRR abs/1810.01683 (2018) - 2017
- [i3]Hiroyuki Hanada, Mineichi Kudo, Atsuyoshi Nakamura:
On Practical Accuracy of Edit Distance Approximation Algorithms. CoRR abs/1701.06134 (2017) - 2016
- [c3]Toshiyuki Takada, Hiroyuki Hanada, Yoshiji Yamada, Jun Sakuma, Ichiro Takeuchi:
Secure Approximation Guarantee for Cryptographically Private Empirical Risk Minimization. ACML 2016: 126-141 - [i2]Toshiyuki Takada, Hiroyuki Hanada, Yoshiji Yamada, Jun Sakuma, Ichiro Takeuchi:
Secure Approximation Guarantee for Cryptographically Private Empirical Risk Minimization. CoRR abs/1602.04579 (2016) - [i1]Hiroyuki Hanada, Atsushi Shibagaki, Jun Sakuma, Ichiro Takeuchi:
Efficiently Bounding Optimal Solutions after Small Data Modification in Large-Scale Empirical Risk Minimization. CoRR abs/1606.00136 (2016) - 2015
- [c2]Hiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, Shin-ichi Minato:
Enumerating Eulerian Trails via Hamiltonian Path Enumeration. WALCOM 2015: 161-174 - 2014
- [j1]Hiroyuki Hanada, Mineichi Kudo, Atsuyoshi Nakamura:
Average-case linear-time similar substring searching by the q-gram distance. Theor. Comput. Sci. 530: 23-41 (2014) - 2011
- [c1]Hiroyuki Hanada, Atsuyoshi Nakamura, Mineichi Kudo:
A practical comparison of edit distance approximation algorithms. GrC 2011: 231-236
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
