{"id":2570,"date":"2022-08-22T03:07:57","date_gmt":"2022-08-22T03:07:57","guid":{"rendered":"https:\/\/en.eng.ku.ac.th\/?p=2570"},"modified":"2022-08-26T05:54:57","modified_gmt":"2022-08-26T05:54:57","slug":"dr-thanawin-from-computer-engineering-department-received-the-acm-sigkdd-test-of-time-award","status":"publish","type":"post","link":"https:\/\/en.eng.ku.ac.th\/?p=2570","title":{"rendered":"Dr. Thanawin from Computer Engineering Department received the ACM SIGKDD Test of Time Award"},"content":{"rendered":"
\n
\"\"<\/figure><\/div>\n\n\n

Assistant Professor Dr. Thanawin Rakthammanon was the proud recipient of the ACM SIGKDD Test of Time Award at the 28th ACM SIGKDD Conference, which was held at the Washington DC Convention Center from August 14 until 18, 2022.<\/p>\n\n\n\n


This award is bestowed upon the best research paper of the decade and was presented at the SIGKDD conference. This research was also awarded the best paper award at the SIGKDD 2012, a decade ago. It can therefore be considered that this work is the first to receive awards in both categories.<\/p>\n\n\n\n


Dr Thanawin\u2019s research article, titled \u201cSearching and mining trillions of time-series subsequences under dynamic time warping,\u201d is about optimizing algorithms to run significantly faster so that they can analyze data in excess of 1 trillion series, which the technology of that era was unable to perform. This volume of data is still considered huge even 10 years later. Furthermore, the results of this work have been subroutine for other algorithms to run, making time-based analyses more cost-efficient.<\/p>\n\n\n\n


Currently, this article has been referenced more than 600 times. There are several more works of Assistant Professor Dr. Thanawin Rakthammanon in the field of data mining. His current h-index = 17.<\/p>\n\n\n\n


If you are interested in this research, you can view it at this URL: https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339576.<\/p>\n\n\n\n

<\/pre>\n\n\n\n
\n
\u0e2d\u0e32\u0e08\u0e32\u0e23\u0e22\u0e4c\u0e20\u0e32\u0e04\u0e27\u0e34\u0e0a\u0e32\u0e27\u0e34\u0e28\u0e27\u0e01\u0e23\u0e23\u0e21\u0e04\u0e2d\u0e21\u0e1e\u0e34\u0e27\u0e40\u0e15\u0e2d\u0e23\u0e4c \u0e44\u0e14\u0e49\u0e23\u0e31\u0e1a\u0e23\u0e32\u0e07\u0e27\u0e31\u0e25 ACM SIGKDD Test of Time Award<\/a><\/blockquote>