default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakuya Takagi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Diptarama Hendrian
, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi:
Linear time online algorithms for constructing linear-size suffix trie. Theor. Comput. Sci. 1015: 114765 (2024)- [c20]Taisei Tosaki, Eiichiro Uchino, Yohei Harada, Minoru Sakuragi, Yusuke Koyanagi, Seiji Okajima, Hirofumi Suzuki, Kentaro Kanamori, Masahiro Asaoka, Kouji Kurihara, Takuya Takagi, Koji Maruhashi, Yoshinori Tamada, Tatsuya Mikami, Koichi Murashita, Shigeyuki Nakaji, Yasushi Okuno:
Subgrouping Causal Networks of Disease Onset in Large-scale Health and Medical Data using Supercomputer Fugaku. BIBM 2024: 4384-4391 - [c19]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike:
Learning Decision Trees and Forests with Algorithmic Recourse. ICML 2024 - [c18]Shoki Yamao, Ken Kobayashi, Kentaro Kanamori, Takuya Takagi, Yuichi Ike, Kazuhide Nakata:
Distribution-Aligned Sequential Counterfactual Explanation with Local Outlier Factor. PRICAI (1) 2024: 243-256 - [i14]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike:
Learning Decision Trees and Forests with Algorithmic Recourse. CoRR abs/2406.01098 (2024) - 2023
- [c17]Hirofumi Suzuki, Hiroaki Iwashita, Takuya Takagi, Yuta Fujishige, Satoshi Hara:
Rule Mining for Correcting Classification Models. ICDM 2023: 1331-1336 - [i13]Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi:
Linear Time Online Algorithms for Constructing Linear-size Suffix Trie. CoRR abs/2301.04295 (2023) - [i12]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike:
Counterfactual Explanation with Missing Values. CoRR abs/2304.14606 (2023) - [i11]Hirofumi Suzuki, Hiroaki Iwashita, Takuya Takagi, Yuta Fujishige, Satoshi Hara:
Rule Mining for Correcting Classification Models. CoRR abs/2310.06446 (2023) - 2022
- [c16]Hirofumi Suzuki, Hiroaki Iwashita, Takuya Takagi, Keisuke Goto, Yuta Fujishige, Satoshi Hara:
Explainable and Local Correction of Classification Models Using Decision Trees. AAAI 2022: 8404-8413 - [c15]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike:
Counterfactual Explanation Trees: Transparent and Consistent Actionable Recourse with Decision Trees. AISTATS 2022: 1846-1870 - [c14]Kento Uemura, Takuya Takagi, Kambayashi Takayuki, Hiroyuki Yoshida, Shohei Shimizu:
A Multivariate Causal Discovery based on Post-Nonlinear Model. CLeaR 2022: 826-839 - [c13]Rui Xin, Chudi Zhong, Zhi Chen, Takuya Takagi, Margo I. Seltzer, Cynthia Rudin:
Exploring the Whole Rashomon Set of Sparse Decision Trees. NeurIPS 2022 - [c12]Zijie J. Wang, Chudi Zhong, Rui Xin, Takuya Takagi, Zhi Chen, Duen Horng Chau, Cynthia Rudin, Margo I. Seltzer:
TimberTrek: Exploring and Curating Sparse Decision Trees with Interactive Visualization. IEEE VIS (Short Papers) 2022: 60-64 - [e1]Shusaku Tsumoto, Yukio Ohsawa, Lei Chen, Dirk Van den Poel, Xiaohua Hu, Yoichi Motomura, Takuya Takagi, Lingfei Wu, Ying Xie, Akihiro Abe, Vijay Raghavan:
IEEE International Conference on Big Data, Big Data 2022, Osaka, Japan, December 17-20, 2022. IEEE 2022, ISBN 978-1-6654-8045-1 [contents] - [i10]Rui Xin, Chudi Zhong, Zhi Chen, Takuya Takagi, Margo I. Seltzer, Cynthia Rudin:
Exploring the Whole Rashomon Set of Sparse Decision Trees. CoRR abs/2209.08040 (2022) - [i9]Zijie J. Wang, Chudi Zhong, Rui Xin, Takuya Takagi, Zhi Chen, Duen Horng Chau, Cynthia Rudin, Margo I. Seltzer:
TimberTrek: Exploring and Curating Sparse Decision Trees with Interactive Visualization. CoRR abs/2209.09227 (2022) - 2021
- [c11]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura:
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. AAAI 2021: 11564-11574 - 2020
- [j4]Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian:
Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Algorithmica 82(5): 1346-1377 (2020) - [j3]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
Practical Grammar Compression Based on Maximal Repeats. Algorithms 13(4): 103 (2020) - [c10]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Hiroki Arimura:
DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization. IJCAI 2020: 2855-2862 - [i8]Hiroaki Iwashita, Takuya Takagi, Hirofumi Suzuki, Keisuke Goto, Kotaro Ohori, Hiroki Arimura:
Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification. CoRR abs/2004.08015 (2020) - [i7]Kentaro Kanamori, Takuya Takagi, Ken Kobayashi, Yuichi Ike, Kento Uemura, Hiroki Arimura:
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization. CoRR abs/2012.11782 (2020)
2010 – 2019
- 2019
- [j2]Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On the size of the smallest alphabet for Lyndon trees. Theor. Comput. Sci. 792: 131-143 (2019) - [c9]Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga:
Online Algorithms for Constructing Linear-Size Suffix Trie. CPM 2019: 30:1-30:19 - [c8]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
MR-RePair: Grammar Compression Based on Maximal Repeats. DCC 2019: 508-517 - [c7]Yuri Nakao, Junichi Shigezumi, Hikaru Yokono, Takuya Takagi:
Requirements for Explainable Smart Systems in the Enterprises from Users and Society Based on FAT. IUI Workshops 2019 - [i6]Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga:
Online Algorithms for Constructing Linear-size Suffix Trie. CoRR abs/1901.10045 (2019) - 2018
- [c6]Yuta Fujishige, Takuya Takagi, Diptarama Hendrian:
Truncated DAWGs and Their Application to Minimal Absent Word Problem. SPIRE 2018: 139-152 - [i5]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
MR-RePair: Grammar Compression based on Maximal Repeats. CoRR abs/1811.04596 (2018) - [i4]Mark Kozdoba, Edward Moroshko, Lior Shani, Takuya Takagi, Takashi Katoh, Shie Mannor, Koby Crammer:
Multi Instance Learning For Unbalanced Data. CoRR abs/1812.07010 (2018) - 2017
- [j1]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1785-1793 (2017) - [c5]Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura:
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. SPIRE 2017: 304-316 - [c4]Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On Reverse Engineering the Lyndon Tree. Stringology 2017: 108-117 - [i3]Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura:
Linear-size CDAWG: new repetition-aware indexing and grammar compression. CoRR abs/1705.09779 (2017) - 2016
- [c3]Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura:
Fully-online Construction of Suffix Trees for Multiple Texts. CPM 2016: 22:1-22:13 - [c2]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IWOCA 2016: 213-225 - [i2]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. CoRR abs/1602.00422 (2016) - 2015
- [i1]Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura:
Fully-online construction of suffix trees and DAWGs for multiple texts. CoRR abs/1507.07622 (2015) - 2014
- [c1]Xiaoliang Geng, Takuya Takagi, Hiroki Arimura, Takeaki Uno:
Enumeration of complete set of flock patterns in trajectories. IWGS 2014: 53-61
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 2025-03-22 01:14 CET 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:
