default search action
Tatsuya Konishi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j5]Gyuhak Kim, Changnan Xiao, Tatsuya Konishi, Zixuan Ke, Bing Liu:
Open-world continual learning: Unifying novelty detection and continual learning. Artif. Intell. 338: 104237 (2025) - 2024
- [j4]Roberto Legaspi, Wenzhen Xu, Tatsuya Konishi, Shinya Wada, Nao Kobayashi, Yasushi Naruse, Yuichi Ishikawa:
The sense of agency in human-AI interactions. Knowl. Based Syst. 286: 111298 (2024) - 2023
- [c15]Tatsuya Konishi, Shuichiro Haruta, Mori Kurokawa, Kenta Tsukatsune, Yuto Mizutani, Tomoaki Saito, Hideki Asoh, Chihiro Ono:
CG-GNN: A Novel Compiled Graphs-based Feature Extraction Method for Enterprise Social Networks. ICDAR@ICMR 2023: 24-31 - [c14]Zixuan Ke, Yijia Shao, Haowei Lin, Tatsuya Konishi, Gyuhak Kim, Bing Liu:
Continual Pre-training of Language Models. ICLR 2023 - [c13]Gyuhak Kim, Changnan Xiao, Tatsuya Konishi, Bing Liu:
Learnability and Algorithm for Continual Learning. ICML 2023: 16877-16896 - [c12]Tatsuya Konishi, Mori Kurokawa, Chihiro Ono, Zixuan Ke, Gyuhak Kim, Bing Liu:
Parameter-Level Soft-Masking for Continual Learning. ICML 2023: 17492-17505 - [i7]Zixuan Ke, Yijia Shao, Haowei Lin, Tatsuya Konishi, Gyuhak Kim, Bing Liu:
Continual Learning of Language Models. CoRR abs/2302.03241 (2023) - [i6]Gyuhak Kim, Changnan Xiao, Tatsuya Konishi, Zixuan Ke, Bing Liu:
Open-World Continual Learning: Unifying Novelty Detection and Continual Learning. CoRR abs/2304.10038 (2023) - [i5]Gyuhak Kim, Changnan Xiao, Tatsuya Konishi, Bing Liu:
Learnability and Algorithm for Continual Learning. CoRR abs/2306.12646 (2023) - [i4]Tatsuya Konishi, Mori Kurokawa, Chihiro Ono, Zixuan Ke, Gyuhak Kim, Bing Liu:
Parameter-Level Soft-Masking for Continual Learning. CoRR abs/2306.14775 (2023) - 2022
- [c11]Shuichiro Haruta, Tatsuya Konishi, Mori Kurokawa:
A Novel Graph Aggregation Method Based on Feature Distribution Around Each Ego-node for Heterophily. ACML 2022: 452-466 - [c10]Mori Kurokawa, Kei Yonekawa, Shuichiro Haruta, Tatsuya Konishi, Hideki Asoh, Chihiro Ono, Masafumi Hagiwara:
Multi-view Contrastive Multiple Knowledge Graph Embedding for Knowledge Completion. ICMLA 2022: 1412-1418 - [c9]Gyuhak Kim, Changnan Xiao, Tatsuya Konishi, Zixuan Ke, Bing Liu:
A Theoretical Study on Solving Continual Learning. NeurIPS 2022 - [c8]Tatsuya Konishi, Mori Kurokawa, Chihiro Ono, Zixuan Ke, Gyuhak Kim, Bing Liu:
Partially Relaxed Masks for Knowledge Transfer Without Forgetting in Continual Learning. PAKDD (1) 2022: 367-379 - [c7]Roberto Legaspi, Wenzhen Xu, Tatsuya Konishi, Shinya Wada, Yuichi Ishikawa:
Multidimensional Analysis of Sense of Agency During Goal Pursuit. UMAP 2022: 34-47 - [i3]Gyuhak Kim, Changnan Xiao, Tatsuya Konishi, Zixuan Ke, Bing Liu:
A Theoretical Study on Solving Continual Learning. CoRR abs/2211.02633 (2022) - 2021
- [c6]Kei Yonekawa, Shuichiro Haruta, Tatsuya Konishi, Kazuhiro Saito, Hideki Asoh, Mori Kurokawa:
A Study on Metrics for Concept Drift Detection Based on Predictions and Parameters of Ensemble Model. MobiQuitous 2021: 568-581 - [c5]Roberto Legaspi, Wenzhen Xu, Tatsuya Konishi, Shinya Wada:
Positing a Sense of Agency-Aware Persuasive AI: Its Theoretical and Computational Frameworks. PERSUASIVE 2021: 3-18 - [c4]Kenta Tsukatsune, Tatsuya Konishi, Yuto Mizutani, Mori Kurokawa, Shuichiro Haruta, Tomoaki Saito:
Does Activeness Originate in Individuals or Groups? Analysis of the Interrelationships between Network Indices and Posts Using Multilevel Cross-Lagged Model. WI/IAT (Workshop/Special Session) 2021: 117-125 - 2020
- [j3]Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya:
Finding Minimum Locating Arrays Using a CSP Solver. Fundam. Informaticae 174(1): 27-42 (2020) - [j2]Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya:
Using simulated annealing for locating array construction. Inf. Softw. Technol. 126: 106346 (2020)
2010 – 2019
- 2019
- [c3]Tatsuya Konishi, Masatoshi Nagata, Masaru Honjo, Akio Yoneyama, Masayuki Kurokawa, Koji Mishima:
Social Behaviors: A Social Topology and Interaction Pattern Affect the Properties of a Changed Behavior. PERSUASIVE 2019: 310-321 - [i2]Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya:
Finding minimum locating arrays using a CSP solver. CoRR abs/1904.07480 (2019) - [i1]Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya:
Using simulated annealing for locating array construction. CoRR abs/1909.13090 (2019) - 2017
- [j1]Ryo Imai, Kota Tsubouchi, Tatsuya Konishi, Masamichi Shimosaka:
Early Destination Prediction with Spatio-temporal User Behavior Patterns. Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. 1(4): 142:1-142:19 (2017) - [c2]Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya:
Finding Minimum Locating Arrays Using a SAT Solver. ICST Workshops 2017: 276-277 - 2016
- [c1]Tatsuya Konishi, Mikiya Maruyama, Kota Tsubouchi, Masamichi Shimosaka:
CityProphet: city-scale irregularity prediction using transit app logs. UbiComp 2016: 752-757
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-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint