Affiliation
Computational Innovation Laboratory (CIL), Faculty of Informatics, Burapha University, Thailand.

E-Mail
mail address

Address
169 Long-hard bangsean road, SeanSuk, Mueang, Chonburi, 20131, Thailand

Telephone
+66-38-103-079

Teaching
886301-Database Concept
886464-Data Mining
886409-Theory of Computation
886452-Data Warehouse Design
887652-Data Warehouse Design
889500-Foundation of Data Science
Talk
CS-Unplug 2559

Research Interest
Data mining, Association rule mining, Web mining, Text mining, Natural Language Processing

Publications
Journal
  1. [2016] K. Amphawan, P. Lenca, A. Jitpattanakul and A. Surarerks, "Mining High Utility Itemsets with Regular Occurrence", Journal of ICT Research and Applications 10 (2), 153-176.
  2. [2015] K. Amphawan, J.Soulas, P. Lenca, "Mining top-k Episodes from Sensor Streams", Procedia Computer Science(The 7th International Conference on Advances in Information Technology), vol. 69, 76-85.
  3. [2015] K. Amphawan, P. Lenca, "Mining top-k frequent-regular closed patterns", Expert Systems with Applications, Elsevier, vol. 42(21), pp. 7882-7894.
  4. [2012] K. Amphawan, P. Lenca, and A. Surarerks, "Mining top-k regular-frequent itemsets using database partitioning and support estimation", Expert Systems with Applications, Volume 39, Issue 2, February 1, 1924-1936.
Proceedings
  1. [2018] S. Eisariyodom, K. Amphawan, "Mining regular itemsets with interesting changes on regularity of occurrence", 2018 International Conference on Digital Arts, Media and Technology (ICDAMT), 103-108.
  2. [2018] K. Klangwisan, K. Amphawan, "Efficient weighted-frequent-regular itemsets mining using interval word segments structure", 2018 10th International Conference on Knowledge and Smart Technology (KST), 59-67.
  3. [2017] S. Eisariyodom, K. Amphawan, "Discovering interesting itemsets based on change in regularity of occurrence", the 9th International Conference on Knowledge and Smart Technology (KST-2017), 138-143.
  4. [2017] S. Laoviboon, K. Amphawan, "Mining High-Utility Itemsets with Irregular Occurrence", the 9th International Conference on Knowledge and Smart Technology (KST-2017), 89-94.
  5. [2017] K. Klangwisan, K. Amphawan, "Mining weighted-frequent-regular itemsets from transactional database", the 9th International Conference on Knowledge and Smart Technology (KST-2017), 66-71.
  6. [2015] K. Amphawan, A. Surarerks, "Pushing Regularity Constraint on High Utility Itemsets Mining", The 2015 International Conference on Advanced Informatics: Concepts, Theory And Application (ICAICIT2015)[Best paper award]
  7. [2015] K. Amphawan, P.Sittichaitaweekul, "Mining top-k frequent-regular patterns based on user-given length constraints", The 19th International Annual Symposium on Computational Science and Engineering
  8. [2014] S. Chompaisal, K. Amphawan, A. Surarerks, "Mining N-most Interesting Multi-level Frequent Itemsets without Support Threshold", Proceedings of Recent Advances in Information and Communication Technology.
  9. [2014] P. Sittichaitaweekul, K. Amphawan, "Enhancing quality of results on Top-k Frequent-Regular Pattern mining", Proceedings of International Conference on Engineering Science and Innovative Technology.
  10. [2013] K. Amphawan and P. Lenca, "Mining top-k frequent-regular patterns based on user-given trade-off between frequency and regularity", Proceeding of the 6th International Conference on Advances in Information Technology: IAIT-2013, Bangkok, Thailand, Springer.
  11. [2013] K. Amphawan, "SST: An efficient suffix-sharing trie structure for dictionary lookup", Proceedings of 7th Asia international conference on mathematical modeling and computer simulation.
  12. [2013] K. Amphawan and A. Surarerks, "An efficient method for constructing dictionary based on decompounding words technique", The 17th International Annual Symposium on Computational Science and Engineering.
  13. [2011] K. Amphawan, P. Lenca , and A. Surarerks, "Efficient mining top-k regular-frequent itemset using compressed tidsets", Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7104 LNAI , pp. 124-135.
  14. [2010] K. Amphawan, A. Surarerks and P. Lenca, "Mining periodic-frequent itemset with approximate periodicity using interval transaction-ids list tree". Proceeding of The 3rd International Conference on Knowledge Discovery and Data Mining: WKDD 2010, Phuket, Thailand, January 9-10.
  15. [2009] K. Amphawan, P. Lenca and A. Surarerks, "Mining top-k periodic-frequent pattern from transactional databases without support threshold". Proceeding of the 3rd International Conference on Advances in Information Technology: IAIT-09, Bangkok, Thailand, December 1-5, ser. CCIS, vol. 55. Springer, pp. 18-29.
  16. [2005] K. Amphawan and A. Surarerks, "Mining association rule using an improvement of frequent item tree ". Proceeding of the 2nd Joint Conference of Science and Software Engineering: JCSSE2005, Burapha University, Chonburi, Thailand, November 17-18.
  17. [2005] K. Amphawan and A. Surarerks, "An approach of frequent item tree for association generation". Proceedings of Artificial Intelligence and Soft Computing (ASC), Benidorm, Spain.
  18. [2004] K. Amphawan and A. Surarerks, "Mining Association Rules with Frequent Item Tree". Proceedings of the 8th National Computer Science and Engineering Conference:NCSEC2004, Songkhla, Thailand, October 21-22.