( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm.

, , , и . ICDM, стр. 186-193. IEEE Computer Society, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Koji Kameo

Koji Onoda

Koji Ota

Tomoko Kojima

Hajime Kojima

 

Другие публикации лиц с тем же именем

A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining., , и . BigComp, стр. 1-4. IEEE, (2019)Mining Consistent, Non-Redundant and Minimal Negative Rules Based on Minimal Generators., , и . IEEE BigData, стр. 5706-5709. IEEE, (2020)Comparison of Upward and Downward Generalizations in CF-Induction., , и . ILP, том 7207 из Lecture Notes in Computer Science, стр. 373-388. Springer, (2011)Lemma Generalization and Non-unit Lemma Matching for Model Elimination., и . ASIAN, том 1742 из Lecture Notes in Computer Science, стр. 163-176. Springer, (1999)Complete Pruning Methods and a Practical Search Strategy for SOL., , и . LPAR Workshops, том 418 из CEUR Workshop Proceedings, CEUR-WS.org, (2008)An ϵ-Approximation On-line Algorithm for Quantiles Based on Counters., и . IIAI-AAI, стр. 721-724. IEEE, (2023)Online pattern mining for high-dimensional data streams., и . IEEE BigData, стр. 2880-2882. IEEE Computer Society, (2015)A Fast On-Line ϵ-Approximation Algorithm for Mining Strongly Closed Itemsets., и . IEEE Big Data, стр. 6656-6659. IEEE, (2022)Effective SAT Planning by Speculative Computation., , и . Australian Joint Conference on Artificial Intelligence, том 2557 из Lecture Notes in Computer Science, стр. 726-728. Springer, (2002)A Case-Based Transformation from HTML to XML., и . IDEAL, том 1983 из Lecture Notes in Computer Science, стр. 410-415. Springer, (2000)