Koji Iwanuma

48 papers A* 2A 2B 7C 4Journal 11Unranked 22
YearRankTypeTitle / Venue / Authors
2024 — conf
A Space-Saving Algorithm for Enumerating Minimal Generators in Negative Rule Mining.
IIAI-AAI
Shogo Mochizuki, Koji Iwanuma
2023 — conf
An ϵ-Approximation On-line Algorithm for Quantiles Based on Counters.
IIAI-AAI
Kosuke Maeda, Koji Iwanuma
2022 — conf
A Bottom-Up Enumeration Algorithm of Minimal Generators without Support Counting for Compressing Negative Association Rules.
IIAI-AAI
Kento Yajima, Koji Iwanuma, Yoshitaka Yamamoto
2022 B conf
A Fast On-Line ϵ-Approximation Algorithm for Mining Strongly Closed Itemsets.
IEEE Big Data
Koji Iwanuma, Ryo Hinata
2020 — conf
Mining Consistent, Non-Redundant and Minimal Negative Rules Based on Minimal Generators.
IEEE BigData
Koji Iwanuma, Kento Yajima, Yoshitaka Yamamoto
2020 J jnl
PARASOL: a hybrid approximation approach for scalable frequent itemset mining in streaming data.
J. Intell. Inf. Syst.
Yoshitaka Yamamoto, Yasuo Tabei, Koji Iwanuma
2019 — conf
A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining.
BigComp
Takumi Nishina, Koji Iwanuma, Yoshitaka Yamamoto
2019 — conf
Accelerating an On-Line Approximation Mining for Large Closed Itemsets.
IEEE BigData
Koji Iwanuma, Takumi Nishina, Yoshitaka Yamamoto
2019 J jnl
Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint.
CoRR
Yoshitaka Yamamoto, Yasuo Tabei, Koji Iwanuma
2018 — conf
On-Line Approximation Mining for Frequent Closed Itemsets Greater than or Equal to Size K.
BCD
Takumi Nishina, Koji Iwanuma, Yoshitaka Yamamoto
2016 B conf
An On-Line Approximation Algorithm for Mining Frequent Closed Itemsets Based on Incremental Intersection.
EDBT
Koji Iwanuma, Yoshitaka Yamamoto, Shoshi Fukuda
2015 — conf
Online pattern mining for high-dimensional data streams.
IEEE BigData
Yoshitaka Yamamoto, Koji Iwanuma
2014 — conf
Completing SBGN-AF Networks by Logic-Based Hypothesis Finding.
FMMB
Yoshitaka Yamamoto, Adrien Rougny, Hidetomo Nabeshima, Katsumi Inoue, Hisao Moriya, Christine Froidevaux, Koji Iwanuma
2014 — conf
Resource-oriented approximation for frequent itemset mining from bursty data streams.
SIGMOD Conference
Yoshitaka Yamamoto, Koji Iwanuma, Shoshi Fukuda
2013 B conf
On-the-Fly Lazy Clause Simplification Based on Binary Resolvents.
ICTAI
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
2012 B conf
Heuristic Inverse Subsumption in Full-Clausal Theories.
ILP
Yoshitaka Yamamoto, Katsumi Inoue, Koji Iwanuma
2012 J jnl
Inverse subsumption for complete explanatory induction.
Mach. Learn.
Yoshitaka Yamamoto, Katsumi Inoue, Koji Iwanuma
2012 — conf
Non-monotone Dualization via Monotone Dualization.
ILP (Late Breaking Papers)
Yoshitaka Yamamoto, Koji Iwanuma, Katsumi Inoue
2011 B conf
Comparison of Upward and Downward Generalizations in CF-Induction.
ILP
Yoshitaka Yamamoto, Katsumi Inoue, Koji Iwanuma
2010 J jnl
SOLAR: An automated deduction system for consequence finding.
AI Commun.
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, Oliver Ray
2009 J jnl
Reconsideration of circumscriptive induction with pointwise circumscription.
J. Appl. Log.
Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima
2009 — conf
Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation.
FTP
Koji Iwanuma, Hidetomo Nabeshima, Katsumi Inoue
2008 — conf
Complete Pruning Methods and a Practical Search Strategy for SOL.
LPAR Workshops
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
2006 J jnl
Consequence finding and computing answers with defaults.
J. Intell. Inf. Syst.
Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima
2006 A* conf
Lemma Reusing for SAT based Planning and Scheduling.
ICAPS
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma
2006 — conf
Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-Automatic Training-Example Generation.
Web Intelligence
Hidetomo Nabeshima, Reiko Miyagawa, Yuki Suzuki, Koji Iwanuma
2005 — conf
Effective SAT Planning by Lemma-Reusing.
Artificial Intelligence and Applications
Hidetomo Nabeshima, Hirohito Nozawa, Koji Iwanuma
2005 A* conf
Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm.
ICDM
Koji Iwanuma, Ryuichi Ishihara, Yo Takano, Hidetomo Nabeshima
2005 C conf
Upside-Down Transformation in SOL/Connection Tableaux and Its Application.
ICTAC
Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima
2004 C conf
Consequence Finding in Default Theories.
FQAS
Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima
2004 J jnl
Speculative Computation Through Consequence-Finding in Multi-Agent Environments.
Ann. Math. Artif. Intell.
Katsumi Inoue, Koji Iwanuma
2003 B conf
SOLAR: A Consequence Finding System for Advanced Reasoning.
TABLEAUX
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
2002 C conf
A Case-Based Recognition of Semantic Structures in HTML Documents.
IDEAL
Masayuki Umehara, Koji Iwanuma, Hidetomo Nabeshima
2002 — conf
Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments.
CLIMA
Koji Iwanuma, Katsumi Inoue
2002 — conf
Effective SAT Planning by Speculative Computation.
Australian Joint Conference on Artificial Intelligence
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
2002 B conf
Minimal Answer Computation and SOL.
JELIA
Koji Iwanuma, Katsumi Inoue
2000 C conf
A Case-Based Transformation from HTML to XML.
IDEAL
Masayuki Umehara, Koji Iwanuma
2000 — conf
A Defeasible Reasoning System in Multi-Agent Environment.
CL-2000 Workshop on Computational Logic in Multi-Agent Systems
Chiaki Sakama, Katsumi Inoue, Koji Iwanuma, Ken Satoh
2000 — conf
Speculative Computation by Abduction under Incomplete Communication Environments.
ICMAS
Ken Satoh, Katsumi Inoue, Koji Iwanuma, Chiaki Sakama
1999 — conf
Lemma Generalization and Non-unit Lemma Matching for Model Elimination.
ASIAN
Koji Iwanuma, Kenichi Kishino
1997 A conf
Lemma Matching for a PTTP-based Top-down Theorem Prover.
CADE
Koji Iwanuma
1996 J jnl
An Extension of Pointwise Circumscription.
Artif. Intell.
Koji Iwanuma, Kazuhiko Oota
1994 A conf
Conservative Query Normalization on Parallel Circumscription.
CADE
Koji Iwanuma
1990 J jnl
Automated Design of Circuits from Recursion Equations Using Theorem-Proving Technique.
Syst. Comput. Jpn.
Masateru Harao, Koji Iwanuma
1989 J jnl
Transformation rules for automated design of circuits by theorem-proving techniques. Transformation from recursion equations to circuit descriptions.
Syst. Comput. Jpn.
Masateru Harao, Koji Iwanuma
1988 — conf
Knowledge Representation and Inference Based on First-Order Modal Logic.
FGCS
Koji Iwanuma, Masateru Harao
1987 J jnl
Completeness of temporal and spatial logic ETSL.
Syst. Comput. Jpn.
Koji Iwanuma, Masateru Harao, Shoichi Noguchi
1987 — conf
Knowledge Representation and Inference Based on First-Order Modal Logic.
LP
Koji Iwanuma, Masateru Harao