default search action
Maksim Tkatchenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Aaron Levine, Connie Huang, Chenguang Wang, Eduardo Batista, Ewa Szymanska, Hongyi Ding, Hou Wei Chou, Jean-François Pessiot, Johanes Effendi, Justin Chiu, Kai Torben Ohlhus, Karan Chopra, Keiji Shinzato, Koji Murakami, Lee Xiong, Lei Chen, Maki Kubota, Maksim Tkachenko, Miroku Lee, Naoki Takahashi, Prathyusha Jwalapuram, Ryutaro Tatsushima, Saurabh Jain, Sunil Kumar Yadav, Ting Cai, Wei-Te Chen, Yandi Xia, Yuki Nakayama, Yutaka Higashiyama:
RakutenAI-7B: Extending Large Language Models for Japanese. CoRR abs/2403.15484 (2024) - 2023
- [j2]Ween Jiann Lee
, Maksim Tkachenko
Robust Bidirectional Poly-Matching. IEEE Trans. Knowl. Data Eng. 35(10): 10762-10774 (2023) - [c14]Chong Cher Chia
Semantically Constitutive Entities in Knowledge Graphs. DEXA (1) 2023: 445-461 - [c13]Maksim Tkachenko, Volodymyr Petrivskyi, Pavel Petrov, Yaroslav Petrivskyi, Oleksandr Pyzh:
Complex System for Radio Location Field Quality Assessment. IT&I 2023: 25-35 - [c12]Alberto Poncelas, Maksim Tkachenko, Ohnmar Htun:
Sakura at SemEval-2023 Task 2: Data Augmentation via Translation. SemEval@ACL 2023: 1718-1722 - 2022
- [c11]Chong Cher Chia, Maksim Tkachenko, Hady W. Lauw
Morphologically-Aware Vocabulary Reduction of Word Embeddings. WI/IAT 2022: 56-63 - 2021
- [c10]Ween Jiann Lee
Robust BiPoly-Matching for Multi-Granular Entities. ICDM 2021: 1192-1197
2010 – 2019
- 2019
- [c9]Maksim Tkachenko, Hady W. Lauw
CompareLDA: A Topic Model for Document Comparison. AAAI 2019: 7112-7119 - 2018
- [c8]Maksim Tkachenko, Chong Cher Chia, Hady W. Lauw
Searching for the X-Factor: Exploring Corpus Subjectivity for Word Embeddings. ACL (1) 2018: 1212-1221 - 2017
- [j1]Maksim Tkachenko, Hady Wirawan Lauw
Comparative Relation Generative Model. IEEE Trans. Knowl. Data Eng. 29(4): 771-783 (2017) - 2016
- [c7]Maksim Tkachenko, Hady Wirawan Lauw
Plackett-Luce Regression Mixture Model for Heterogeneous Rankings. CIKM 2016: 237-246 - 2015
- [c6]Maksim Tkachenko, Hady Wirawan Lauw
A Convolution Kernel Approach to Identifying Comparisons in Text. ACL (1) 2015: 376-386 - 2014
- [c5]Maksim Tkachenko, Hady Wirawan Lauw
Generative Modeling of Entity Comparisons in Text. CIKM 2014: 859-868 - 2013
- [c4]Rinat Gareev, Maksim Tkatchenko, Valery D. Solovyev
Introducing Baselines for Russian Named Entity Recognition. CICLing (1) 2013: 329-342 - 2012
- [c3]Maksim Tkachenko, Andrey Simanovsky:
Named entity recognition: Exploring features. KONVENS 2012: 118-127 - [c2]Maksim Tkachenko, Andrey Simanovsky:
Selecting features for domain-independent named entity recognition. KONVENS 2012: 248-253 - 2011
- [c1]Maksim Tkatchenko, Alexander Ulanov, Andrey Simanovsky:
Classifying Wikipedia entities into fine-grained classes. ICDE Workshops 2011: 212-217
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 2024-04-24 23:11 CEST 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: