Koji Iwanuma

Proceedings of the 16th IIAI International Congress on Advanced Applied Informatics, 2024

2023

An ϵ-Approximation On-line Algorithm for Quantiles Based on Counters.

[BibT_eX]

[DOI]

Kosuke Maeda

Proceedings of the 14th IIAI International Congress on Advanced Applied Informatics, 2023

2022

A Bottom-Up Enumeration Algorithm of Minimal Generators without Support Counting for Compressing Negative Association Rules.

[BibT_eX]

[DOI]

Kento Yajima

Proceedings of the 12th International Congress on Advanced Applied Informatics, 2022

A Fast On-Line ϵ-Approximation Algorithm for Mining Strongly Closed Itemsets.

[BibT_eX]

[DOI]

Ryo Hinata

Proceedings of the IEEE International Conference on Big Data, 2022

2020

PARASOL: a hybrid approximation approach for scalable frequent itemset mining in streaming data.

[BibT_eX]

[DOI]

Yasuo Tabei

J. Intell. Inf. Syst., 2020

Mining Consistent, Non-Redundant and Minimal Negative Rules Based on Minimal Generators.

[BibT_eX]

[DOI]

Kento Yajima

Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019

Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint.

[BibT_eX]

[DOI]

Yasuo Tabei

CoRR, 2019

Accelerating an On-Line Approximation Mining for Large Closed Itemsets.

[BibT_eX]

[DOI]

Takumi Nishina

Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining.

[BibT_eX]

[DOI]

Takumi Nishina

Proceedings of the IEEE International Conference on Big Data and Smart Computing, 2019

2018

On-Line Approximation Mining for Frequent Closed Itemsets Greater than or Equal to Size K.

[BibT_eX]

[DOI]

Takumi Nishina

Proceedings of the 2018 IEEE International Conference on Big Data, 2018

2016

An On-Line Approximation Algorithm for Mining Frequent Closed Itemsets Based on Incremental Intersection.

[BibT_eX]

[DOI]

Shoshi Fukuda

Proceedings of the 19th International Conference on Extending Database Technology, 2016

2015

Online pattern mining for high-dimensional data streams.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Big Data (IEEE BigData 2015), Santa Clara, CA, USA, October 29, 2015

2014

Resource-oriented approximation for frequent itemset mining from bursty data streams.

[BibT_eX]

[DOI]

Shoshi Fukuda

Proceedings of the International Conference on Management of Data, 2014

Completing SBGN-AF Networks by Logic-Based Hypothesis Finding.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Macro-Biology - First International Conference, 2014

2013

On-the-Fly Lazy Clause Simplification Based on Binary Resolvents.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

2012

Inverse subsumption for complete explanatory induction.

[BibT_eX]

[DOI]

Mach. Learn., 2012

Non-monotone Dualization via Monotone Dualization.

[BibT_eX]

[DOI]

Proceedings of the Late Breaking Papers of the 22nd International Conference on Inductive Logic Programming, 2012

Heuristic Inverse Subsumption in Full-Clausal Theories.

[BibT_eX]

[DOI]

Proceedings of the Inductive Logic Programming - 22nd International Conference, 2012

2011

Comparison of Upward and Downward Generalizations in CF-Induction.

[BibT_eX]

[DOI]

Proceedings of the Inductive Logic Programming - 21st International Conference, 2011

2010

SOLAR: An automated deduction system for consequence finding.

[BibT_eX]

[DOI]

AI Commun., 2010

2009

Reconsideration of circumscriptive induction with pointwise circumscription.

[BibT_eX]

[DOI]

J. Appl. Log., 2009

Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation.

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on First-Order Theorem Proving, 2009

2008

Complete Pruning Methods and a Practical Search Strategy for SOL.

[BibT_eX]

[DOI]

Proceedings of the LPAR 2008 Workshops, 2008

2006

Consequence finding and computing answers with defaults.

[BibT_eX]

[DOI]

J. Intell. Inf. Syst., 2006

Rapid Synthesis of Domain-Specific Web Search Engines Based on Semi-Automatic Training-Example Generation.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

Lemma Reusing for SAT based Planning and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

2005

Upside-Down Transformation in SOL/Connection Tableaux and Its Application.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2005

Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

Effective SAT Planning by Lemma-Reusing.

[BibT_eX]

Hirohito Nozawa

Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 2005

2004

Speculative Computation Through Consequence-Finding in Multi-Agent Environments.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2004

Consequence Finding in Default Theories.

[BibT_eX]

[DOI]

Proceedings of the Flexible Query Answering Systems, 6th International Conference, 2004

2003

SOLAR: A Consequence Finding System for Advanced Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

2002

Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic in Multi-Agent Systems, 2002

Minimal Answer Computation and SOL.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

A Case-Based Recognition of Semantic Structures in HTML Documents.

[BibT_eX]

[DOI]

Masayuki Umehara

Proceedings of the Intelligent Data Engineering and Automated Learning, 2002

Effective SAT Planning by Speculative Computation.

[BibT_eX]

[DOI]

Proceedings of the AI 2002: Advances in Artificial Intelligence, 2002

2000

A Case-Based Transformation from HTML to XML.

[BibT_eX]

[DOI]

Masayuki Umehara

Proceedings of the Intelligent Data Engineering and Automated Learning, 2000

Speculative Computation by Abduction under Incomplete Communication Environments.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Multi-Agent Systems, 2000

A Defeasible Reasoning System in Multi-Agent Environment.

[BibT_eX]

Proceedings of the CL-2000 Workshop on Computational Logic in Multi-Agent Systems (CLIMA-00), 2000

1999

Lemma Generalization and Non-unit Lemma Matching for Model Elimination.

[BibT_eX]

[DOI]

Kenichi Kishino

Proceedings of the Advances in Computing Science, 1999

1997

Lemma Matching for a PTTP-based Top-down Theorem Prover.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 1997

1996

An Extension of Pointwise Circumscription.

[BibT_eX]

[DOI]

Kazuhiko Oota

Artif. Intell., 1996

1994

Conservative Query Normalization on Parallel Circumscription.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1990

Automated Design of Circuits from Recursion Equations Using Theorem-Proving Technique.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1990

1989

Transformation rules for automated design of circuits by theorem-proving techniques. Transformation from recursion equations to circuit descriptions.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1989

1987

Completeness of temporal and spatial logic ETSL.

[BibT_eX]

[DOI]

Shoichi Noguchi

Syst. Comput. Jpn., 1987

Knowledge Representation and Inference Based on First-Order Modal Logic.

[BibT_eX]

[DOI]