| DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization. K Kanamori, T Takagi, K Kobayashi, H Arimura IJCAI, 2855-2862, 2020 | 157 | 2020 |
| Exploring the whole rashomon set of sparse decision trees R Xin, C Zhong, Z Chen, T Takagi, M Seltzer, C Rudin Advances in neural information processing systems 35, 14071-14084, 2022 | 67 | 2022 |
| Ordered counterfactual explanation by mixed-integer linear optimization K Kanamori, T Takagi, K Kobayashi, Y Ike, K Uemura, H Arimura Proceedings of the AAAI Conference on Artificial Intelligence 35 (13), 11564 …, 2021 | 49 | 2021 |
| Counterfactual explanation trees: Transparent and consistent actionable recourse with decision trees K Kanamori, T Takagi, K Kobayashi, Y Ike International Conference on Artificial Intelligence and Statistics, 1846-1870, 2022 | 34 | 2022 |
| MR-RePair: Grammar compression based on maximal repeats I Furuya, T Takagi, Y Nakashima, S Inenaga, H Bannai, T Kida 2019 Data Compression Conference (DCC), 508-517, 2019 | 25 | 2019 |
| TimberTrek: exploring and curating sparse decision trees with interactive visualization ZJ Wang, C Zhong, R Xin, T Takagi, Z Chen, DH Chau, C Rudin, ... 2022 IEEE Visualization and Visual Analytics (VIS), 60-64, 2022 | 24 | 2022 |
| Packed compact tries: A fast and efficient data structure for online string processing T Takagi, S Inenaga, K Sadakane, H Arimura IEICE Transactions on Fundamentals of Electronics, Communications and …, 2017 | 23 | 2017 |
| A multivariate causal discovery based on post-nonlinear model K Uemura, T Takagi, K Takayuki, H Yoshida, S Shimizu Conference on Causal Learning and Reasoning, 826-839, 2022 | 19 | 2022 |
| Linear-size CDAWG: New repetition-aware indexing and grammar compression T Takagi, K Goto, Y Fujishige, S Inenaga, H Arimura International Symposium on String Processing and Information Retrieval, 304-316, 2017 | 19 | 2017 |
| Efficient constrained pattern mining using dynamic item ordering for explainable classification H Iwashita, T Takagi, H Suzuki, K Goto, K Ohori, H Arimura arXiv preprint arXiv:2004.08015, 2020 | 10 | 2020 |
| Enumeration of complete set of flock patterns in trajectories X Geng, T Takagi, H Arimura, T Uno Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming …, 2014 | 10 | 2014 |
| Finding all maximal duration flock patterns in high-dimensional trajectories H Arimura, T Takagi, X Geng, T Uno Manuscript, DCS, IST, Hokkaido University, 2014 | 8 | 2014 |
| Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization K Kanamori, T Takagi, K Kobayashi, H Arimura Transactions of the Japanese Society for Artificial Intelligence 36 (6), C …, 2021 | 6 | 2021 |
| Online algorithms for constructing linear-size suffix trie D Hendrian, T Takagi, S Inenaga arXiv preprint arXiv:1901.10045, 2019 | 6 | 2019 |
| Fully-online suffix tree and directed acyclic word graph construction for multiple texts T Takagi, S Inenaga, H Arimura, D Breslauer, D Hendrian Algorithmica 82 (5), 1346-1377, 2020 | 5 | 2020 |
| Truncated DAWGs and their application to minimal absent word problem Y Fujishige, T Takagi, D Hendrian International Symposium on String Processing and Information Retrieval, 139-152, 2018 | 5 | 2018 |
| Requirements for Explainable Smart Systems in the Enterprises from Users and Society Based on FAT. Y Nakao, J Shigezumi, H Yokono, T Takagi IUI Workshops 19, 2019 | 4 | 2019 |
| On Reverse Engineering the Lyndon Tree. Y Nakashima, T Takagi, S Inenaga, H Bannai, M Takeda Stringology, 108-117, 2017 | 4 | 2017 |
| Practical grammar compression based on maximal repeats I Furuya, T Takagi, Y Nakashima, S Inenaga, H Bannai, T Kida Algorithms 13 (4), 103, 2020 | 3 | 2020 |
| On the size of the smallest alphabet for Lyndon trees Y Nakashima, T Takagi, S Inenaga, H Bannai, M Takeda Theoretical Computer Science 792, 131-143, 2019 | 3 | 2019 |
Hiroki ArimuraGraduate School of Information Science and Technology, Hokkaido University, ProfessorEmail verificata su ist.hokudai.ac.jp