default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakayoshi Shoudai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Takayoshi Shoudai, Satoshi Matsumoto, Yusuke Suzuki, Tomoyuki Uchida, Tetsuhiro Miyahara:
Parameterized Formal Graph Systems and Their Polynomial-Time PAC Learnability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(6): 896-906 (2023)- 2020
- [j17]Satoshi Matsumoto, Tomoyuki Uchida, Takayoshi Shoudai, Yusuke Suzuki, Tetsuhiro Miyahara:
An Efficient Learning Algorithm for Regular Pattern Languages Using One Positive Example and a Linear Number of Membership Queries. IEICE Trans. Inf. Syst. 103-D(3): 526-539 (2020)
2010 – 2019
- 2019
- [j16]Tomoyuki Uchida, Satoshi Matsumoto, Takayoshi Shoudai, Yusuke Suzuki, Tetsuhiro Miyahara:
Exact Learning of Primitive Formal Systems Defining Labeled Ordered Tree Languages via Queries. IEICE Trans. Inf. Syst. 102-D(3): 470-482 (2019) - 2018
- [j15]Takayoshi Shoudai, Yuta Yoshimura, Yusuke Suzuki, Tomoyuki Uchida, Tetsuhiro Miyahara:
Polynomial Time Learnability of Graph Pattern Languages Defined by Cographs. IEICE Trans. Inf. Syst. 101-D(3): 582-592 (2018) - [j14]Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida, Satoshi Matsumoto, Yusuke Suzuki:
An Efficient Pattern Matching Algorithm for Unordered Term Tree Patterns of Bounded Dimension. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1344-1354 (2018) - 2017
- [j13]Takayoshi Shoudai, Kazuhide Aikoh, Yusuke Suzuki, Satoshi Matsumoto, Tetsuhiro Miyahara, Tomoyuki Uchida:
Polynomial Time Inductive Inference of Languages of Ordered Term Tree Patterns with Height-Constrained Variables from Positive Data. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(3): 785-802 (2017) - [j12]Takayoshi Shoudai, Takashi Yamada:
A Polynomial Time Pattern Matching Algorithm on Graph Patterns of Bounded Treewidth. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1764-1772 (2017) - [c46]Tomoyuki Uchida, Satoshi Matsumoto, Takayoshi Shoudai, Yusuke Suzuki, Tetsuhiro Miyahara:
Learning of Primitive Formal Systems Defining Labelled Ordered Tree Languages via Queries. ILP (Late Breaking Papers) 2017: 61-66 - 2016
- [c45]Takayoshi Shoudai, Satoshi Matsumoto, Yusuke Suzuki:
Distributional Learning of Regular Formal Graph System of Bounded Degree. ILP 2016: 68-80 - 2015
- [j11]Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
An Efficient Pattern Matching Algorithm for Ordered Term Tree Patterns. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1197-1211 (2015) - 2014
- [c44]Seiya Hara, Takayoshi Shoudai:
Polynomial Time Mat Learning of C-deterministic Regular Formal Graph Systems. IIAI-AAI 2014: 204-211 - 2013
- [c43]Yasuhiro Okamoto, Takayoshi Shoudai:
Hardness of Learning Unordered Tree Contraction Patterns. IIAI-AAI 2013: 141-146 - [c42]Hisashi Tsuruta, Takayoshi Shoudai:
Structure-based Data Mining and Screening for Network Traffic Data. IIAI-AAI 2013: 152-157 - 2012
- [c41]Yuta Yoshimura, Takayoshi Shoudai:
Learning Unordered Tree Contraction Patterns in Polynomial Time. ILP 2012: 257-272 - 2011
- [j10]Takashi Yamada, Takayoshi Shoudai:
Efficient Pattern Matching on Graph Patterns of Bounded Treewidth. Electron. Notes Discret. Math. 37: 117-122 (2011) - [c40]Takashi Yamada, Takayoshi Shoudai:
Graph Contraction Pattern Matching for Graphs of Bounded Treewidth. ILP (Late Breaking Papers) 2011: 173-180 - [c39]Yuta Yoshimura, Takayoshi Shoudai, Yusuke Suzuki, Tomoyuki Uchida, Tetsuhiro Miyahara:
Polynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data. ILP 2011: 389-404
2000 – 2009
- 2009
- [j9]Hitoshi Yamasaki, Takayoshi Shoudai:
A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern. IEICE Trans. Inf. Syst. 92-D(2): 120-129 (2009) - [j8]Ryoji Takami, Yusuke Suzuki, Tomoyuki Uchida, Takayoshi Shoudai:
Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data. IEICE Trans. Inf. Syst. 92-D(2): 181-190 (2009) - [j7]Hitoshi Yamasaki, Yosuke Sasaki, Takayoshi Shoudai, Tomoyuki Uchida, Yusuke Suzuki:
Learning block-preserving graph patterns and its application to data mining. Mach. Learn. 76(1): 137-173 (2009) - 2008
- [j6]Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara, Yusuke Suzuki:
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries. IEICE Trans. Inf. Syst. 91-D(2): 222-230 (2008) - [c38]Hitoshi Yamasaki, Takayoshi Shoudai:
Mining of Frequent Externally Extensible Outerplanar Graph Patterns. ICMLA 2008: 871-876 - [c37]Hitoshi Yamasaki, Yosuke Sasaki, Takayoshi Shoudai, Tomoyuki Uchida, Yusuke Suzuki:
Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining. ILP 2008: 330-347 - 2007
- [c36]Rika Okada, Satoshi Matsumoto, Tomoyuki Uchida, Yusuke Suzuki, Takayoshi Shoudai:
Exact Learning of Finite Unions of Graph Patterns from Queries. ALT 2007: 298-312 - [c35]Yosuke Sasaki, Hitoshi Yamasaki, Takayoshi Shoudai, Tomoyuki Uchida:
Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns. ILP 2007: 239-253 - [c34]Hitoshi Yamasaki, Takayoshi Shoudai:
A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns. TAMC 2007: 67-78 - 2006
- [j5]Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
Ordered term tree languages which are polynomial time inductively inferable from positive data. Theor. Comput. Sci. 350(1): 63-90 (2006) - 2005
- [c33]Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables. CPM 2005: 346-357 - [c32]Ryoji Takami, Yusuke Suzuki, Tomoyuki Uchida, Takayoshi Shoudai, Yasuaki Nakamura:
Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data. ILP 2005: 366-383 - [c31]Yusuke Suzuki, Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Yasuaki Nakamura:
Discovery of Maximally Frequent Tag Tree Patterns with Height-Constrained Variables from Semistructured Web Documents. WIRI 2005: 104-112 - 2004
- [c30]Satoshi Matsumoto, Takayoshi Shoudai:
Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries. ALT 2004: 425-439 - [c29]Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara:
Automatic Wrapper Generation for Metasearch Using Ordered Tree Structured Patterns. Australian Conference on Artificial Intelligence 2004: 1030-1035 - [c28]Tetsuhiro Miyahara, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda:
Discovery of Maximally Frequent Tag Tree Patterns with Contractible Variables from Semistructured Documents. PAKDD 2004: 133-144 - [c27]Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tetsuhiro Miyahara:
Polynomial Time Inductive Inference of Ordered Tree Languages with Height-Constrained Variables from Positive Data. PRICAI 2004: 211-220 - 2003
- [c26]Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida, Tetsuhiro Miyahara:
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables. ALT 2003: 114-128 - [c25]Satoshi Matsumoto, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida:
Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries. ALT 2003: 144-158 - [c24]Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida:
Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data. ILP 2003: 347-364 - [c23]Kazunori Yamagata, Tomoyuki Uchida, Takayoshi Shoudai, Yasuaki Nakamura:
An Effective Grammar-Based Compression Algorithm for Tree Structured Data. ILP 2003: 383-400 - [c22]Tetsuhiro Miyahara, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Sachio Hirokawa, Kenichi Takahashi, Hiroaki Ueda:
Extraction of Tag Tree Patterns with Contractible Variables from Irregular Semistructured Data. PAKDD 2003: 430-436 - [c21]Yuko Itokawa, Tomoyuki Uchida, Takayoshi Shoudai, Tetsuhiro Miyahara, Yasuaki Nakamura:
Finding Frequent Subgraphs from Graph Structured Data with Geometric Information and Its Application to Lossless Compression. PAKDD 2003: 582-594 - 2002
- [c20]Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data. ALT 2002: 188-202 - [c19]Satoshi Matsumoto, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida:
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries. Australian Joint Conference on Artificial Intelligence 2002: 523-534 - [c18]Yusuke Suzuki, Ryuta Akanuma, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida:
Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data. COLT 2002: 169-184 - [c17]Osamu Maruyama, Takayoshi Shoudai, Satoru Miyano:
Toward Drawing an Atlas of Hypothesis Classes: Approximating a Hypothesis via Another Hypothesis Model. Discovery Science 2002: 220-232 - [c16]Tsunenori Mine, Akira Suganuma, Takayoshi Shoudai:
A Support for Navigation Path Planning with Adaptive Previewing for Web-Based Learning. ICCE 2002: 1250-1251 - [c15]Yusuke Suzuki, Kohtaro Inomae, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida:
A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data. ILP 2002: 270-284 - [c14]Tetsuhiro Miyahara, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda:
Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents. PAKDD 2002: 341-355 - [c13]Kazuyoshi Furukawa, Tomoyuki Uchida, Kazuya Yamada, Tetsuhiro Miyahara, Takayoshi Shoudai, Yasuaki Nakamura:
Extracting Characteristic Structures among Words in Semistructured Documents. PAKDD 2002: 356-367 - 2001
- [c12]Osamu Maruyama, Takayoshi Shoudai, Emiko Furuichi, Satoru Kuhara, Satoru Miyano:
Learning Conformation Rules. Discovery Science 2001: 243-257 - [c11]Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables. FCT 2001: 335-346 - [c10]Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda:
Discovery of Frequent Tree Structured Patterns in Semistructured Web Documents. PAKDD 2001: 47-52 - 2000
- [c9]Tomoyuki Uchida, Yuko Itokawa, Takayoshi Shoudai, Tetsuhiro Miyahara, Yasuaki Nakamura:
A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System. ALT 2000: 141-155 - [c8]Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda:
Polynomial Time Matching Algorithms for Tree-Like Structured Patterns in Knowledge Discovery. PAKDD 2000: 5-16 - [c7]Tsunenori Mine, Takayoshi Shoudai, Akira Suganuma:
Automatic Exercise Generator with Tagged Documents Considering Lerner's Performance. WebNet 2000: 779-780
1990 – 1999
- 1999
- [c6]Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida, Satoshi Matsumoto:
Inductive Inference of Regular Term Free Languages and Its Application to Knowledge Discovery. EJC 1999: 85-102 - [c5]Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuji Kuboyama
, Kenichi Takahashi, Hiroaki Ueda:
Discovering New Knowledge from Graph Data Using Inductive Logic Programming. ILP 1999: 222-233 - 1998
- [c4]Osamu Maruyama, Tomoyuki Uchida, Takayoshi Shoudai, Satoru Miyano:
Toward Genomic Hypothesis Creator: View Designer for Discovery. Discovery Science 1998: 105-116 - 1997
- [c3]Satoshi Matsumoto, Yukiko Hayashi, Takayoshi Shoudai:
Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data. ALT 1997: 212-227 - 1995
- [j4]Tomoyuki Uchida, Takayoshi Shoudai, Satoru Miyano:
Parallel Algorithms for Refutation Tree Problem on Formal Graph Systems. IEICE Trans. Inf. Syst. 78-D(2): 99-112 (1995) - [j3]Takayoshi Shoudai, Satoru Miyano:
Using Maximal Independent Sets to Solve Problems in Parallel. Theor. Comput. Sci. 148(1): 57-65 (1995) - [c2]Takayoshi Shoudai, Michael Lappe, Satoru Miyano, Ayumi Shinohara, Takeo Okazaki, Setsuo Arikawa, Tomoyuki Uchida, Shinichi Shimozono, Takeshi Shinohara, Satoru Kuhara:
BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences. ISMB 1995: 359-366 - 1992
- [j2]Takayoshi Shoudai:
A P-Complete Language Describable with Iterated Shuffle. Inf. Process. Lett. 41(5): 233-238 (1992) - 1991
- [c1]Takayoshi Shoudai:
Using Maximal Independent Sets to Solve Problems in Parallel. WG 1991: 126-134
1980 – 1989
- 1989
- [j1]Takayoshi Shoudai:
The Lexicographically First Topological Order Problem is NLOG-Complete. Inf. Process. Lett. 33(3): 121-124 (1989)
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-04-24 23:16 CEST 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:
