Tomohiro Odaka

Tomohiro Odaka

Auto-generated profile, based on publicly available information

Tomohiro Odaka

Graduate School of Engineering, University of Fukui

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

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

Representative Publications

View All Publications
1 January 1997 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
HOHisakazu Ogura
Hisakazu Ogura
HAHideyuki Agata
Hideyuki Agata
MXMengchun Xie
Mengchun Xie
TOTomohiro Odaka
Tomohiro Odaka
HFHiroshi Furutani
Hiroshi Furutani

1 January 2014 in IEICE Transactions on Information and Systems
Verified
Journal Article
Open access
QLQing Liu
Qing Liu
TOTomohiro Odaka
Tomohiro Odaka
JKJousuke Kuroiwa
Jousuke Kuroiwa
HSHaruhiko Shirai
Haruhiko Shirai
HOHisakazu Ogura
Hisakazu Ogura

1 January 2014 in IEICE Transactions on Communications
Verified
Journal Article
Closed access
PDF file
QLQing Liu
Qing Liu
TOTomohiro Odaka
Tomohiro Odaka
JKJousuke Kuroiwa
Jousuke Kuroiwa
HSHaruhiko Shirai
Haruhiko Shirai
HOHisakazu Ogura
Hisakazu Ogura
This paper presents an artificial fish swarm algorithm (AFSA) to solve the multicast routing problem, which is abstracted as a Steiner tree problem in graphs. AFSA adopts a 0-1 encoding scheme to represent the artificial fish (AF), which are then subgraphs in the original graph. For evaluating each AF individual, we decode the subgraph into a Steiner tree. Based on the adopted representation of the AF, we design three AF behaviors: randomly moving, preying, and following. These behaviors are organized by a strategy that guides AF individuals to perform certain behaviors according to certain conditions and circumstances. In order to investigate the performance of our algorithm, we implement exhaustive simulation experiments. The results from the experiments indicate that the proposed algorithm outperforms other intelligence algorithms and can obtain the least-cost multicast routing tree in most cases.

1 January 2023 in Nonlinear Theory and Its Applications, IEICE
Verified
Journal Article
Open access
PDF file
STShiori Takenaka
Shiori Takenaka
JKJousuke Kuroiwa
Jousuke Kuroiwa
TOTomohiro Odaka
Tomohiro Odaka
Word vectors are applied various tasks in natural language processing. However, the potentiality of the word vectors of Japanese has not been discussed as much as those of English. Therefore, the purpose of this paper is to classify the genre of modern Japanese literary works using characteristic features evaluated by the word vectors. The accuracy of the classification between novels and poetic works was 95%, and the one between novels and essays was 90%. The word vectors are applicable in the genre classification problem in modern Japanese literary works.

1 January 2025 in Nonlinear Theory and Its Applications, IEICE
Verified
Journal Article
Open access
PDF file
TYTakeshi Yamaguchi
Takeshi Yamaguchi
YMYuya Matsuda
Yuya Matsuda
JKJousuke Kuroiwa
Jousuke Kuroiwa
TOTomohiro Odaka
Tomohiro Odaka
In this study, we propose a hierarchical classification approach based on deep learning to address imbalanced data in dialogue act estimation. Using the CEJC corpus, we classified 20 dialogue acts across six levels, employing Word2Vec for feature extraction and SVM for classification. The proposed approach achieved a 73.07% accuracy and a weighted F1-score of 70.39 in testing. Levels with distinctive dialogue acts showed high accuracy, whereas overlapping features or insufficient data posed challenges. These results demonstrate the effectiveness of hierarchical classification for dialogue act estimation and highlight areas for further improvement, particularly in handling data imbalance and enhancing feature representation.

1 January 2023 in Nonlinear Theory and Its Applications, IEICE
Verified
Journal Article
Open access
PDF file
SNShota Nakayama
Shota Nakayama
JKJousuke Kuroiwa
Jousuke Kuroiwa
TOTomohiro Odaka
Tomohiro Odaka
In the present paper, we investigate the dynamical features of the rule sequence at each time step which realize the description of digital sound data. From previous research, we have performed the description with the limited number of 256 rules of three-rules sets of one dimensional cellular automata with two states and three neighbors referred as to 1-2-3 CA hereafter for various digital sounds and Huffman coding, and have successfully achieved a fully compressed description of the target sound data without reproducing the error. In order to investigate the dynamical features of the rule sequences at each time step, we perform numerical Wolfram's classification method. From computer experiments, in Pronounced word data, all the rule sequences are composed with Wolfram's class1, 2 and 4, whereas in musical data, all the rule sequences are composed with Wolfram's class2 and 4. Thus, we have succeed to classify the rule sequences among the genres of data.