KIDA Takuya

J-GLOBAL         Last updated: Oct 1, 2018 at 16:37
 
Avatar
Name
KIDA Takuya
URL
http://www-ikn.ist.hokudai.ac.jp/~kida/
Affiliation
Hokkaido University
Section
Graduate School of Information Science and Technology, Division of Computer Science, Knowledge Software Science
Job title
Associate Professor
Degree
Ph.D.(Kyushu University)
Research funding number
70343316
ORCID ID
0000-0003-1666-3303

Research Areas

 
 

Academic & Professional Experience

 
Apr 2004
 - 
Today
Associate Professor, Hokkaido University
 
Oct 2001
 - 
Mar 2004
Lecturer, R&D section of Kyusyu University Library
 
2000
 - 
2001
 Postdoctoral Fellowships of Japan Society for the Promotion of Science,Research Fellow of the Japan Society for the Promotion of Science
 
2001
 - 
2004
 Lecturer,Kyushu University Library, R&D section
 

Education

 
 
 - 
1999
Kyushu University
 
 
 - 
2001
Kyushu University
 
 
 - 
Mar 1997
Physics, Faculty of Science, Kyusyu University
 

Awards & Honors

 
2001
Special Issue on IPSJ 40th Anniversary Award Papers, IPSJ.
 

