default search action
Akihiro Inokuchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c25]Naoya Funamoto, Akihiro Inokuchi:
Fast Subgraph Search with Graph Code Indices. DEXA (1) 2024: 43-58 - [i3]Jun Kato, Airi Mita, Keita Gobara, Akihiro Inokuchi:
Deep Graph Attention Networks. CoRR abs/2410.15640 (2024) - 2023
- [c24]Yuta Yajima, Jun Kato, Akihiro Inokuchi:
The Third Common Interface for Graph Neural Networks. IJCNN 2023: 1-8 - 2022
- [c23]Yuta Yajima, Akihiro Inokuchi:
Why Deeper Graph Neural Network Performs Worse? Discussion and Improvement About Deep GNNs. ICANN (2) 2022: 731-743 - 2021
- [j9]Masataka Yamada, Akihiro Inokuchi:
Similar Supergraph Search Based on Graph Edit Distance. Algorithms 14(8): 225 (2021) - 2020
- [j8]Shun Imai, Akihiro Inokuchi:
Efficient Supergraph Search Using Graph Coding. IEICE Trans. Inf. Syst. 103-D(1): 130-141 (2020) - [c22]Yuta Yajima, Akihiro Inokuchi:
Refining Similarity Matrices to Cluster Attributed Networks Accurately**. CANDAR (Workshops) 2020: 144-150 - [i2]Yuta Yajima, Akihiro Inokuchi:
Refining Similarity Matrices to Cluster Attributed Networks Accurately. CoRR abs/2010.06854 (2020)
2010 – 2019
- 2018
- [c21]Sousuke Takami, Akihiro Inokuchi:
Accurate and Fast Computation of Approximate Graph Edit Distance based on Graph Relabeling. ICPRAM 2018: 17-26 - 2017
- [c20]Xiaobo Xi, Akihiro Inokuchi:
Transition-based dependency parser with postponed determinations for Japanese sentences. IALP 2017: 281-284 - [c19]Tetsuya Kataoka, Eimi Shiotsuki, Akihiro Inokuchi:
Graph Classification with Mapping Distance Graph Kernels. ICPRAM (Revised Selected Papers) 2017: 21-44 - [c18]Tetsuya Kataoka, Eimi Shiotsuki, Akihiro Inokuchi:
Mapping Distance Graph Kernels using Bipartite Matching. ICPRAM 2017: 61-70 - 2016
- [c17]Sohei Okui, Kaho Osamura, Akihiro Inokuchi:
Detecting Smooth Cluster Changes in Evolving Graphs. ICMLA 2016: 369-374 - [c16]Tetsuya Kataoka, Akihiro Inokuchi:
Experimental Evaluation of Graph Classification with Hadamard Code Graph Kernels. ICPRAM (Revised Selected Papers) 2016: 1-19 - [c15]Tetsuya Kataoka, Akihiro Inokuchi:
Hadamard Code Graph Kernels for Classifying Graphs. ICPRAM 2016: 24-32 - 2012
- [j7]Akihiro Inokuchi, Takashi Washio:
FRISSMiner: Mining Frequent Graph Sequence Patterns Induced by Vertices. IEICE Trans. Inf. Syst. 95-D(6): 1590-1602 (2012) - [j6]Akihiro Inokuchi, Hiroaki Ikuta, Takashi Washio:
Efficient Graph Sequence Mining Using Reverse Search. IEICE Trans. Inf. Syst. 95-D(7): 1947-1958 (2012) - [c14]Akihiro Inokuchi, Ayumu Yamaoka:
Mining Rules for Rewriting States in a Transition-based Dependency Parser for English. COLING 2012: 1275-1290 - [c13]Akihiro Inokuchi, Ayumu Yamaoka, Takashi Washio, Yuji Matsumoto, Masayuki Asahara
, Masakazu Iwatate, Hideto Kazawa:
Mining Rules for Rewriting States in a Transition-Based Dependency Parser. PRICAI 2012: 133-145 - 2011
- [i1]Akihiro Inokuchi, Hiroaki Ikuta, Takashi Washio:
GTRACE-RS: Efficient Graph Sequence Mining using Reverse Search. CoRR abs/1110.3879 (2011) - 2010
- [j5]Akihiro Inokuchi, Takashi Washio:
GTRACE: Mining Frequent Subsequences from Graph Sequences. IEICE Trans. Inf. Syst. 93-D(10): 2792-2804 (2010) - [c12]Nguyen Duy Vinh, Akihiro Inokuchi, Takashi Washio:
Graph Classification Based on Optimizing Graph Spectra. Discovery Science 2010: 205-220 - [c11]Akihiro Inokuchi, Takashi Washio:
GTRACE2: Improving Performance Using Labeled Union Graphs. PAKDD (2) 2010: 178-188 - [c10]Akihiro Inokuchi, Takashi Washio:
Mining Frequent Graph Sequence Patterns Induced by Vertices. SDM 2010: 466-477
2000 – 2009
- 2009
- [e4]Sanjay Chawla, Takashi Washio, Shin-ichi Minato, Shusaku Tsumoto, Takashi Onoda, Seiji Yamada, Akihiro Inokuchi:
New Frontiers in Applied Data Mining, PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers. Lecture Notes in Computer Science 5433, Springer 2009, ISBN 978-3-642-00398-1 [contents] - 2008
- [c9]Akihiro Inokuchi, Takashi Washio:
A Fast Method to Mine Frequent Subsequences from Graph Sequence Data. ICDM 2008: 303-312 - [c8]Hisashi Kashima, Kazutaka Yamasaki, Akihiro Inokuchi, Hiroto Saigo:
Regression with interval output values. ICPR 2008: 1-4 - [e3]Ken Satoh, Akihiro Inokuchi, Katashi Nagao, Takahiro Kawamura:
New Frontiers in Artificial Intelligence, JSAI 2007 Conference and Workshops, Miyazaki, Japan, June 18-22, 2007, Revised Selected Papers. Lecture Notes in Computer Science 4914, Springer 2008, ISBN 978-3-540-78196-7 [contents] - [e2]Takashi Washio, Einoshin Suzuki, Kai Ming Ting, Akihiro Inokuchi:
Advances in Knowledge Discovery and Data Mining, 12th Pacific-Asia Conference, PAKDD 2008, Osaka, Japan, May 20-23, 2008 Proceedings. Lecture Notes in Computer Science 5012, Springer 2008, ISBN 978-3-540-68124-3 [contents] - 2007
- [j4]Akihiro Inokuchi, Koichi Takeda, Noriko Inaoka, Fumihiko Wakao:
MedTAKMI-CDI: Interactive knowledge discovery for clinical decision intelligence. IBM Syst. J. 46(1): 115-134 (2007) - [c7]Akihiro Inokuchi, Koichi Takeda:
A method for online analytical processing of text data. CIKM 2007: 455-464 - [e1]Takashi Washio, Ken Satoh, Hideaki Takeda
New Frontiers in Artificial Intelligence, JSAI 2006 Conference and Workshops, Tokyo, Japan, June 5-9 2006, Revised Selected Papers. Lecture Notes in Computer Science 4384, Springer 2007, ISBN 3-540-69901-5 [contents] - 2005
- [j3]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda:
A General Framework for Mining Frequent Subgraphs from Labeled Graphs. Fundam. Informaticae 66(1-2): 53-82 (2005) - 2004
- [j2]Robert L. Mack, Sougata Mukherjea
Text analytics for life science using the Unstructured Information Management Architecture. IBM Syst. J. 43(3): 490-515 (2004) - [c6]Akihiro Inokuchi:
Mining Generalized Substructures from a Set of Labeled Graphs. ICDM 2004: 415-418 - 2003
- [j1]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda:
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data. Mach. Learn. 50(3): 321-354 (2003) - [c5]Akihiro Inokuchi, Hisashi Kashima:
Mining Significant Pairs of Patterns from Graph Structures with Class Labels. ICDM 2003: 83-90 - [c4]Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi:
Marginalized Kernels Between Labeled Graphs. ICML 2003: 321-328 - 2000
- [c3]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda:
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. PKDD 2000: 13-23
1990 – 1999
- 1999
- [c2]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda:
Derivation of the Topology Structure from Massive Graph Data. Discovery Science 1999: 330-332 - [c1]Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda, Kouhei Kumasawa, Naohide Arai:
Basket Analysis for Graph Structured Data. PAKDD 1999: 420-431
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-27 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: