Derivation of the Topology Structure from Massive Graph Data. - Akihiro Inokuchi; Takashi Washio; Hiroshi Motoda (Discovery Science, 1999)

Basket Analysis for Graph Structured Data. - Akihiro Inokuchi; Takashi Washio; Hiroshi Motoda; Kouhei Kumasawa; Naohide Arai (PAKDD, 1999)

An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. - Akihiro Inokuchi; Takashi Washio; Hiroshi Motoda (PKDD, 2000)

Mining Significant Pairs of Patterns from Graph Structures with Class Labels. - Akihiro Inokuchi; Hisashi Kashima (ICDM, 2003)

Marginalized Kernels Between Labeled Graphs. - Hisashi Kashima; Koji Tsuda; Akihiro Inokuchi (ICML, 2003)

Complete Mining of Frequent Patterns from Graphs: Mining Graph Data. - Akihiro Inokuchi; Takashi Washio; Hiroshi Motoda (Mach. Learn., 2003)

Mining Generalized Substructures from a Set of Labeled Graphs. - Akihiro Inokuchi (ICDM, 2004)

Text analytics for life science using the Unstructured Information Management Architecture. - Robert L. Mack; Sougata Mukherjea; Aya Soffer; Naohiko Uramoto; Eric W. Brown 001; Anni Coden; James W. Cooper; Akihiro Inokuchi; Bhavani Iyer; Yosi Mass; Hirofumi Matsuzawa; L. Venkata Subramaniam (IBM Syst. J., 2004)

A General Framework for Mining Frequent Subgraphs from Labeled Graphs. - Akihiro Inokuchi; Takashi Washio; Hiroshi Motoda (Fundam. Informaticae, 2005)

A method for online analytical processing of text data. - Akihiro Inokuchi; Koichi Takeda 002 (CIKM, 2007)

MedTAKMI-CDI: Interactive knowledge discovery for clinical decision intelligence. - Akihiro Inokuchi; Koichi Takeda 002; Noriko Inaoka; Fumihiko Wakao (IBM Syst. J., 2007)

A Fast Method to Mine Frequent Subsequences from Graph Sequence Data. - Akihiro Inokuchi; Takashi Washio (ICDM, 2008)

Regression with interval output values. - Hisashi Kashima; Kazutaka Yamasaki; Akihiro Inokuchi; Hiroto Saigo (ICPR, 2008)

Graph Classification Based on Optimizing Graph Spectra. - Nguyen Duy Vinh; Akihiro Inokuchi; Takashi Washio (Discovery Science, 2010)

GTRACE2: Improving Performance Using Labeled Union Graphs. - Akihiro Inokuchi; Takashi Washio (PAKDD (2), 2010)

Mining Frequent Graph Sequence Patterns Induced by Vertices. - Akihiro Inokuchi; Takashi Washio (SDM, 2010)

GTRACE: Mining Frequent Subsequences from Graph Sequences. - Akihiro Inokuchi; Takashi Washio (IEICE Trans. Inf. Syst., 2010)

GTRACE-RS: Efficient Graph Sequence Mining using Reverse Search - Akihiro Inokuchi; Hiroaki Ikuta; Takashi Washio (CoRR, 2011)

Mining Rules for Rewriting States in a Transition-based Dependency Parser for English. - Akihiro Inokuchi; Ayumu Yamaoka (COLING, 2012)

Mining Rules for Rewriting States in a Transition-Based Dependency Parser. - Akihiro Inokuchi; Ayumu Yamaoka; Takashi Washio; Yuji Matsumoto 001; Masayuki Asahara; Masakazu Iwatate; Hideto Kazawa (PRICAI, 2012)

Efficient Graph Sequence Mining Using Reverse Search. - Akihiro Inokuchi; Hiroaki Ikuta; Takashi Washio (IEICE Trans. Inf. Syst., 2012)

FRISSMiner: Mining Frequent Graph Sequence Patterns Induced by Vertices. - Akihiro Inokuchi; Takashi Washio (IEICE Trans. Inf. Syst., 2012)

Detecting Smooth Cluster Changes in Evolving Graphs. - Sohei Okui; Kaho Osamura; Akihiro Inokuchi (ICMLA, 2016)

Hadamard Code Graph Kernels for Classifying Graphs. - Tetsuya Kataoka; Akihiro Inokuchi (ICPRAM, 2016)

Experimental Evaluation of Graph Classification with Hadamard Code Graph Kernels. - Tetsuya Kataoka; Akihiro Inokuchi (ICPRAM (Revised Selected Papers), 2016)

Transition-based dependency parser with postponed determinations for Japanese sentences. - Xiaobo Xi; Akihiro Inokuchi (IALP, 2017)

Mapping Distance Graph Kernels using Bipartite Matching. - Tetsuya Kataoka; Eimi Shiotsuki; Akihiro Inokuchi (ICPRAM, 2017)

Graph Classification with Mapping Distance Graph Kernels. - Tetsuya Kataoka; Eimi Shiotsuki; Akihiro Inokuchi (ICPRAM (Revised Selected Papers), 2017)

Accurate and Fast Computation of Approximate Graph Edit Distance based on Graph Relabeling. - Sousuke Takami; Akihiro Inokuchi (ICPRAM, 2018)

Refining Similarity Matrices to Cluster Attributed Networks Accurately**. - Yuta Yajima; Akihiro Inokuchi (CANDAR (Workshops), 2020)

Refining Similarity Matrices to Cluster Attributed Networks Accurately. - Yuta Yajima; Akihiro Inokuchi (CoRR, 2020)

Efficient Supergraph Search Using Graph Coding. - Shun Imai; Akihiro Inokuchi (IEICE Trans. Inf. Syst., 2020)

Similar Supergraph Search Based on Graph Edit Distance. - Masataka Yamada; Akihiro Inokuchi (Algorithms, 2021)

Why Deeper Graph Neural Network Performs Worse? Discussion and Improvement About Deep GNNs. - Yuta Yajima; Akihiro Inokuchi (ICANN (2), 2022)

The Third Common Interface for Graph Neural Networks. - Yuta Yajima; Jun Kato 008; Akihiro Inokuchi (IJCNN, 2023)

Deep Graph Attention Networks. - Jun Kato 008; Airi Mita; Keita Gobara; Akihiro Inokuchi (CANDARW, 2024)

Fast Subgraph Search with Graph Code Indices. - Naoya Funamoto; Akihiro Inokuchi (DEXA (1), 2024)