Takuya Takagi

Orcid: 0000-0002-5788-130X

According to our database1, Takuya Takagi authored at least 25 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Counterfactual Explanation with Missing Values.
CoRR, 2023

Linear Time Online Algorithms for Constructing Linear-size Suffix Trie.
CoRR, 2023

Rule Mining for Correcting Classification Models.
Proceedings of the IEEE International Conference on Data Mining, 2023

2022
TimberTrek: Exploring and Curating Sparse Decision Trees with Interactive Visualization.
Proceedings of the 2022 IEEE Visualization and Visual Analytics (VIS), 2022

Exploring the Whole Rashomon Set of Sparse Decision Trees.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Multivariate Causal Discovery based on Post-Nonlinear Model.
Proceedings of the 1st Conference on Causal Learning and Reasoning, 2022

Counterfactual Explanation Trees: Transparent and Consistent Actionable Recourse with Decision Trees.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Explainable and Local Correction of Classification Models Using Decision Trees.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Efficient Constrained Pattern Mining Using Dynamic Item Ordering for Explainable Classification.
CoRR, 2020

Practical Grammar Compression Based on Maximal Repeats.
Algorithms, 2020

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts.
Algorithmica, 2020

DACE: Distribution-Aware Counterfactual Explanation by Mixed-Integer Linear Optimization.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
On the size of the smallest alphabet for Lyndon trees.
Theor. Comput. Sci., 2019

Requirements for Explainable Smart Systems in the Enterprises from Users and Society Based on FAT.
Proceedings of the Joint Proceedings of the ACM IUI 2019 Workshops co-located with the 24th ACM Conference on Intelligent User Interfaces (ACM IUI 2019), 2019

MR-RePair: Grammar Compression Based on Maximal Repeats.
Proceedings of the Data Compression Conference, 2019

Online Algorithms for Constructing Linear-Size Suffix Trie.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Multi Instance Learning For Unbalanced Data.
CoRR, 2018

Truncated DAWGs and Their Application to Minimal Absent Word Problem.
Proceedings of the String Processing and Information Retrieval, 2018

2017
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

On Reverse Engineering the Lyndon Tree.
Proceedings of the Prague Stringology Conference 2017, 2017

Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression.
Proceedings of the String Processing and Information Retrieval, 2017

2016
Fully-online Construction of Suffix Trees for Multiple Texts.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Fully-online construction of suffix trees and DAWGs for multiple texts.
CoRR, 2015

2014
Enumeration of complete set of flock patterns in trajectories.
Proceedings of the 5th ACM SIGSPATIAL International Workshop on GeoStreaming, 2014


  Loading...