Selected Publications

• Yasuhiro TAJIMA, Kouzou TAGASHIRA, Genichiro KIKUI,
  Heuristics for Daihinmin and their effectiveness,
  International Journal of Computer and Information Science, vol.17, no.2, pp.7--14, Jul. 2016.
  (selected paper from the following ACIT2015)
• Yasuhiro TAJIMA, Kouzou TAGASHIRA,
  Heuristics for Daihinmin and their effectiveness ,
  Applied Computing and Information Technology (ACIT2015), Studies in Computational Intelligence 619, pp.59--69, Dec. 2015.
• Yasuhiro TAJIMA, Yoshihiro SUWA, Genichiro KIKUI, Rikako INOUE et al.
  Recipe clustering based on Japanese Food Guide Spinning Top,
  Proceedings of the 21st International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA'15, pp.304--309, July 2015.
• Yasuhiro TAJIMA, Genichiro KIKUI, Rikako INOUE et al.,
  OPU at NTCIR-11 RecipeSearch: Japanese Recipe Pairing by Naive Bayes Estimation with Names of Ingredients,
  Proceedings of the 11th NTCIR Conference on Evaluation of Information Access Technologies, pp.497--498, Dec. 2014.
• Yasuhiro TAJIMA and Genichiro KIKUI,
  An example distribution for probabilistic query learning of simple deterministic languages,
  Journal of Machine Learning Research, Workshop and Conference Proceedings, vol.34, pp.182--192, Sep. 2014. (The 12th International Conference on Grammatical Inference ICGI2014)
• Yasuhiro TAJIMA and Genichiro KIKUI,
  Emotion estimation of comments on web news by SVM and naive Bayes based classifiers,
  Proceedings of the 2014 International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA'14, pp.189--194, July 2014.
• Yasuhiro TAJIMA,
  Teachability of a subclass of simple deterministic languages,
  IEICE Transactions on Information and Systems, vol.E96-D, no.12, pp. 2733--2742, Dec. 2013.
• Yasuhiro TAJIMA,
  Performance Comparison between Different Language Models on a Text Segmentation Problem via HMM,
  IPSJ Transactions on Mathematical Modeling and its Applications, vol.6, no.1, pp.38--46, Mar. 2013. (in Japanese)
• Yasuhiro TAJIMA, Daizo KITADE, Michiko NAKANO, Tomo NAKABAYASHI, Koji FUJIMOTO and Yoshiyuki KOTANI,
  A Dialogue Segmentation Method via HMM and a Text Classifier,
  IPSJ Transactions on Mathematical Modeling and its Applications, vol.2, no.2, pp.70--79, Mar. 2009. (in Japanese)
• Yasuhiro TAJIMA and Yoshiyuki KOTANI,
  Polynomial time probabilistic learning of a subclass of linear languages with queries,
  Lecture Notes in Artificial Intelligence 5278, pp.187--199, Sep. 2008. (Proceedings of the 9th International Colloquium on Grammatical Inference ICGI2008)
• Yasuhiro TAJIMA and Yoshiyuki KOTANI,
  A grammar acquisition system for sequential data from characteristic examples and queries,
  Proceedings of the 10th World Conference on Integrated Design and Process Technology (IDPT2007), pp.338--343, June 2007.
• Yasuhiro TAJIMA and Yoshiyuki KOTANI,
  Finding suitable keywords for a web page from caches based on similarity and frequency,
  Proceedings of the 3rd International Conference on Web Information Systems and Technologies WEBIST2007, vol.WIA, pp.474--477, Mar. 2007.
• Kanako Komiya, Yasuhiro Tajima, Nobuo Inui, Yoshiyuki Kotani,
  Generating a Set of Rules to Determine Honorific Expression Using Decision Tree Learning,
  Lecture Notes in Computer Science 3878, pp.315--318, Jan. 2006. (Proceedings of the Conference on Intelligent Text Processing and Computational Linguistics CICLING2006)
• Yasuhiro TAJIMA, Yoshiyuki KOTANI, Matsuaki TERADA,
  Polynomial time learnability of a sub-class of linear languages,
  IPSJ Transactions on Mathematical Modeling and its Applications, vol.46, no.SIG17(TOM13), pp.20--30, Dec. 2005. (Information and Media Technologies, vol.1, no.1, pp.231--241, June 2006)
• Yasuhiro TAJIMA, Yoshiyuki KOTANI,
  A restricted sample distribution of simple deterministic languages and its learnability,
  Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA'05, vol.II, pp.427--432, June 2005.
• Yasuhiro TAJIMA, Etsuji TOMITA, Mitsuo WAKATSUKI and Matsuaki TERADA,
  Polynomial time learning of simple deterministic languages via queries and a representative sample,
  Theoretical Computer Science, vol.329, nos.1-3, pp.203--221, Dec. 2004.
  (Top 25 Hottest Articles, 4th at 2004.10-12, 14th at 2005.4-6)
• Yasuhiro TAJIMA, Yoshiyuki KOTANI and Matsuaki TERADA,
  An analysis of examples and search space for PAC learning of simple deterministic languages with membership queries,
  Lecture Notes in Artificial Intelligence 3264, pp.288--289, Oct. 2004. (Proceedings of the 7th International Colloquium on Grammatical Inference ICGI2004)
• Yasuhiro TAJIMA, Yoshiyuki KOTANI and Matsuaki TERADA,
  Polynomial time PAC learnability of a sub-class of linear languages,
  Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA'04, vol.I, pp.338--344, June 2004.
• Yasutaka OTAKE, Yasuhiro TAJIMA and Matsuaki TERADA,
  A SIP-based Voice Mail-System with Voice Recognition,
  Lecture Notes in Computer Science 3090, pp.985--994, Aug. 2004. (selected papers from the International Conference on Information Networking 2004 ICOIN2004)
• Yasuhiro TAJIMA and Matsuaki TERADA,
  A process model for application layer data by packet handling,
  Proceedings of the 2nd International Workshop on Active Network Technologies and Applications ANTA2003, pp.203--210, May 2003.
• Yasuhiro TAJIMA and Matsuaki TERADA,
  A PAC learnability of simple deterministic languages,
  Lecture Notes in Artificial Intelligence 2484, pp.249--260, Sep. 2002. (Proceedings of the 6th International Colloquium on Grammatical Inference ICGI2002)
• Yasuhiro TAJIMA and Etsuji TOMITA,
  A polynomial time learning algorithm of simple deterministic languages via membership queries and a representative sample,
  Lecture Notes in Artificial Intelligence 1891, pp.284--297, Sep. 2000. (Proceedings of the 5th International Colloquium on Grammatical Inference ICGI2000)
• Yasuhiro TAJIMA, Etsuji TOMITA and Mitsuo WAKATSUKI,
  Polynomial time learnability of simple deterministic languages from MAT and a representative sample,
  IEICE Transactions on Information and Systems, vol.E83-D, no.4, pp.757--765, April 2000.