( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parallel association rule mining based on FI-growth algorithm.

, , , , и . ICPADS, стр. 1-8. IEEE Computer Society, (2007)

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.

Vanpen Surarerks

 

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

Mining N-most Interesting Multi-level Frequent Itemsets without Support Threshold., , и . IC2IT, том 265 из Advances in Intelligent Systems and Computing, стр. 125-134. Springer, (2014)Mining Top-K Periodic-Frequent Pattern from Transactional Databases without Support Threshold., , и . IAIT, том 55 из Communications in Computer and Information Science, стр. 18-29. Springer, (2009)Efficient Mining Top-k Regular-Frequent Itemset Using Compressed Tidsets., , и . PAKDD Workshops, том 7104 из Lecture Notes in Computer Science, стр. 124-135. Springer, (2011)Faster cellular automata cryptosystems with neighbor sequences., и . IACR Cryptol. ePrint Arch., (2023)On-Line Multiplication in Real and Complex Base., и . IEEE Symposium on Computer Arithmetic, стр. 212-219. IEEE Computer Society, (2003)Computing Personalized PageRank Based on Temporal-Biased Proximity., , , , и . ITCS, том 253 из Lecture Notes in Electrical Engineering, стр. 375-385. Springer, (2013)On the Maximum Edge-Pair Embedding Bipartite Matching., , , и . WALCOM, том 12049 из Lecture Notes in Computer Science, стр. 236-248. Springer, (2020)Mining top-k regular-frequent itemsets using database partitioning and support estimation., , и . Expert Syst. Appl., 39 (2): 1924-1936 (2012)Dynamic Symmetry Breaking in SAT using Augmented Clauses with a Polynomial-Time Lexicographic Pruning., и . EECS, стр. 242-247. IEEE, (2018)Approximation of Positive Integer in Double-Base Number System with a Single Term., и . EECS, стр. 569-576. IEEE, (2018)