Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sehun Yu

dblp:269/4611 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2021
0009-0003-6275-1061ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1

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.

Artificial intelligence
2 papers
Trustworthy machine learning · 70% Probabilistic and Bayesian machine learning · 23% Deep learning architectures and training · 7%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.922020
Multi-Class Data Description for Out-of-distribution Detection · KDD 2020
Convolutional Neural Networks with Compression Complexity Pooling for Out-of-Distribution Image Detection · IJCAI 2020
Data mining
anomaly detection
0.512021
Weakly Supervised Temporal Anomaly Segmentation with Dynamic Time Warping · ICCV 2021
Data mining › anomaly detection › label-efficient anomaly detection
weakly supervised anomaly detection
0.512021
Weakly Supervised Temporal Anomaly Segmentation with Dynamic Time Warping · ICCV 2021
Machine learning › Trustworthy machine learning
robustness
0.412020
Convolutional Neural Networks with Compression Complexity Pooling for Out-of-Distribution Image Detection · IJCAI 2020
Machine learning › Deep learning architectures and training
convolutional neural network
0.112020
Convolutional Neural Networks with Compression Complexity Pooling for Out-of-Distribution Image Detection · IJCAI 2020

Methods — techniques the papers use, named apart from their topics

deep neural network · 0.9dynamic time warping · 0.5normalized compression distance · 0.4global average pooling · 0.4gaussian discriminant analysis · 0.4
YearPublicationVenuePosition
2021 Weakly Supervised Temporal Anomaly Segmentation with Dynamic Time Warping
abstract
Most recent studies on detecting and localizing temporal anomalies have mainly employed deep neural networks to learn the normal patterns of temporal data in an unsupervised manner. Unlike them, the goal of our work is to fully utilize instance-level (or weak) anomaly labels, which only indicate whether any anomalous events occurred or not in each instance of temporal data. In this paper, we present WETAS, a novel framework that effectively identifies anomalous temporal segments (i.e., consecutive time points) in an input instance. WETAS learns discriminative features from the instance-level labels so that it infers the sequential order of normal and anomalous segments within each instance, which can be used as a rough segmentation mask. Based on the dynamic time warping (DTW) alignment between the input instance and its segmentation mask, WETAS obtains the result of temporal segmentation, and simultaneously, it further enhances itself by using the mask as additional supervision. Our experiments show that WETAS considerably outperforms other baselines in terms of the localization of temporal anomalies, and also it provides more informative results than point-level detection methods.
Dongha Lee 0003, Sehun Yu, Hyunjun Ju, Hwanjo Yu
ICCV2
2020 Convolutional Neural Networks with Compression Complexity Pooling for Out-of-Distribution Image Detection
abstract
To reliably detect out-of-distribution images based on already deployed convolutional neural networks, several recent studies on the out-of-distribution detection have tried to define effective confidence scores without retraining the model. Although they have shown promising results, most of them need to find the optimal hyperparameter values by using a few out-of-distribution images, which eventually assumes a specific test distribution and makes it less practical for real-world applications. In this work, we propose a novel out-of-distribution detection method termed as MALCOM, which neither uses any out-of-distribution sample nor retrains the model. Inspired by an observation that the global average pooling cannot capture spatial information of feature maps in convolutional neural networks, our method aims to extract informative sequential patterns from the feature maps. To this end, we introduce a similarity metric that focuses on shared patterns between two sequences based on the normalized compression distance. In short, MALCOM uses both the global average and the spatial patterns of feature maps to identify out-of-distribution images accurately.
Sehun Yu, Dongha Lee 0003, Hwanjo Yu
IJCAI1
2020 Multi-Class Data Description for Out-of-distribution Detection
abstract
The capability of reliably detecting out-of-distribution samples is one of the key factors in deploying a good classifier, as the test distribution always does not match with the training distribution in most real-world applications. In this work, we present a deep multi-class data description, termed as Deep-MCDD, which is effective to detect out-of-distribution (OOD) samples as well as classify in-distribution (ID) samples. Unlike the softmax classifier that only focuses on the linear decision boundary partitioning its latent space into multiple regions, our Deep-MCDD aims to find a spherical decision boundary for each class which determines whether a test sample belongs to the class or not. By integrating the concept of Gaussian discriminant analysis into deep neural networks, we propose a deep learning objective to learn class-conditional distributions that are explicitly modeled as separable Gaussian distributions. Thereby, we can define the confidence score by the distance of a test sample from each class-conditional distribution, and utilize it for identifying OOD samples. Our empirical evaluation on multi-class tabular and image datasets demonstrates that Deep-MCDD achieves the best performances in distinguishing OOD samples while showing the classification accuracy as high as the other competitors.
Dongha Lee 0003, Sehun Yu, Hwanjo Yu
KDD2