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

Jinwon Park

dblp:59/40 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2026
—ORCID · unresolved

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

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

Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
1.012026
Fair Model-based Clustering · AAAI 2026
Data mining › clustering › constrained clustering
fair clustering
1.012026
Fair Model-based Clustering · AAAI 2026
Data mining › clustering › model-based clustering
mixture model clustering
1.012026
Fair Model-based Clustering · AAAI 2026
Data mining › clustering
model-based clustering
1.012026
Fair Model-based Clustering · AAAI 2026

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

mini-batch learning · 1.0expectation-maximization · 1.0
YearPublicationVenuePosition
2026 Fair Model-based Clustering
abstract
The goal of fair clustering is to find clusters such that the proportion of sensitive attributes (e.g., gender, race, etc) in each cluster is similar to the proportion of the entire data. Various fair clustering algorithms have been proposed, which modify standard K-means clustering to satisfy a given fairness constraint. A critical limitation of several existing fair clustering algorithms is that the number of parameters to be learned is proportional to the sample size because the cluster assignment of each datum should be optimized simultaneously with the cluster center, and thus scaling up the algorithms is difficult. In this paper, we propose a new fair clustering algorithm based on finite mixture model called Fair Model-based Clustering (FMC). A main advantage of FMC is that the number of learnable parameters is independent to the sample size and thus can be scaled up easily. In particular, a mini-batch learning is possible to obtain clusters that are approximately fair. Moreover, FMC can be applied to non-metric data (e.g., categorical data) as long as the likelihood is well-defined. Theoretical and empirical justifications of the superiority of the proposed algorithm are provided.
Jinwon Park, Kunwoong Kim, Jihu Lee, Yongdai Kim
AAAI1
2016 Text-aware image dehazing using stroke width transform
abstract
Haze removal, which is also referred to as image dehazing, has been extensively used to improve the visibility in images captured under inclement weather. In particular, the dark channel prior (DCP)-based single image dehazing has received the greatest amount of interest due to its superior performance. However, since the DCP is based on the characteristics of natural outdoor images, its reliability tends to decrease especially when an image contains man-made textures. In this paper, we present a DCP-based single image dehazing method that is robust when text or text-like patterns are present in the image. The proposed method first estimates the text likelihood from a hazy image using the stroke width transform (SWT) and uses the estimated likelihood to correct the DCP. The experimental results show that the proposed algorithm outperforms the conventional DCP-based dehazing methods.
Jinwon Park, Kyumok Kim, Chee Sun Won, Seung-Won Jung
ICIP1