Koji Iwanuma - Citegraph

Author Info

Name	Affiliation	Papers
KOJI IWANUMA	Univ Yamanashi, Dept Comp Sci & Engn, Kofu, Yamanashi, Japan	38
Collaborators	Citations	PageRank
25	138	17.65
Referers	Referees	References
165	423	369

Search Limit

100423

Publications (38 rows)

Collaborators (25 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
PARASOL: a hybrid approximation approach for scalable frequent itemset mining in streaming data	0	0.34	2020
Accelerating An On-Line Approximation Mining For Large Closed Itemsets	0	0.34	2019
A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining.	0	0.34	2019
Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint.	0	0.34	2019
On-Line Approximation Mining for Frequent Closed Itemsets Greater than or Equal to Size K	0	0.34	2018
An On-Line Approximation Algorithm for Mining Frequent Closed Itemsets Based on Incremental Intersection.	1	0.38	2016
Online pattern mining for high-dimensional data streams	0	0.34	2015
Completing SBGN-AF Networks by Logic-Based Hypothesis Finding.	1	0.43	2014
Resource-oriented approximation for frequent itemset mining from bursty data streams	5	0.54	2014
On-the-Fly Lazy Clause Simplification Based on Binary Resolvents	1	0.39	2013
Heuristic Inverse Subsumption in Full-Clausal Theories.	0	0.34	2012
Inverse subsumption for complete explanatory induction	4	0.45	2012
Non-monotone Dualization via Monotone Dualization.	1	0.37	2012
Comparison of upward and downward generalizations in CF-Induction	1	0.36	2011
SOLAR: An automated deduction system for consequence finding	23	1.10	2010
Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation.	0	0.34	2009
Reconsideration of circumscriptive induction with pointwise circumscription	0	0.34	2009
Complete Pruning Methods and a Practical Search Strategy for SOL	0	0.34	2008
Lemma Reusing for SAT based Planning and Scheduling	8	0.61	2006
Consequence finding and computing answers with defaults	7	0.52	2006
Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-Automatic Training-Example Generation	5	0.44	2006
Effective SAT Planning by Lemma-Reusing	2	0.38	2005
Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm	8	0.55	2005
Upside-down transformation in SOL/connection tableaux and its application	0	0.34	2005
Speculative Computation Through Consequence-Finding in Multi-Agent Environments	9	0.52	2004
Consequence Finding in Default Theories	1	0.36	2004
SOLAR: A Consequence Finding System for Advanced Reasoning	23	1.38	2003
Minimal Answer Computation and SOL	15	0.71	2002
Effective SAT Planning by Speculative Computation	2	0.44	2002
A Case-Based Recognition of Semantic Structures in HTML Documents	2	0.53	2002
A Defeasible Reasoning System in Multi-Agent Environment	4	0.50	2000
A Case-Based Transformation from HTML to XML	1	0.40	2000
Lemma Generalization and Non-unit Lemma Matching for Model Elimination	0	0.34	1999
Lemma Matching for a PTTP-based Top-down Theorem Prover	9	0.72	1997
An extension of pointwise circumscription	1	0.36	1996
Conservative Query Normalization on Parallel Circumscription	2	0.38	1994
Knowledge representation and inference based on first-order modal logic	0	0.34	1988
Completeness of temporal and spatial logic ETSL.	2	0.43	1987