Takuya Kida

Prof. Takuya Kida

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2010
Verified
Conference Paper
Open access
SYSatoshi Yoshida
Satoshi Yoshida
TKTakuya Kida
Takuya Kida
Almost Instantaneous VF code proposed by Yamamoto and Yokoo in 2001, which is one of the variable-length-to-fixed-length codes, uses a set of parse trees and achieves a good compression ratio. However, it needs much time and space for both encoding and decoding than an ordinary VF code does. In this paper, we proved that we can multiplex the set of parse trees into a compact single tree and simulate the original encoding and decoding procedures. Our technique reduces the total number of nodes into O(2l k - k2), while it is originally O(2l k), where l and k are the codeword length and the alphabet size, respectively. The experimental results showed that we could encode and decode over three times faster for natural language texts by using this technique.

1 December 2018 in IEICE Transactions on Information and Systems
Verified
Journal Article
Open access
PDF file
IOIku Ohama
Iku Ohama
TKTakuya Kida
Takuya Kida
HAHiroki Arimura
Hiroki Arimura
Latent variable models for relational data enable us to extract the co-cluster structure underlying observed relational data. The Infinite Relational Model (IRM) is a well-known relational model for discovering co-cluster structures with an unknown number of clusters. The IRM and several related models commonly assume that the link probability between two objects depends only on their cluster assignment. However, relational models based on this assumption often lead us to extract many non-informative and unexpected clusters. This is because the cluster structures underlying real-world relationships are often blurred by biases of individual objects. To overcome this problem, we propose a multi-layered framework, which extracts a clear de-blurred co-cluster structure in the presence of object biases. Then, we propose the Multi-Layered Infinite Relational Model (MLIRM) which is a special instance of the proposed framework incorporating the IRM as a co-clustering model. Furthermore, we reveal that some relational models can be regarded as special cases of the MLIRM. We derive an efficient collapsed Gibbs sampler to perform posterior inference for the MLIRM. Experiments conducted using real-world datasets have confirmed that the proposed model successfully extracts clear and interpretable cluster structures from real-world relational data.

1 May 2015 in Journal of Discrete Algorithms
Verified
Journal Article
Closed access
SYSatoshi Yoshida
Satoshi Yoshida
TKTakuya Kida
Takuya Kida

30 June 2015
Verified
Conference Paper
Closed access
IOIku Ohama
Iku Ohama
TKTakuya Kida
Takuya Kida
HAHiroki Arimura
Hiroki Arimura

23 April 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
IFIsamu Furuya
Isamu Furuya
TTTakuya Takagi
Takuya Takagi
YNYuto Nakashima
Yuto Nakashima
Shunsuke InenagaShunsuke Inenaga
Shunsuke Inenaga
HBHideo Bannai
Hideo Bannai
TKTakuya Kida
Takuya Kida
This study presents an analysis of RePair, which is a grammar compression algorithm known for its simple scheme, while also being practically effective. First, we show that the main process of RePair, that is, the step by step substitution of the most frequent symbol pairs, works within the corresponding most frequent maximal repeats. Then, we reveal the relation between maximal repeats and grammars constructed by RePair. On the basis of this analysis, we further propose a novel variant of RePair, called MR-RePair, which considers the one-time substitution of the most frequent maximal repeats instead of the consecutive substitution of the most frequent pairs. The results of the experiments comparing the size of constructed grammars and execution time of RePair and MR-RePair on several text corpora demonstrate that MR-RePair constructs more compact grammars than RePair does, especially for highly repetitive texts.

8 October 2019 in The Review of Socionetwork Strategies
Verified
Journal Article
Open access
PDF file
NKNaoki Katoh
Naoki Katoh
YHYuya Higashikawa
Yuya Higashikawa
HIHiro Ito
Hiro Ito
SKShun Kataoka
Shun Kataoka
TKTakuya Kida
Takuya Kida
YUYushi Uno
Yushi Uno