Published Papers

 
Iku Ohama,Takuya Kida,Hiroki Arimura
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017   2578-2584   2017   [Refereed]
Iku Ohama,Issei Sato,Takuya Kida,Hiroki Arimura
Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 4-9 December 2017, Long Beach, CA, USA   396-404   2017   [Refereed]
Iku Ohama,Hiromi Iida,Takuya Kida,Hiroki Arimura
IEICE Transactions   99-D(4) 1139-1152   2016   [Refereed]
Takuya Masaki,Takuya Kida
2016 Data Compression Conference, DCC 2016, Snowbird, UT, USA, March 30 - April 1, 2016   349-358   2016   [Refereed]
Satoshi Yoshida,Takuya Kida
J. Discrete Algorithms   32 75-86   2015   [Refereed]
Iku Ohama,Takuya Kida,Hiroki Arimura
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30 - May 2, 2015   819-827   2015   [Refereed]
高田怜, 喜田拓也
日本データベース学会和文論文誌   13-J(1) 86-91   Oct 2014
Kei Sekine,Hirohito Sasakawa,Satoshi Yoshida,Takuya Kida
Data Compression Conference, DCC 2014, Snowbird, UT, USA, 26-28 March, 2014   425   2014   [Refereed]
Satoshi Yoshida,Hirohito Sasakawa,Kei Sekine,Takuya Kida
Data Compression Conference, DCC 2014, Snowbird, UT, USA, 26-28 March, 2014   436   2014   [Refereed]
A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm
Satoshi Yoshida and Takuya Kida
IPSJ Transactions on Databases   6(4) 17-23   Sep 2013   [Refereed]
Kei Sekine,Hirohito Sasakawa,Satoshi Yoshida,Takuya Kida
2013 Data Compression Conference, DCC 2013, Snowbird, UT, USA, March 20-22, 2013   518   2013   [Refereed]
Satoshi Yoshida,Takuya Kida
2013 Data Compression Conference, DCC 2013, Snowbird, UT, USA, March 20-22, 2013   532   2013   [Refereed]
Iku Ohama,Hiromi Iida,Takuya Kida,Hiroki Arimura
Advances in Knowledge Discovery and Data Mining, 17th Pacific-Asia Conference, PAKDD 2013, Gold Coast, Australia, April 14-17, 2013, Proceedings, Part II   147-159   2013   [Refereed]
Satoshi Yoshida,Takashi Uemura,Takuya Kida,Tatsuya Asai,Seishi Okamoto
JIP   20(1) 238-249   2012   [Refereed]
Satoshi Yoshida,Takuya Kida
2011 Data Compression Conference (DCC 2011), 29-31 March 2011, Snowbird, UT, USA   to appear   2011   [Refereed]
Jumpei Fujikawa,Takuya Kida,Takashi Katoh
2011 IEEE International Conference on Granular Computing, GrC-2011, Kaohsiung, Taiwan, November 8-10, 2011   199-202   2011   [Refereed]
KIDA Takuya
The IEICE transactions on information and systems (Japanese edetion)   93(6) 733-741   Jun 2010
Satoshi Yoshida,Takuya Kida
2010 Data Compression Conference (DCC 2010), 24-26 March 2010, Snowbird, UT, USA   0-228   2010   [Refereed]
Takashi Uemura,Satoshi Yoshida,Takuya Kida,Tatsuya Asai,Seishi Okamoto
String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings   6393 179-184   2010   [Refereed]
Hiroshi Sakamoto,Shirou Maruyama,Takuya Kida,Shinichi Shimozono
IEICE Transactions   E92-D(2) 158-165   2009   [Refereed]
Takuya Kida
2009 Data Compression Conference (DCC 2009), 16-18 March 2009, Snowbird, UT, USA   449   2009   [Refereed]
Hideyuki Ohtani,Takuya Kida,Takeaki Uno,Hiroki Arimura
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC 2009, Suwon, Korea, January 15-16, 2009   471-479   2009   [Refereed]
Takashi Uemura, Takuya Kida, Hiroki Arimura
情報処理学会論文誌データベース(TOD)   1(1) 49-60   Jun 2008
Web browsers play an important role in information-gathering on the Internet. However, searching and browsing documents are still time-consuming jobs for many users. In this paper we present an algorithm for keyword extraction at the current Web p...
UEMURA Takashi, KIDA Takuya, ARIMURA Hiroki
The IEICE transactions on information and systems (Japanese edetion)   91(3) 595-607   Mar 2008
Takuya Kida,Tomoya Saito,Hiroki Arimura
New Frontiers in Applied Data Mining, PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers   5-16   2008   [Refereed]
Uemura Takashi, Kida Takuya, Arimura Hiroki
5(0) 5-8   Aug 2006
Takuya Kida
Federation over the Web - International Workshop, Dagstuhl Castle, Germany, May 1-6, 2005. Revised Selected Papers   25-39   2005   [Refereed]
Hiroshi Sakamoto,Takuya Kida,Shinichi Shimozono
String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings   Lecture Notes in Computer Science 3246 218-229   2004   [Refereed]
Takuya Kida,Tetsuya Matsumoto,Yusuke Shibata,Masayuki Takeda,Ayumi Shinohara,Setsuo Arikawa
Theor. Comput. Sci.   298(1) 253-272   2003   [Refereed]
Masayuki Takeda,Satoru Miyamoto,Takuya Kida,Ayumi Shinohara,Shuichi Fukamachi,Takeshi Shinohara,Setsuo Arikawa
String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings   170-186   2002   [Refereed]
Takuya Kida,Tetsuya Matsumoto,Masayuki Takeda,Ayumi Shinohara,Setsuo Arikawa
Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings   193-206   2001   [Refereed]
Gonzalo Navarro,Takuya Kida,Masayuki Takeda,Ayumi Shinohara,Setsuo Arikawa
Data Compression Conference, DCC 2001, Snowbird, Utah, USA, March 27-29, 2001.   459-468   2001   [Refereed]
Yusuke Shibata,Takuya Kida,Shuichi Fukamachi,Masayuki Takeda,Ayumi Shinohara,Takeshi Shinohara,Setsuo Arikawa
Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings   306-315   2000   [Refereed]
Tetsuya Matsumoto,Takuya Kida,Masayuki Takeda,Ayumi Shinohara,Setsuo Arikawa
Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000   221-228   2000   [Refereed]
Takuya Kida,Masayuki Takeda,Ayumi Shinohara,Setsuo Arikawa
Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings   1-13   1999   [Refereed]
Kouichi Tamari,Mayumi Yamasaki,Takuya Kida,Masayuki Takeda,Tomoko Fukuda,Ichiro Nanri
Discovery Science, Second International Conference, DS '99, Tokyo, Japan, December, 1999, Proceedings   128-138   1999   [Refereed]
Takuya Kida,Yusuke Shibata,Masayuki Takeda,Ayumi Shinohara,Setsuo Arikawa
Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, SPIRE/CRIWG 1999, Cancun, Mexico, September 21-24, 1999   89-96   1999   [Refereed]
Takuya Kida,Masayuki Takeda,Ayumi Shinohara,Masamichi Miyazaki,Setsuo Arikawa
Data Compression Conference, DCC 1998, Snowbird, Utah, USA, March 30 - April 1, 1998.   103-112   1998   [Refereed]

