Mingeun Kang

dblp:184/3923 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0003-4375-4032ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Learning paradigms · 77% Graph learning · 23%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › RNA biology › RNA analysis › RNA bioinformatics › RNA structure prediction
RNA secondary structure prediction
0.812024
Enforcing Constraints in RNA Secondary Structure Predictions: A Post-Processing Framework Based on the Assignment Problem · ICML 2024
Mathematical optimization › combinatorial optimization
assignment problem
0.812024
Enforcing Constraints in RNA Secondary Structure Predictions: A Post-Processing Framework Based on the Assignment Problem · ICML 2024
Machine learning › Learning paradigms
semi-supervised learning
0.412020
Autoencoder-Based Graph Construction for Semi-supervised Learning · ECCV (24) 2020
Machine learning › Graph learning
graph construction
0.112020
Autoencoder-Based Graph Construction for Semi-supervised Learning · ECCV (24) 2020

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

machine learning · 1.5integer linear programming · 1.5autoencoder · 0.4
YearPublicationVenuePosition
2024 Enforcing Constraints in RNA Secondary Structure Predictions: A Post-Processing Framework Based on the Assignment Problem
abstract
RNA properties, such as function and stability, are intricately tied to their two-dimensional conformations. This has spurred the development of computational models for predicting the RNA secondary structures, leveraging dynamic programming or machine learning (ML) techniques. These structures are governed by specific rules; for example, only Watson-Crick and Wobble pairs are allowed, and sequences must not form sharp bends. Recent efforts introduced a systematic approach to post-process the predictions made by ML algorithms, aiming to modify them to respect the constraints. However, we still observe instances violating the requirements, significantly reducing biological relevance. To address this challenge, we present a novel post-processing framework for ML-based predictions on RNA secondary structures, inspired by the assignment problem in integer linear programming. Our algorithm offers a theoretical guarantee, ensuring that the resulting predictions adhere to the fundamental constraints of RNAs. Empirical evidence supports the efficacy of our approach, demonstrating improved predictive performance with no constraint violation, while requiring less running time.
Geewon Suh, Gyeongjo Hwang, Seokjun Kang, Doojin Baek, Mingeun Kang
ICML5
2020 Autoencoder-Based Graph Construction for Semi-supervised Learning
Mingeun Kang, Kiwon Lee, Yong H. Lee, Changho Suh
ECCV (24)1
2017 Space-Time Alignment for Channel Estimation in Millimeter Wave Communication with Beam Sweeping
abstract
In millimeter wave (mmWave) communication systems with hybrid multiple-input multiple-output (MIMO) processors, it is often necessary to employ analog beam sweeping during pilot signal transmission/reception to increase the signal to noise ratio (SNR). In this paper, we develop a process, called the space-time (ST) alignment, for receiving pilot sequences for mmWave channel estimation from the signal received during beam sweeping. The spatial alignment removes the effect of beam sweeping on pilot arrival time (PATs). The process for locating the temporal windows on the received signal to obtain pilot-containing sequences for channel estimation is called the temporal alignment. Simulation results demonstrate that mmWave channels can be estimated successfully using the sequences obtained via the ST alignment.
Mingeun Kang, Jinwoo Oh, Yong H. Lee
GLOBECOM2