| Mining Top-K Periodic-Frequent Pattern from Transactional Databases without Support Threshold K Amphawan, P Lenca, A Surarerks Advances in Information Technology: Third International Conference, IAIT …, 2009 | 93 | 2009 |
| Mining periodic-frequent itemsets with approximate periodicity using interval transaction-ids list tree K Amphawan, A Surarerks, P Lenca 2010 Third International Conference on Knowledge Discovery and Data Mining …, 2010 | 38 | 2010 |
| Mining top-k frequent-regular closed patterns K Amphawan, P Lenca Expert Systems with Applications 42 (21), 7882-7894, 2015 | 33 | 2015 |
| Mining top-k regular-frequent itemsets using database partitioning and support estimation K Amphawan, P Lenca, A Surarerks Expert Systems with Applications 39 (2), 1924-1936, 2012 | 19 | 2012 |
| Mining top-k regular-frequent itemsets using database partitioning and support estimation K Amphawan, P Lenca, A Surarerks Expert Systems with Applications 39 (2), 1924-1936, 2012 | 19 | 2012 |
| Efficient mining top-k regular-frequent itemset using compressed tidsets K Amphawan, P Lenca, A Surarerks Pacific-Asia Conference on Knowledge Discovery and Data Mining, 124-135, 2011 | 16 | 2011 |
| Mining High Utility Itemsets with Regular Occurrence. K Amphawan, P Lenca, A Jitpattanakul, A Surarerks Journal of ICT Research & Applications 10 (2), 2016 | 11 | 2016 |
| Mining Top-k Frequent/Regular Patterns Based on User-Given Trade-Off between Frequency and Regularity K Amphawan, P Lenca Advances in Information Technology: 6th International Conference, IAIT 2013 …, 2013 | 9 | 2013 |
| Mining high-utility itemsets with irregular occurrence S Laoviboon, K Amphawan 2017 9th international conference on knowledge and smart technology (KST), 89-94, 2017 | 7 | 2017 |
| A new system for analyzing contents of computer science courses P Kamlangpuech, K Amphawan 2020 7th International Conference on Advance Informatics: Concepts, Theory …, 2020 | 6 | 2020 |
| Mining weighted-frequent-regular itemsets from transactional database K Klangwisan, K Amphawan 2017 9th International Conference on Knowledge and Smart Technology (KST), 66-71, 2017 | 6 | 2017 |
| Discovering interesting itemsets based on change in regularity of occurrence S Eisariyodom, K Amphawan 2017 9th International Conference on Knowledge and Smart Technology (KST …, 2017 | 6 | 2017 |
| Pushing regularity constraint on high utility itemsets mining K Amphawan, A Surarerks 2015 2nd International Conference on Advanced Informatics: Concepts, Theory …, 2015 | 6 | 2015 |
| Mining top-k regular episodes from sensor streams K Amphawan, J Soulas, P Lenca Procedia Computer Science 69, 76-85, 2015 | 6 | 2015 |
| An approach of frequent item tree for association generation K Amphawan, A Surarerks Artificial Intelligence and Soft Computing Ninth IASTED International …, 2005 | 6 | 2005 |
| Supplementary book suggestion for computer science courses B Chaisoongnoen, K Amphawan, A Bunpeng 2018 5th International Conference on Advanced Informatics: Concept Theory …, 2018 | 5 | 2018 |
| An improvement of supplementary book suggestion system B Chaisoongnoen, K Amphawan The 9th International Conference on Smart Media and Applications, 396-398, 2020 | 3 | 2020 |
| Nilr: N-most interesting location-based recommender system S Darapisut, K Amphawan, S Rimcharoen, N Leelathakul The 9th International Conference on Smart Media and Applications, 402-404, 2020 | 2 | 2020 |
| Mining top-k frequent-regular itemsets from data streams based on sliding window technique T Mesama, K Amphawan 2018 5th International Conference on Advanced Informatics: Concept Theory …, 2018 | 2 | 2018 |
| SST: An efficient Suffix-Sharing Trie structure for dictionary lookup K Amphawan 2013 7th Asia Modelling Symposium, 179-184, 2013 | 2 | 2013 |
Philippe LencaIMT AtlantiqueVerified email at imt-atlantique.fr