Misc

 
Isamu Furuya,Takuya Kida
CoRR   abs/1706.10061    2017   [Refereed]
小笠原 智明, 今井 浩, 喜田 拓也
電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   116(211) 29-35   Sep 2016
正木拓也, 笹川裕人, 喜田拓也
IPSJ SIG Notes   2014(AL-149) VOL.2014-AL-149,NO.5 (WEB ONLY)-5   Sep 2014
End-Tagged Dense Code (ETDC) is a word-based compression method that uses byte-oriented codewords. It is easy to extract codewords from compressed texts, and thus suitable for searching keywords on them. In this paper, we proposed a method for ETD...
Masaki Takuya, Sasakawa Hirohito, Kida Takuya
情報科学技術フォーラム講演論文集   13(1) 67-68   Aug 2014
笹川裕人, 関根渓, 吉田諭史, 喜田拓也
IPSJ SIG Notes   2014(8) 1-5   Jun 2014
In this paper, we propose a simple method solving the substring extraction problem for variable-to-fixed length codes (VF codes) by adding an auxiliary succinct index structure. The method solves the problem in O(N/n + l) time in the average case,...
TERASHIMA Hiroki, KIDA Takuya
Technical report of IEICE. PRMU   113(493) 247-252   Mar 2014
Local Binary Pattern (LBP) is an image feature that widely used for image classification. This feature consists of a histogram calculated from luminosity patterns extracted from 3 x 3 local regions. In this paper, we propose a new LBP like image f...
SEKINE KEI, SASAKAWA HIROHITO, YOSHIDA SATOSHI, KIDA TAKUYA
IEICE technical report. Data engineering   112(346) 47-52   Dec 2012
The Re-Pair algorithm proposed by Larsson and Moffat in 1999 is a simple grammar-based com-pression method that achieves an extremely high compression ratio. However, Re-Pair is an offline and very space consuming algorithm. Thus, to apply it to a...
OHAMA Iku, IIDA Hiromi, KIDA Takuya, ARIMURA Hiroki
電子情報通信学会技術研究報告. IBISML, 情報論的学習理論と機械学習 = IEICE technical report. IBISML, Information-based induction sciences and machine learning   111(480) 1-8   Mar 2012
We propose a new generative model which analyses asymmetric and individually different relational data. In our proposed model, each object has a parameter which adjusts chance of encounter with another objects. Then, based on the idea of subset cl...
Yoshida Satoshi, Kida Takuya
情報科学技術フォーラム講演論文集   10(1) 149-150   Sep 2011
吉田 諭史, 喜田 拓也
研究報告 データベースシステム(DBS)   2011(14) 1-6   Jul 2011
本稿では,VF 符号における辞書データ構造を訓練することで VF 符号の性能を向上させる方法について論じる.ここで議論する VF 符号とは,分節木と呼ばれる木構造を用いて入力テキストを可変長のブロックに分割し,各ブロックに固定長の符号語を割り当てることでテキスト圧縮を達成する情報源符号化方法である.VF 符号の圧縮率は分節木によって決定されるが,入力テキストに対して最適な分節木を構築することは NP 困難であることが知られている.そのため,最適に近い分節木を構築するために,入力テキストを繰...
OHAMA Iku, KIDA Takuya, ARIMURA Hiroki, ABE Toshihisa
IEICE technical report   110(476) 9-16   Mar 2011
We discuss the geographical clustering problem on human activity logs. In this paper, we formulate the problem as a segmentation problem for 2-dimensional sequence data, and propose two clustering methods, named LS-linHMM and X-linHMM. LS-linHMM i...
吉田 諭史, 喜田 拓也
研究報告情報基礎とアクセス技術(IFAT)   2010(10) 1-8   Jul 2010
本稿では,VF 符号に算術符号を組み合わせることで,検索の効率と圧縮率とを保つ方法について議論する.ここで議論する VF 符号とは,分節木と呼ばれる圧縮のための辞書木を用いて元のテキストを可変長のブロックに分割し,各ブロックに固定長の符号語を割り当てることでデータ圧縮を達成する情報源符号化方法である.VF 符号は,近年,パターン照合を高速化することのできるデータ圧縮法として見直されている.VF 符号は,符号語長が固定であるという制限から,分節木が小さいときには圧縮性能が低い.圧縮率を向上さ...
An Efficient Compressed Pattern Matching Algorithm on Codes Represented by Parse Tree and Shared String
Vol.J93-D(No.6) 733-741   2010
YOSHIDA SATOSHI, KIDA TAKUYA
研究報告データベースシステム(DBS)   148(0) 1-7   Jul 2009
Yamamoto と Yokoo ら [2001] によって提案された多重分節木による AIVF 符号は,短い符号長で十分な圧縮率が得られる VF 符号 (可変ブロック固定長符号化) の一つである.しかしながら,情報源アルファベットのサイズを k とすると,k − 1個の分節木を構築するため,ただ一つの分節木を用いる一般的なVF符号化と比べて,符号・復号化時に多くの時間と領域が必要となる.本稿では,多重分節木を一つの分節木に統合し,その木の上で仮想的に多重分節木を模倣するアルゴリズムを示す...
KIDA Takuya
IEICE technical report. Theoretical foundations of Computing   109(108) 1-8   Jun 2009
We discuss the problem of pattern matching on a VF coded text. We derive a KMP-type pattern matching algorithm from the collage system, which is a general framework to capture the essence of compressed pattern matching. The algorithm runs on a VF ...
STVF Code: An Efficient VF Coding using Frequency-base-pruned Suffix Tree
DBSJ Journal   8(1) 125-130   2009
NAKANO Tomoharu, KIDA Takuya
Technical report of IEICE. PRMU   108(363) 25-30   Dec 2008
We can touch a numerous number of images on the Internet in this days. Almost all images are stored in compressed form. The JPEG format is one of the most popular image formats. For a JPEG image, we usually need to decode it into a bitmap image in...
OHTANI Hideyuki, KIDA Takuya, UNO Takeaki, ARIMURA Hiroki
IPSJ SIG Notes   2008(56) 113-120   Jun 2008
Recently, knowledge discovery in large data increases its importance in various fields. Especially, data mining from time-series data gains much attension. This paper studies the problem of finding frequent episodes appearing in a sequence of even...
UEMURA TAKASHI, KIDA TAKUYA, ARIMURA HIROKI
情報処理学会シンポジウムシリーズ(CD−ROM)   2007(3) 7B-1   Nov 2007
Uemura Takashi, Kida Takuya, Arimura Hiroki
情報科学技術フォーラム一般講演論文集   6(2) 45-46   Aug 2007
Saito Tomoya, Kida Takuya, Arimura Hiroki
情報科学技術フォーラム一般講演論文集   6(2) 43-44   Aug 2007
UEMURA Takashi, KIDA Takuya, ARIMURA Hiroki
IEICE technical report. Theoretical foundations of Computing   107(24) 71-78   Apr 2007
In some intelligent application of text retrieval, it is required to do a search just through particular parts of target text data with consideration for some properties that the text have. Namely, the texts are followed by additional information,...
上村卓史, 喜田拓也, 有村博紀
情報科学技術フォーラム   FIT 2006 5-8-8   Aug 2006
Efficient Algorithm of Constructing Suffix Tree with Word Count Limitation
5 5-8   2006
喜田拓也
情報科学技術フォーラム   FIT 2005 25-28-28   Aug 2005
KIDA Takuya, MINAMI Toshiro
IPSJ SIG Notes   2005(68) 461-467   Jul 2005
Recently many libraries provide their patrons with OPAC (Online Public Access Catalog) system for retrieving their materials. However, in libraries with a long history for example, it often happens that a patron can not find very old materials by ...
有村 博紀, 喜田 拓也
情報処理   46(1) 4-11   Jan 2005
大量の電子化データの流れであるデータストリームから,有用な情報を少ない資源で効率よく取り出すためのストリームマイニング技術を概観する.まず,データストリームの特徴と,データマイニングの目的について整理し,限定された計算資源を用いて無限につづくデータストリームからマイニングを行うためのシステムに要求される性質について議論する.次に,さまざまな要約データ構造とオンライン化技術についてまとめ,最近の研究のうち特色のあるものを紹介する.
MINAMI TOSHIRO, IKEDA DAISUKE, KIDA TAKUYA
情報処理学会研究報告   2004(119(FI−77)) 7-22-22   Nov 2004
In the IT society, people's requirements and expectations to the libraries are different from those so far. Libraries must be the growing organism for providing better services to their patrons. They have to introduce new technologies in order to ...
KIDA Takuya, SAKAMOTO Hiroshi, SHIMOZONO Shinichi
IEICE technical report. Theoretical foundations of Computing   104(317) 1-7   Sep 2004
A space-efficient linear-time approximation algorithm for the grammar-based compression problem, which requests for a given string to find a smallest context-free grammar deriving the string, is presented. The algorithm consumes only O(g_* log g_*...
KIDA Takuya
IEICE technical report. Theoretical foundations of Computing   103(622) 61-68   Jan 2004
A variable length don't care (VLDC) pattern is a string pattern including gaps that can match any strings. Let P be a VLDC pattern and P be a set of strings that match to P. Given P and a string T, the problem we address is to answer whether T inc...
喜田拓也
情報科学技術フォーラム   FIT 2003 137-138-138   Aug 2003
Kida Takuya, Miyamoto Satoru, Takeda Masayuki
情報科学技術フォーラム一般講演論文集   2002(2) 55-56   Sep 2002
KIDA TAKUYA, TAKEDA MASAYUKI, SHINOHARA AYUMI
情報処理学会全国大会講演論文集   57th(1) 1.143-1.144-144   Oct 1998
KIDA TAKUYA, TAKEDA MASAYUKI, MIYAZAKI MASAMICHI, SHINOHARA AYUMU
電気関係学会九州支部連合大会講演論文集   50th 275   Oct 1997

Research Grants & Projects

 
Study on VF codes for Fast and Sophisticated Pattern Matching with High Compression Ratios
Grant-in-Aid for Scientific Research
Project Year: 2011 - 2013
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(A))
Project Year: 2008 - 2011    Investigator(s): Hiroki ARIMURA
(抄録なし)
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(B))
Project Year: 2008 - 2011    Investigator(s): Shin-ichi MINATO
(抄録なし)
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(若手研究(B))
Project Year: 2008 - 2010    Investigator(s): Takuya KIDA
I have studied high speed and advanced pattern matching over continuous data streams and also about compression technique for realizing that. For the former, I have proposed a pattern matching algorithm, named BPS, which is based on bit-parallel t...
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(特別推進研究)
Project Year: 2005 - 2007    Investigator(s): Hiroki ARIMURA
By rapid progress of network and storage technologies for the last decade, a huge amount of weakly structured electronic data of various types, called semi-structured data, become available over the Internet. In this research project, we study eff...
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(A))
Project Year: 2005 - 2007    Investigator(s): Seishi OKAMOTO
By the rapid progress of Internet and Web service technologies, a new kind of massive data called semistructured data emerged, where a semistructured data is a collection of weakly structured electronic data such as Web pages and XML documents. In...
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(B))
Project Year: 2005 - 2007    Investigator(s): Shin-Ichi MINATO
Binary Decision Diagrams (BDDs) are the efficient data structure for representing Boolean functions on the main memory. The techniques of BDD manipulation have been developed in the area of VLSI logic design since 1990's. Recently, we found that t...
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(B))
Project Year: 2004 - 2005    Investigator(s): Setsuo ARIKAWA
RFID technology is a core IT technology in the coming ubiquitous computing era. It has great features such as contactless communication, big memory, battery-less and so on. It will be used many services that have been provided with magnetic cards ...
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(B))
Project Year: 2003 - 2005    Investigator(s): 有村 博紀, Daisuke IKEDA
In this research, we investigated high-speed online knowledge discovery system for extracting useful information from massive semi-structured data streams. Particularly in this year, as theoretical researches, we extended further the theory of eff...
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(B))
Project Year: 2002 - 2003    Investigator(s): Setsuo ARIKAWA
RFID tag(ID tag) is a core IT technology in the coming ubiquitous computing era. It has great features such as contactless communication, big memory, battery-less and so on. It will be used virtually all services that have been provided with magne...
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(B))
Project Year: 2001 - 2003    Investigator(s): Ayumi SHINOHARA
Suffix trees and Directed Acyclic Word Graphs(DAWGs) are well-known data structures as efficient indexingstructures for strings. We focus on Compact Directed Acyclic Word Graphs(CDAWGs) which are more compact indexing structures, and showed online...