Seguir
Takuya Takagi
Takuya Takagi
Dirección de correo verificada de fujitsu.com
Título
Citado por
Citado por
Año
DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization.
K Kanamori, T Takagi, K Kobayashi, H Arimura
IJCAI, 2855-2862, 2020
392020
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
172019
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
142017
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
132017
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
82014
Finding all maximal duration flock patterns in high-dimensional trajectories
H Arimura, T Takagi, X Geng, T Uno
Manuscript, DCS, IST, Hokkaido University, 2014
82014
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
72021
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
32018
On Reverse Engineering the Lyndon Tree.
Y Nakashima, T Takagi, S Inenaga, H Bannai, M Takeda
Stringology, 108-117, 2017
32017
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
22020
Practical grammar compression based on maximal repeats
I Furuya, T Takagi, Y Nakashima, S Inenaga, H Bannai, T Kida
Algorithms 13 (4), 103, 2020
22020
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
22019
Online algorithms for constructing linear-size suffix trie
D Hendrian, T Takagi, S Inenaga
arXiv preprint arXiv:1901.10045, 2019
22019
Fully-online construction of suffix trees for multiple texts
T Takagi, S Inenaga, H Arimura
27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
22016
Fully-online construction of suffix trees and dawgs for multiple texts
T Takagi, S Inenaga, H Arimura
arXiv preprint arXiv:1507.07622, 2015
22015
Applications of succinct dynamic compact tries to some string problems
T Takagi, T Uemura, S Inenaga, K Sadakane, H Arimura
2
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
12022
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
12021
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
12019
Multi instance learning for unbalanced data
M Kozdoba, E Moroshko, L Shani, T Takagi, T Katoh, S Mannor, ...
arXiv preprint arXiv:1812.07010, 2018
12018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20