Wan D. Bae

dblp:06/7021 · DBLP profile ↗
← Back
17ranked-venue papers in the field
9as first author
6since 2021 · last 2026
0000-0002-4611-5546ORCID · corroborated

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 11 (6 first)Other / Interdisciplinary · 3 (2 first)Data Mining & Knowledge Discovery · 2 (1 first)Information Retrieval & Web Search · 1
YearPublicationVenuePosition
2026 Clustering-Guided Oversampling and Geometric Validation for Imbalanced Learning
Wan D. Bae, Shayma Alkobaisi, Ankita Kadam, Dharanipriya Ravindran, Rishi Munuswamy, Sada Narayanappa
DEXA (2)1
2026 Tabular-To-Image Transformation for Transfer Learning on Heterogeneous Health Data
Sung Ahn, Wan D. Bae, Shayma Alkobaisi, Matthew Horak, Choon-Sik Park, Sungroul Kim
PAKDD (3)2
2025 STREAM: A Framework for Sequence Data Analysis, Modeling, and Anomaly Alerts
Wan D. Bae, Shayma Alkobaisi, Pavleen Kaur
DASFAA (6)1
2025 Content-Based vs. Similarity-Based Deep Learning Approaches for Walkability Assessment
Ankita Kadam, Felix Vu, Siddheshwari Bankar, Alivia Zhao, Garland Lau, Wan D. Bae, Shayma Alkobaisi
DASFAA (6)6
2024 SDGnE: A Synthetic Data Generation and Evaluation System for Rare Event Prediction
Wan D. Bae, Shayma Alkobaisi, Sartaj Bhuvaji, Siddheshwari Bankar
DASFAA (7)1
2024 Incremental SMOTE with Control Coefficient for Classifiers in Data Starved Medical Applications
Wan D. Bae, Shayma Alkobaisi, Siddheshwari Bankar, Sartaj Bhuvaji, Jay Singhvi, Madhuroopa Irukulla, William McDonnell
DaWaK1
2017 A Framework for Estimating Execution Times of IO Traces on SSDs
abstract
With the NAND flash memory technology of solid-state drives (SSDs), the usage of SSDs is expanded to various devices. Due to the cost and time limitations of measuring the actual execution time of each application on SSDs, it is difficult for users to determine the best SSD for their most commonly used applications. In this paper, we propose a framework of estimating the execution time of an application IO trace (i.e., a query IO trace) on a target SSD without its real execution. Our framework is based on the observation that if two IO traces are similar in their IO behavior, their execution times tend to be similar when executed on the same SSD. The performance of the framework is evaluated through extensive experiments on real applications. The results show that our framework is accurate in estimating the execution time of an IO trace on SSDs.
David Yoon Suk Kang, Yong-Yeon Jo, Jaehyuk Cha, Wan D. Bae, Sang-Wook Kim
CIKM4
2015 SCHAS: A Visual Evaluation Framework for Mobile Data Analysis of Individual Exposure to Environmental Risk Factors
Shayma Alkobaisi, Wan D. Bae, Sada Narayanappa
SSTD2
2012 An interactive framework for spatial joins: a statistical approach to data analysis in GIS
Shayma Alkobaisi, Wan D. Bae, Petr Vojtechovský, Sada Narayanappa
GeoInformatica2
2010 IRSJ: incremental refining spatial joins for interactive queries in GIS
Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger
GeoInformatica1
2009 Web data retrieval: solving spatial range queries using k-nearest neighbor searches
Wan D. Bae, Shayma Alkobaisi, Seon Ho Kim, Sada Narayanappa, Cyrus Shahabi
GeoInformatica1
2008 MBR Models for Uncertainty Regions of Moving Objects
Shayma Alkobaisi, Wan D. Bae, Seon Ho Kim, Byunggu Yu
DASFAA2
2008 The Truncated Tornado in TMBB: A Spatiotemporal Uncertainty Model for Moving Objects
Shayma Alkobaisi, Petr Vojtechovský, Wan D. Bae, Seon Ho Kim, Scott T. Leutenegger
DEXA3
2007 The Tornado Model: Uncertainty Model for Continuously Changing Data
Byunggu Yu, Seon Ho Kim, Shayma Alkobaisi, Wan D. Bae, Thomas Bailey
DASFAA4
2007 An interactive framework for raster data spatial joins
abstract
Many Geographic Information Systems (GIS) handle large geospatial datasets stored in raster representation. Spatial joins over raster data are important queries in GIS for data analysis and decision support. However, evaluating spatial joins can be very time intensive due to the size of these datasets. In this paper we propose a new interactive framework that allows users to get approximate answers in near instantaneous time, thus allowing for truly interactive data exploration. Our method utilizes two proposed statistical approaches: probabilistic join and sampling based join. Our probabilistic join method provides speedup of two orders of magnitude with no correctness guarantee, while our sampling based method provides an order of magnitude improvement over the full quad-tree join and also provides running confidence intervals. We propose a framework that combines the two approaches to allow end users to tradeoff speed versus bounded accuracy. The two approaches are evaluated empirically with real and synthetic datasets.
Wan D. Bae, Petr Vojtechovský, Shayma Alkobaisi, Scott T. Leutenegger, Seon Ho Kim
GIS1
2007 Supporting Range Queries on Web Data Using k-Nearest Neighbor Search
Wan D. Bae, Shayma Alkobaisi, Seon Ho Kim, Sada Narayanappa, Cyrus Shahabi
WebDB1
2006 An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS
Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger
DEXA1