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

Minyoung Mun

dblp:24/6907 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Databases, data management, data science and information retrieval · 2

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
Spatial and temporal data management · 40% Data mining · 40% Data stream processing · 20%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%
Computer networks
1 paper
Edge and fog computing · 100%

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

TopicWeightPapersLastEvidence papers
Smart cities and intelligent transportation › public transit
bus travel time prediction
0.412020
DeepTRANS: A Deep Learning System for Public Bus Travel Time Estimation using Traffic Forecasting · Proc. VLDB Endow. 2020
Smart cities and intelligent transportation
public transit
0.412020
DeepTRANS: A Deep Learning System for Public Bus Travel Time Estimation using Traffic Forecasting · Proc. VLDB Endow. 2020
Data mining
anomaly detection
0.412020
Real-Time Distance-Based Outlier Detection in Data Streams · Proc. VLDB Endow. 2020
Data mining › anomaly detection › outlier detection
distance-based outlier detection
0.412020
Real-Time Distance-Based Outlier Detection in Data Streams · Proc. VLDB Endow. 2020
Data stream processing › stream mining
streaming outlier detection
0.412020
Real-Time Distance-Based Outlier Detection in Data Streams · Proc. VLDB Endow. 2020
Spatial and temporal data management
trajectory data
0.412020
DeepTRANS: A Deep Learning System for Public Bus Travel Time Estimation using Traffic Forecasting · Proc. VLDB Endow. 2020
Spatial and temporal data management › trajectory analysis
travel time estimation
0.412020
DeepTRANS: A Deep Learning System for Public Bus Travel Time Estimation using Traffic Forecasting · Proc. VLDB Endow. 2020

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

traffic forecasting · 1.3deep learning · 1.3multi-distance indexing · 0.9core point indexing · 0.9
YearPublicationVenuePosition
2020 DeepTRANS: A Deep Learning System for Public Bus Travel Time Estimation using Traffic Forecasting
abstract
In the public transportation domain, accurate estimation of travel times helps to manage rider expectations as well as to provide a powerful tool for transportation agencies to coordinate the public transport vehicles. Although many statistical and machine learning methods have been proposed to estimate travel times, none of the methods consider utilizing predicted traffic information. Forecasting how congestion is going to evolve is critical for accurate travel time estimations. In this paper, we present DeepTRANS, which incorporates traffic forecasting information to our prior Deep Learning-based Bus Estimated Time of Arrival (ETA) model, increasing its accuracy by 21% in estimating bus travel time.
Luan V. Tran, Minyoung Mun, Matthew Lim, Jonah Yamato, Nathan Huh, Cyrus Shahabi
Proc. VLDB Endow.2
2020 Real-Time Distance-Based Outlier Detection in Data Streams
abstract
Real-time outlier detection in data streams has drawn much attention recently as many applications need to be able to detect abnormal behaviors as soon as they occur. The arrival and departure of streaming data on edge devices impose new challenges to process the data quickly in real-time due to memory and CPU limitations of these devices. Existing methods are slow and not memory efficient as they mostly focus on quick detection of inliers and pay less attention to expediting neighbor searches for outlier candidates. In this study, we propose a new algorithm, CPOD, to improve the efficiency of outlier detections while reducing its memory requirements. CPOD uses a unique data structure called "core point" with multi-distance indexing to both quickly identify inliers and reduce neighbor search spaces for outlier candidates. We show that with six real-world and one synthetic dataset, CPOD is, on average, 10, 19, and 73 times faster than M_MCOD, NETS, and MCOD, respectively, while consuming low memory.
Luan V. Tran, Minyoung Mun, Cyrus Shahabi
Proc. VLDB Endow.2