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

Seungbeom Lee

dblp:71/220 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0003-3852-3723ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Artificial intelligence
3 papers
Generative modeling · 53% Deep learning architectures and training · 23% Language models and text generation · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › generative model › continuous-time generative model
bayesian flow network
0.912025
Enhancing Ligand Validity and Affinity in Structure-Based Drug Design with Multi-Reward Optimization · ICML 2025
Machine learning › Generative modeling
diffusion model
0.912025
Enhancing Ligand Validity and Affinity in Structure-Based Drug Design with Multi-Reward Optimization · ICML 2025
Natural language and speech › Language models and text generation › preference optimization
direct preference optimization
0.912025
Enhancing Ligand Validity and Affinity in Structure-Based Drug Design with Multi-Reward Optimization · ICML 2025
Machine learning › Generative modeling
molecular generation
0.912025
Enhancing Ligand Validity and Affinity in Structure-Based Drug Design with Multi-Reward Optimization · ICML 2025
Machine learning › Generative modeling › molecular generation › molecular design
structure-based drug design
0.912025
Enhancing Ligand Validity and Affinity in Structure-Based Drug Design with Multi-Reward Optimization · ICML 2025
Machine learning › Graph learning
graph augmentation
0.812024
EPIC: Graph Augmentation with Edit Path Interpolation via Learnable Cost · IJCAI 2024
Machine learning › Deep learning architectures and training
attention mechanism
0.512021
Attentive Neural Controlled Differential Equations for Time-series Classification and Forecasting · ICDM 2021
Machine learning › Deep learning architectures and training › neural differential equations
neural controlled differential equations
0.512021
Attentive Neural Controlled Differential Equations for Time-series Classification and Forecasting · ICDM 2021
Machine learning › Deep learning architectures and training
neural differential equations
0.512021
Attentive Neural Controlled Differential Equations for Time-series Classification and Forecasting · ICDM 2021
Bioinformatics and computational biology
drug discovery
0.312025
Enhancing Ligand Validity and Affinity in Structure-Based Drug Design with Multi-Reward Optimization · ICML 2025
Bioinformatics and computational biology › drug discovery › drug design
ligand design
0.312025
Enhancing Ligand Validity and Affinity in Structure-Based Drug Design with Multi-Reward Optimization · ICML 2025

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

reward normalization · 1.7multi-reward optimization · 1.7direct preference optimization · 1.7neural controlled differential equations · 0.5attention · 0.5
YearPublicationVenuePosition
2025 Enhancing Ligand Validity and Affinity in Structure-Based Drug Design with Multi-Reward Optimization
abstract
Deep learning-based Structure-based drug design aims to generate ligand molecules with desirable properties for protein targets. While existing models have demonstrated competitive performance in generating ligand molecules, they primarily focus on learning the chemical distribution of training datasets, often lacking effective steerability to ensure the desired chemical quality of generated molecules. To address this issue, we propose a multi-reward optimization framework that fine-tunes generative models for attributes, such as binding affinity, validity, and drug-likeness, together. Specifically, we derive direct preference optimization for a Bayesian flow network, used as a backbone for molecule generation, and integrate a reward normalization scheme to adopt multiple objectives. Experimental results show that our method generates more realistic ligands than baseline models while achieving higher binding affinity, expanding the Pareto front empirically observed in previous studies.
Seungbeom Lee, Munsun Jo, Jungseul Ok, Dongwoo Kim 0002
ICML1
2024 EPIC: Graph Augmentation with Edit Path Interpolation via Learnable Cost
Jaeseung Heo, Seungbeom Lee, Sungsoo Ahn, Dongwoo Kim 0002
IJCAI2
2024 Attentive neural controlled differential equations for time-series classification and forecasting
Sheo Yon Jin, Heejoo Shin, Sujie Kim, Seoyoung Hong 0001, Minju Jo, Solhee Park, Noseong Park, Seungbeom Lee, Hwiyoung Maeng, Seungmin Jeon
Knowl. Inf. Syst.8
2021 Attentive Neural Controlled Differential Equations for Time-series Classification and Forecasting
abstract
Neural networks inspired by differential equations have proliferated for the past several years, of which neural ordinary differential equations (NODEs) and neural controlled differential equations (NCDEs) are two representative examples. In theory, NCDEs exhibit better representation learning capability for time-series data than NODEs. In particular, it is known that NCDEs are suitable for processing irregular time-series data. Whereas NODEs have been successfully extended to adopt attention, methods to integrate attention into NCDEs have not yet been studied. To this end, we present $\underline{\mathrm{A}}$ttentive $\underline{\mathrm{N}}$eural $\underline{\mathrm{C}}$ontrolled $\underline{\mathrm{D}}$ifferential $\underline{\mathrm{E}}$quations (ANCDEs) for time-series classification and forecasting, where dual NCDEs are used: one for generating attention values, and the other for evolving hidden vectors for a downstream machine learning task. We conduct experiments on three real-world time-series datasets and ten baselines. After dropping some values, we also conduct experiments on irregular time-series. Our method consistently shows the best accuracy in all cases by non-trivial margins. Our visualizations also show that the presented attention mechanism works as intended by focusing on crucial information.
Sheo Yon Jin, Heejoo Shin, Seoyoung Hong 0001, Minju Jo, Solhee Park, Noseong Park, Seungbeom Lee, Hwiyoung Maeng, Seungmin Jeon
ICDM7
2009 Effect of Collision on Movement Tracking Using Active RFID Power Measurement
abstract
This paper reports preliminary work with an RFID based real time location system (RTLS) designed for location and guidance of people in welfare facilities like the sanatorium which has the both of indoor and out door environment. The system consists of a number of fixed RF readers and a number of active RFID tags carried by the target object, or senior people. We compare the performance of several RTLS schemes which use the received signal strength indication (RSSI) values emitted by the moving active RFID tags. Traditional trilateration, fingerprinting, and well-known LANDMARC approaches are evaluated and compared using the SystemC-based computer simulation. Results show a mean estimated error (MEE) performance of 3m with the 130 tags according to the position updated frequency in our simulation environment.
Taekyu Kim, Seungbeom Lee, Sin-Chong Park
CCNC2
2008 Call Admission Control Based on Adaptive Physical Rate for EDCA in IEEE 802.11e WLAN System
abstract
IEEE 802.11e wireless LAN standard supports the call admission control (CAC) for the quality of service (QoS) traffic such as video and voice based on the medium time which means the bandwidth allocation normalized by the arrival time interval of corresponding traffic streams. IEEE 802.11e defines the medium time and its argument, MPDU exchange time which means the duration for the transmission of corresponding traffic stream. The task group (TGe) for 802.11e recommend the definition of MPDU exchange time by using the minimum transmission physical layer rate (PHY rate) without considering adaptive PHY rate to the wireless channel variations. In this paper, we propose new MPDU exchange time considering the adaptive PHY rate instead of fixed rate. The CAC with this proposed MPDU exchange time enhance the user capacity by about 45% maintaining the guarantee of QoS.
Taekyu Kim, Seungbeom Lee, Sin-Chong Park
CCNC2
2008 An Efficient Admission Control Algorithm for IEEE 802.11e WLAN
abstract
The IEEE 802.1 le standard allows an admission control (AC) criteria based on medium time calculation for contention-based wireless access. In this standard, medium time is derived from minimum physical layer (PHY) rate and static surplus bandwidth allocation (SBA) parameters. However, a pessimistic minimum PHY rate and fixed SBA would result in channel underutilization. Therefore, we propose an efficient AC algorithm based on adaptive PHY rate and SBA that enhances the user capacity with quality of service (QoS) provision.
Min Li Huang, Seungbeom Lee, Sin-Chong Park
VTC Fall2
2007 A High-Speed Pipelined Degree-Computationless Modified Euclidean Algorithm Architecture for Reed-Solomon Decoders
abstract
This paper presents a novel high-speed low-complexity pipelined degree-computationless modified Euclidean (pDCME) algorithm architecture for high-speed RS decoders. The pDCME algorithm allows elimination of the degree-computation so as to reduce hardware complexity and obtain high-speed processing. A high-speed RS decoder based on the pDCME algorithm has been designed and implemented with 0.13-μm CMOS standard cell technology in a supply voltage of 1.1 V. The proposed RS decoder operates at a clock frequency of 660 MHz and has a throughput of 5.3 Gb/s. The proposed architecture requires approximately 15% fewer gate counts and a simpler control logic than architectures based on the popular modified Euclidean algorithm.
Seungbeom Lee, Hanho Lee, Jongyoon Shin, Je-Soo Ko
ISCAS1
2007 Modified SDF Architecture for Mixed DIF/DIT FFT
abstract
In this paper, we propose the modified single-path delay feedback (SDF) architecture for FFT implementation, which implements a mixed decimation-in-frequency (DIF)/decimation-in-time (DIT) FFT algorithm. Since final stage is computed as DIT FFT algorithm and other stages including input stage are computed as DIF FFT algorithm, both input and output data occur in normal order and additional clocks for reordering input or output is not required. This architecture is applied to a 64-point FFT and compared to the radix-4 DIF SDF and radix-4 multi-path delay commutator (MDC) architecture in the context of throughput, latency and hardware complexity. As a result, the proposed architecture has a much lower hardware complexity as compared to the radix-4 MDC while maintaining the same throughput and latency, and it achieves a significantly lower latency compared to the original radix-4 SDF architecture with reasonable hardware complexity increment.
Seungbeom Lee, Sin-Chong Park
ISCAS1