default search action
Koji Iwanuma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c37]Shogo Mochizuki, Koji Iwanuma:
A Space-Saving Algorithm for Enumerating Minimal Generators in Negative Rule Mining. IIAI-AAI 2024: 689-692 - 2023
- [c36]Kosuke Maeda, Koji Iwanuma:
An ϵ-Approximation On-line Algorithm for Quantiles Based on Counters. IIAI-AAI 2023: 721-724 - 2022
- [c35]Koji Iwanuma, Ryo Hinata:
A Fast On-Line ϵ-Approximation Algorithm for Mining Strongly Closed Itemsets. IEEE Big Data 2022: 6656-6659 - [c34]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: 665-668 - 2020
- [j10]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): 119-147 (2020) - [c33]Koji Iwanuma, Kento Yajima, Yoshitaka Yamamoto:
Mining Consistent, Non-Redundant and Minimal Negative Rules Based on Minimal Generators. IEEE BigData 2020: 5706-5709
2010 – 2019
- 2019
- [c32]Takumi Nishina, Koji Iwanuma, Yoshitaka Yamamoto:
A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining. BigComp 2019: 1-4 - [c31]Koji Iwanuma, Takumi Nishina, Yoshitaka Yamamoto:
Accelerating an On-Line Approximation Mining for Large Closed Itemsets. IEEE BigData 2019: 6078-6080 - [i1]Yoshitaka Yamamoto, Yasuo Tabei, Koji Iwanuma:
Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint. CoRR abs/1901.01710 (2019) - 2018
- [c30]Takumi Nishina, Koji Iwanuma, Yoshitaka Yamamoto:
On-Line Approximation Mining for Frequent Closed Itemsets Greater than or Equal to Size K. BCD 2018: 61-66 - 2016
- [c29]Koji Iwanuma, Yoshitaka Yamamoto, Shoshi Fukuda:
An On-Line Approximation Algorithm for Mining Frequent Closed Itemsets Based on Incremental Intersection. EDBT 2016: 704-705 - 2015
- [c28]Yoshitaka Yamamoto, Koji Iwanuma:
Online pattern mining for high-dimensional data streams. IEEE BigData 2015: 2880-2882 - 2014
- [c27]Yoshitaka Yamamoto, Adrien Rougny
Completing SBGN-AF Networks by Logic-Based Hypothesis Finding. FMMB 2014: 165-179 - [c26]Yoshitaka Yamamoto, Koji Iwanuma, Shoshi Fukuda:
Resource-oriented approximation for frequent itemset mining from bursty data streams. SIGMOD Conference 2014: 205-216 - 2013
- [c25]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
On-the-Fly Lazy Clause Simplification Based on Binary Resolvents. ICTAI 2013: 987-995 - 2012
- [j9]Yoshitaka Yamamoto, Katsumi Inoue
Inverse subsumption for complete explanatory induction. Mach. Learn. 86(1): 115-139 (2012) - [c24]Yoshitaka Yamamoto, Koji Iwanuma, Katsumi Inoue:
Non-monotone Dualization via Monotone Dualization. ILP (Late Breaking Papers) 2012: 74-79 - [c23]Yoshitaka Yamamoto, Katsumi Inoue
Heuristic Inverse Subsumption in Full-Clausal Theories. ILP 2012: 241-256 - 2011
- [c22]Yoshitaka Yamamoto, Katsumi Inoue
Comparison of Upward and Downward Generalizations in CF-Induction. ILP 2011: 373-388 - 2010
- [j8]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
SOLAR: An automated deduction system for consequence finding. AI Commun. 23(2-3): 183-203 (2010)
2000 – 2009
- 2009
- [j7]Koji Iwanuma, Katsumi Inoue
Reconsideration of circumscriptive induction with pointwise circumscription. J. Appl. Log. 7(3): 307-317 (2009) - [c21]Koji Iwanuma, Hidetomo Nabeshima, Katsumi Inoue:
Toward an Efficient Equality Computation in Connection Tableaux: A Modification Method without Symmetry Transformation. FTP 2009 - 2008
- [c20]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue:
Complete Pruning Methods and a Practical Search Strategy for SOL. LPAR Workshops 2008 - 2006
- [j6]Katsumi Inoue
Consequence finding and computing answers with defaults. J. Intell. Inf. Syst. 26(1): 41-58 (2006) - [c19]Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma:
Lemma Reusing for SAT based Planning and Scheduling. ICAPS 2006: 103-113 - [c18]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: 769-772 - 2005
- [c17]Hidetomo Nabeshima, Hirohito Nozawa, Koji Iwanuma:
Effective SAT Planning by Lemma-Reusing. Artificial Intelligence and Applications 2005: 1-5 - [c16]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: 186-193 - [c15]Koji Iwanuma, Katsumi Inoue
Upside-Down Transformation in SOL/Connection Tableaux and Its Application. ICTAC 2005: 166-179 - 2004
- [j5]Katsumi Inoue
Speculative Computation Through Consequence-Finding in Multi-Agent Environments. Ann. Math. Artif. Intell. 42(1-3): 255-291 (2004) - [c14]Katsumi Inoue, Koji Iwanuma, Hidetomo Nabeshima:
Consequence Finding in Default Theories. FQAS 2004: 459-472 - 2003
- [c13]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue
SOLAR: A Consequence Finding System for Advanced Reasoning. TABLEAUX 2003: 257-263 - 2002
- [c12]Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue:
Effective SAT Planning by Speculative Computation. Australian Joint Conference on Artificial Intelligence 2002: 726-728 - [c11]Masayuki Umehara, Koji Iwanuma, Hidetomo Nabeshima:
A Case-Based Recognition of Semantic Structures in HTML Documents. IDEAL 2002: 141-147 - [c10]Koji Iwanuma, Katsumi Inoue
Minimal Answer Computation and SOL. JELIA 2002: 245-258 - [c9]Koji Iwanuma, Katsumi Inoue
Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments. CLIMA 2002: 167-182 - 2000
- [c8]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: 1-6 - [c7]Ken Satoh, Katsumi Inoue
Speculative Computation by Abduction under Incomplete Communication Environments. ICMAS 2000: 263-270 - [c6]Masayuki Umehara, Koji Iwanuma:
A Case-Based Transformation from HTML to XML. IDEAL 2000: 410-415
1990 – 1999
- 1999
- [c5]Koji Iwanuma, Kenichi Kishino:
Lemma Generalization and Non-unit Lemma Matching for Model Elimination. ASIAN 1999: 163-176 - 1997
- [c4]Koji Iwanuma:
Lemma Matching for a PTTP-based Top-down Theorem Prover. CADE 1997: 146-160 - 1996
- [j4]Koji Iwanuma, Kazuhiko Oota:
An Extension of Pointwise Circumscription. Artif. Intell. 86(2): 391-402 (1996) - 1994
- [c3]Koji Iwanuma:
Conservative Query Normalization on Parallel Circumscription. CADE 1994: 296-310 - 1990
- [j3]Masateru Harao, Koji Iwanuma:
Automated Design of Circuits from Recursion Equations Using Theorem-Proving Technique. Syst. Comput. Jpn. 21(6): 95-107 (1990)
1980 – 1989
- 1989
- [j2]Masateru Harao, Koji Iwanuma:
Transformation rules for automated design of circuits by theorem-proving techniques. Transformation from recursion equations to circuit descriptions. Syst. Comput. Jpn. 20(1): 93-105 (1989) - 1988
- [c2]Koji Iwanuma, Masateru Harao:
Knowledge Representation and Inference Based on First-Order Modal Logic. FGCS 1988: 499-506 - 1987
- [j1]Koji Iwanuma, Masateru Harao, Shoichi Noguchi:
Completeness of temporal and spatial logic ETSL. Syst. Comput. Jpn. 18(6): 1-14 (1987) - [c1]Koji Iwanuma, Masateru Harao:
Knowledge Representation and Inference Based on First-Order Modal Logic. LP 1987: 236-251
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: