Koji Iwanuma

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 10

Top Topics

Closed Itemsets

Frequent Itemset Mining

Top Venues

Publications

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