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

Jaebin Lee

dblp:55/3807 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0002-0060-5689ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 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.

Artificial intelligence
1 paper
Representation and self-supervised learning · 50% Deep learning architectures and training · 25% Time series and sequential data · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
bottleneck features
0.912025
TimePerceiver: An Encoder-Decoder Framework for Generalized Time-Series Forecasting · NeurIPS 2025
Machine learning › Deep learning architectures and training
encoder-decoder architecture
0.912025
TimePerceiver: An Encoder-Decoder Framework for Generalized Time-Series Forecasting · NeurIPS 2025
Machine learning › Representation and self-supervised learning
latent representation
0.912025
TimePerceiver: An Encoder-Decoder Framework for Generalized Time-Series Forecasting · NeurIPS 2025
Machine learning › Time series and sequential data › time series analysis
time series forecasting
0.912025
TimePerceiver: An Encoder-Decoder Framework for Generalized Time-Series Forecasting · NeurIPS 2025

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

learnable queries · 0.9cross-channel dependency modeling · 0.9
YearPublicationVenuePosition
2025 TimePerceiver: An Encoder-Decoder Framework for Generalized Time-Series Forecasting
abstract
In machine learning, effective modeling requires a holistic consideration of how to encode inputs, make predictions (i.e., decoding), and train the model. However, in time-series forecasting, prior work has predominantly focused on encoder design, often treating prediction and training as separate or secondary concerns. In this paper, we propose TimePerceiver, a unified encoder-decoder forecasting framework that is tightly aligned with an effective training strategy. To be specific, we first generalize the forecasting task to include diverse temporal prediction objectives such as extrapolation, interpolation, and imputation. Since this generalization requires handling input and target segments that are arbitrarily positioned along the temporal axis, we design a novel encoder-decoder architecture that can flexibly perceive and adapt to these varying positions. For encoding, we introduce a set of latent bottleneck representations that can interact with all input segments to jointly capture temporal and cross-channel dependencies. For decoding, we leverage learnable queries corresponding to target timestamps to effectively retrieve relevant information. Extensive experiments demonstrate that our framework consistently and significantly outperforms prior state-of-the-art baselines across a wide range of benchmark datasets.
Jaebin Lee, Hankook Lee
NeurIPS1
2007 Adjustment of Discrepancies Between LIDAR Data Strips Using Linear Features
abstract
Despite the recent developments in light detection and ranging systems, discrepancies between strips on overlapping areas persist due to the systematic errors. This letter presents an algorithm that can be used to detect and adjust such discrepancies. To achieve this, extracting conjugate features from the strips is a prerequisite step. In this letter, linear features are chosen as conjugate features because they can be accurately extracted from man-made structures in urban area and more easily extracted than the point features. Based on such a selection strategy, a simple and robust algorithm is proposed that is generally applicable for extracting such features. The algorithm includes methods that can be used to establish observation equations from similarity measurements of the extracted features. Then, several transformations are selected and used to adjust the strips. Following the transformation, the fitness of linear features is tested to determine whether the discrepancies have been resolved; the results are then evaluated statistically. The results demonstrate that the algorithm is effective in reducing the discrepancies between the strips.
Jaebin Lee, Kiyun Yu, Yongil Kim, Ayman Habib 0001
IEEE Geosci. Remote. Sens. Lett.1
2006 Adjustment for Discrepancies Between ALS Data Strips Using a Contour Tree Algorithm
Dongyeob Han, Jaebin Lee, Yongil Kim, Kiyun Yu
ACIVS2