Demo Data from SIGIR 2026 / reviewers in the wild / expert
Tapan Shah 0004
dblp:300/7618
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2024
0000-0003-4481-712XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 77% Representation and self-supervised learning · 23% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › inference efficiency
energy-efficient inference |
0.8 | 1 | 2024 | Energy Efficient Streaming Time Series Classification with Attentive Power Iteration · AAAI 2024 |
Embedded and real-time systems › real-time AI systems › real-time inference
real-time classification |
0.8 | 1 | 2024 | Energy Efficient Streaming Time Series Classification with Attentive Power Iteration · AAAI 2024 |
Embedded and real-time systems › resource-constrained systems
resource-constrained devices |
0.8 | 1 | 2024 | Energy Efficient Streaming Time Series Classification with Attentive Power Iteration · AAAI 2024 |
Machine learning › Representation and self-supervised learning › representation compression
compact representation learning |
0.2 | 1 | 2024 | Energy Efficient Streaming Time Series Classification with Attentive Power Iteration · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
attentive power iteration · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Energy Efficient Streaming Time Series Classification with Attentive Power IterationabstractEfficiently processing time series data streams in real-time on resource-constrained devices offers significant advantages in terms of enhanced computational energy efficiency and reduced time-related risks. We introduce an innovative streaming time series classification network that utilizes attentive power iteration, enabling real-time processing on resource-constrained devices. Our model continuously updates a compact representation of the entire time series, enhancing classification accuracy while conserving energy and processing time. Notably, it excels in streaming scenarios without requiring complete time series access, enabling swift decisions. Experimental results show that our approach excels in classification accuracy and energy efficiency, with over 70% less consumption and threefold faster task completion than benchmarks. This work advances real-time responsiveness, energy conservation, and operational effectiveness for constrained devices, contributing to optimizing various applications. Hao Huang 0007, Tapan Shah 0004, Scott Evans, Shinjae Yoo |
AAAI | 2 |
| 2024 | Sustainable and Explainable Neural Network for Real-Time Time Series Classification
Hao Huang 0007, Tapan Shah 0004, Shinjae Yoo, Scott Evans |
ICPR (5) | 2 |
| 2024 | Deep Root Cause Analysis: Unveiling Anomalies and Enhancing Fault Detection in Industrial Time SeriesabstractIn industrial systems, ensuring operational reliability hinges on effective fault detection and root cause analysis. Traditional data-driven fault detection, employing AI to construct prediction models, often falters in accurately identifying true root causes. This limitation arises when variables with high prediction residuals are merely symptomatic rather than direct causes. We present Deep Root Cause Analysis (DRA), a hierarchical neural network. The first model predicts time series and identifies anomalies with high residuals, while the second regresses these residuals from the first model, generating a saliency map that highlights potential root causes that contribute to the residuals. DRA exhibits promising capabilities in providing detailed insights, overcoming the shortcomings of traditional deviation-based approaches. Experiments conducted on the Tennessee Eastman process dataset showcase DRA’s superiority in detecting various process faults and pinpointing their root causes, thereby enhancing precision in complex industrial settings. Hao Huang 0007, Tapan Shah 0004, John N. Karigiannis, Scott Evans |
IJCNN | 2 |
| 2022 | Deep Time Series Sketching and Its Application on Industrial Time Series ClusteringabstractToday, voluminous multivariate time series data collected from sensors provides tremendous benefit for understanding of modern industrial systems such as power plants, wind turbines and aircrafts. However, the dynamic and complex nature of these systems, as well as the lack of prior knowledge impose challenges in perceiving different system behaviors from the time series data. To handle these issues, time series clustering has become one of the key analysis techniques. Nevertheless, the data nonlinearity, varying lengths and high dimensions of industrial time series could hinder the quality of clustering. To deal with these challenges, we propose Deep Time Series Sketching (DTSS) model. This model is a representation learning model based on temporal convolutional networks that perform on a sliding window basis along time series to learn the windows’ embeddings. The sequence of embeddings is then fed into embedding sketching to obtain its sketch. Such sketch is a descriptor of the whole time series and will be fed into K-means for clustering. Our model is a novel end-to-end hybrid model that incorporates both local and global contextual features. It is able to project multivariate time series with varying lengths into the same latent space. Moreover, we show that our model is able to perform early clustering as it can assign real-time label without seeing the whole time series. We test our model on both benchmark and real world industrial datasets, and experiments show that our proposed method outperforms popular time series clustering baselines. Hao Huang 0007, Tapan Shah 0004, Shinjae Yoo |
IEEE Big Data | 2 |