VLDB 2026 Research / reviewers in the wild / expert
Vit Niennattrakul
dblp:84/6654
· DBLP profile ↗
8ranked-venue papers
4as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 6 · 3 first-authorArtificial intelligence and machine learning · 4 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
2 papers |
Data mining · 76% Data stream processing · 24% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Reconfigurable computing and FPGAs · 50% GPUs and heterogeneous computing · 50% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
anomaly detection |
0.1 | 1 | 2010 | Data Editing Techniques to Allow the Application of Distance-Based Outlier Detection to Streams · ICDM 2010 |
Data mining › anomaly detection › outlier detection
distance-based outlier detection |
0.1 | 1 | 2010 | Data Editing Techniques to Allow the Application of Distance-Based Outlier Detection to Streams · ICDM 2010 |
Data stream processing › stream mining
streaming outlier detection |
0.1 | 1 | 2010 | Data Editing Techniques to Allow the Application of Distance-Based Outlier Detection to Streams · ICDM 2010 |
Data mining › time series analysis › time series similarity
subsequence similarity search |
0.1 | 1 | 2010 | Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs · ICDM 2010 |
Data mining › temporal data mining
time series mining |
0.1 | 1 | 2010 | Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs · ICDM 2010 |
Reconfigurable computing and FPGAs
FPGA accelerator |
0.1 | 1 | 2010 | Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs · ICDM 2010 |
GPUs and heterogeneous computing
GPU computing |
0.1 | 1 | 2010 | Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs · ICDM 2010 |
Methods — techniques the papers use, named apart from their topics
early abandoning · 0.2dynamic time warping · 0.2lower-bound pruning · 0.1lower bound pruning · 0.1distance-based detection · 0.1data editing · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Shape-Based Clustering for Time Series Data
Warissara Meesrikamolkul, Vit Niennattrakul, Chotirat (Ann) Ratanamahatana |
PAKDD (1) | 2 |
| 2012 | Shape-based template matching for time series data
Vit Niennattrakul, Dararat Srisai, Chotirat (Ann) Ratanamahatana |
Knowl. Based Syst. | 1 |
| 2012 | Selective Subsequence Time Series clustering
Sura Rodpongpun, Vit Niennattrakul, Chotirat (Ann) Ratanamahatana |
Knowl. Based Syst. | 2 |
| 2010 | Data Editing Techniques to Allow the Application of Distance-Based Outlier Detection to StreamsabstractThe problem of finding outliers in data has broad applications in areas as diverse as data cleaning, fraud detection, network monitoring, invasive species monitoring, etc. While there are dozens of techniques that have been proposed to solve this problem for static data collections, very simple distance-based outlier detection methods are known to be competitive or superior to more complex methods. However, distance-based methods have time and space complexities that make them impractical for streaming data and/or resource limited sensors. In this work, we show that simple data-editing techniques can make distance-based outlier detection practical for very fast streams and resource limited sensors. Our technique generalizes to produce two algorithms, which, relative to the original algorithm, can guarantee to produce no false positives, or guarantee to produce no false negatives. Our methods are independent of both data type and distance measure, and are thus broadly applicable. Vit Niennattrakul, Eamonn J. Keogh, Chotirat (Ann) Ratanamahatana |
ICDM | 1 |
| 2010 | Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAsabstractMany time series data mining problems require subsequence similarity search as a subroutine. Dozens of similarity/distance measures have been proposed in the last decade and there is increasing evidence that Dynamic Time Warping (DTW) is the best measure across a wide range of domains. Given DTW's usefulness and ubiquity, there has been a large community-wide effort to mitigate its relative lethargy. Proposed speedup techniques include early abandoning strategies, lower-bound based pruning, indexing and embedding. In this work we argue that we are now close to exhausting all possible speedup from software, and that we must turn to hardware-based solutions. With this motivation, we investigate both GPU (Graphics Processing Unit) and FPGA (Field Programmable Gate Array) based acceleration of subsequence similarity search under the DTW measure. As we shall show, our novel algorithms allow GPUs to achieve two orders of magnitude speedup and FPGAs to produce four orders of magnitude speedup. We conduct detailed case studies on the classification of astronomical observations and demonstrate that our ideas allow us to tackle problems that would be untenable otherwise. Doruk Sart, Abdullah Mueen, Walid A. Najjar, Eamonn J. Keogh, Vit Niennattrakul |
ICDM | 5 |
| 2010 | Exact indexing for massive time series databases under time warping distance
Vit Niennattrakul, Pongsakorn Ruengronghirunya, Chotirat (Ann) Ratanamahatana |
Data Min. Knowl. Discov. | 1 |
| 2009 | Meaningful Subsequence Matching under Time Warping Distance for Data Stream
Vit Niennattrakul, Chotirat (Ann) Ratanamahatana |
PAKDD | 1 |
| 2009 | Speeding Up Similarity Search on a Large Time Series Dataset under Time Warping Distance
Pongsakorn Ruengronghirunya, Vit Niennattrakul, Chotirat (Ann) Ratanamahatana |
PAKDD | 2 |