Demo Data from EDBT 2026 / reviewers in the wild / expert
Hiroki Ishizaka
dblp:74/6184
· DBLP profile ↗
8ranked-venue papers
1as first author
0since 2021 · last 2001
0000-0002-5892-7488ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 3Theory of computation · 2Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Automata and formal languages · 62% Logic in computer science · 38% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
grammatical inference |
0.0 | 1 | 1992 | Polynomial Time Inference of a Subclass of Context-Free Transformations · COLT 1992 |
Logic in computer science
logic programming |
0.0 | 1 | 1992 | Polynomial Time Inference of a Subclass of Context-Free Transformations · COLT 1992 |
Logic in computer science › logic programming
prolog |
0.0 | 1 | 1992 | Polynomial Time Inference of a Subclass of Context-Free Transformations · COLT 1992 |
Methods — techniques the papers use, named apart from their topics
minimal multiple generalization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | An Efficient Derivation for Elementary Formal Systems Based on Partial Unification
Noriko Sugimoto, Hiroki Ishizaka, Takeshi Shinohara |
Discovery Science | 2 |
| 1999 | H-Map: A Dimension Reduction Mapping for Approximate Retrieval of Multi-dimensional Data
Takeshi Shinohara, Hiroki Ishizaka |
Discovery Science | 3 |
| 1999 | Generating Languages by a Derivation Procedure for Elementary Formal Systems
Noriko Sugimoto, Hiroki Ishizaka |
Inf. Process. Lett. | 2 |
| 1998 | Approximate Retrieval of High-Dimensional Data by Spatial Indexing
Takeshi Shinohara, Jiyuan An, Hiroki Ishizaka |
Discovery Science | 3 |
| 1997 | Learning Unions of Tree Patterns Using Queries
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara |
Theor. Comput. Sci. | 2 |
| 1995 | Learning Unions of Tree Patterns Using Queries
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara |
ALT | 2 |
| 1992 | Polynomial Time Inference of a Subclass of Context-Free TransformationsabstractThis paper deals with a class of Prolog programs, called context-free term transformations (CTF). We present a polynomial time algorithm to identify a subclass of CFT, whose program consists of at most two clauses, from positive data; The algorithm uses 2-mmg (2-minimal multiple generalization) algorithm, which is natural extension of Plotkin's least generalization algorithm, to reconstruct the pair of heads of the unknown program. Using this algorithm, we show the consistent and conservative polynomial time identifiability of the class of tree languages defined by CFTFBuniq together with tree languages defined by pairs of two tree patterns, both of which are proper subclasses of CFT, in the limit from positive data. Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara |
COLT | 2 |
| 1990 | Polynomial time Learnability of Simple Deterministic Languages
Hiroki Ishizaka |
Mach. Learn. | 1 |