Akihiro Inokuchi Department of Advance Reasoning (Motoda Laboratory), Division of Intelligent Systems Science, The Institute of Scientific and Industrial Research, Osaka University Tokyo Research Laboratory, IBM Japan Ltd.,

E-mail:inokuchi@jp.ibm.com

Personal History

• Department of Communication Engineering , Osaka University (April, 1996 to March, 1998)
• Master Course of Department of Communication Engineering, Graduate School of Engineering, Osaka University (April, 1998 to March, 2000)
• Tokyo research Laboratory, IBM Japan Ltd., (Since April, 2000)
• PhD. Course of Department of Communication Engineering, Graduate School of Engineering, Osaka University (Since April, 2003)

Award

• 2002 JCAC(Journal of Computer Aided Chemistry) best paper award

Academic Activities

• Editorial board of Japanese Society of Artificial Intelligence (2002/7-2004/6)
• Program Committee of International Conference on Machine Learning (ICML 2002) [link]
• Industry Track Program Committee of the 2nd IEEE International Conference on Data Mining (ICDM 2002)
• Program Committee of International Workshop on Active Mining (AM 2002) [link]
• Program Committee of 1st International Workshop on Mining Graphs, Trees and Sequences (MGTS 2003) [link]

Publications

• Journals
  • Complete Mining of Frequent Patterns from Graphs: Mining Graph Data, Akihiro Inokuchi, Takashi Washio and Hiroshi Motoda, Machine Learning, 50 (3): 321-354, March 2003, [link]
  • Applying the Apriori-based Graph Mining Method to Mutagenesis Data Analysis, Akihiro Inokuchi, Takashi Washio, Takashi Okada and Hiroshi Motoda, Journal of Computer Aided Chemistry, Vol.2 (2001), (pp.87-pp.92) (2002 JCAC Best Paper Award) [link]
  • Fast and Complete Mining Method for Frequent Graph Patterns, Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda, Kohei Kumazawa and Naohide Arai, Journal of Japanese Society for Artificial IntelligenceVol.15 No.6(2000), pp.1052-1063 (Japanese)
• International Conference and Workshop
  • General Framework for Frequent Structure Mining, Akihiro Inokuchi, Takashi Washio and Hiroshi Motoda, 6th SANKEN International Symposium, pp.85-86
  • General Framework for Mining Frequent Patterns from Structures, Akihiro Inokuchi, Takashi Washio, Yoshio Nishimura and Hiroshi Motoda, International Workshop on Active Mining (AM 2002) pp.23- 30
  • Kernels for Graph Classification, Hisashi Kashima, Akihiro Inokuchi, International Workshop on Active Mining (AM 2002), pp.31-36
  • An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data, Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda, the 4th European Conference on Principles and Practice of Knowledge Discovery and Data Mining (PKDD2000), pp.13-23 [link]
  • Applying Algebraic Mining Method of Graph Substructures to Mutagenesis Data Analysis, Akihiro Inokuchi, Takashi Washio, Takashi Okada and Hiroshi Motoda, Internal Workshop of KDD Challenge on Real-world Data (in conjunction with PAKDD2000)
  • Derivation of the Topology Structure from Massive Graph Data, Akihiro Inokuchi, Takashi Washio and Hiroshi Motoda, the 2nd International Conference on Discovery Science (DS1999), pp.330-332
  • Basket Analysis for Graph Structured Data, Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda, Kohei Kumazawa and Naohide Arai, the 3rd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD1999), pp.420-431
• Other
  • A Fast Algorithm for Mining Frequent Connected Graphs, Akihiro Inokuchi,Takashi Washio, Nishimura Yoshio and Hiroshi Motoda, IBM Research Report, RT0448, (February/2002) [pdf]

Go back to members home page

Go back to Motoda Laboratory's Home Page

Go to Tokyo Research Laboratory