( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Method for Query Top-K Rules from Class Association Rule Set.

, , , и . ACIIDS (1), том 9621 из Lecture Notes in Computer Science, стр. 644-653. Springer, (2016)

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.

Viet Henry T Nguyen

T Peters

T Frieberg

T Masselink

T Neumann

 

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

A Method for Query Top-K Rules from Class Association Rule Set., , , и . ACIIDS (1), том 9621 из Lecture Notes in Computer Science, стр. 644-653. Springer, (2016)An efficient method for mining multi-level high utility Itemsets., , , и . Appl. Intell., 52 (5): 5475-5496 (2022)Updating Ontology Alignment on the Instance Level Based on Ontology Evolution., , и . DEXA (2), том 12392 из Lecture Notes in Computer Science, стр. 301-311. Springer, (2020)Mining Clickstream Patterns Using IDLists., , , , и . SMC, стр. 2007-2012. IEEE, (2019)New approaches for mining high utility itemsets with multiple utility thresholds., , , , , и . Appl. Intell., 54 (11-12): 767-790 (января 2024)CARIM: an efficient algorithm for mining class-association rules with interestingness measures., , и . Int. Arab J. Inf. Technol., 12 (6A): 627-634 (2015)An efficient method for mining high occupancy itemsets based on equivalence class and early pruning., , , , и . Knowl. Based Syst., (2023)Mining Class Association Rules with Synthesis Constraints., , , и . ACIIDS (1), том 10191 из Lecture Notes in Computer Science, стр. 556-565. (2017)An Efficient Approach for Mining High-Utility Itemsets from Multiple Abstraction Levels., , , , и . ACIIDS, том 12672 из Lecture Notes in Computer Science, стр. 92-103. Springer, (2021)Mining Class Association Rules on Dataset with Missing Data., , и . ACIIDS, том 12672 из Lecture Notes in Computer Science, стр. 104-116. Springer, (2021)