Demo Data from EDBT 2026 / reviewers in the wild / expert
Younghwan Namkoong
dblp:53/1353
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1
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% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › gene expression analysis
gene expression clustering |
0.1 | 1 | 2008 | Model-based Bayesian clustering (MBBC) · Bioinform. 2008 |
Bioinformatics and computational biology › gene expression analysis › time-series gene expression analysis
time-course microarray analysis |
0.0 | 1 | 2008 | Model-based Bayesian clustering (MBBC) · Bioinform. 2008 |
Methods — techniques the papers use, named apart from their topics
bayesian product partition model · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | An extension of possibilistic fuzzy c-means with regularizationabstractFuzzy c-means (FCM) and possibilistic c-means (PCM) are the two most well-known clustering algorithms in fuzzy clustering area, and have been applied in many areas with their original or modified forms. However, FCM's noise sensitivity problem and PCM's overlapping cluster problem are also well known. Recently there have been several attempts to combine both of them to mitigate these problems and possibilistic fuzzy c-means (PFCM) showed promising results. In this paper, we propose a modified PFCM using regularization to reduce noise sensitivity in PFCM further. Regularization is a well-known technique to make a solution space smooth and an algorithm noise insensitive. The proposed algorithm, PFCM with regularization (PFCM-R), takes advantage of regularization and further reduce the effect of noise. Experimental results are given and show that PFCM-R is better than existing methods in noisy conditions. Younghwan Namkoong, Gyeongyong Heo, Young Woon Woo |
FUZZ-IEEE | 1 |
| 2008 | Model-based Bayesian clustering (MBBC)abstractMOTIVATION: The program MBBC 2.0 clusters time-course microarray data using a Bayesian product partition model. RESULTS: The Bayesian product partition model in Booth et al. (2007) simultaneously searches for the optimal number of clusters, and assigns cluster memberships based on temporal changes of gene expressions. MBBC 2.0 to makes this method easily available for statisticians and scientists, and is built with three free computer language software packages: Ox, R and C++, taking advantage of the strengths of each language. Within MBBC, the search algorithm is implemented with Ox and resulting graphs are drawn with R. A user-friendly graphical interface is built with C++ to run the Ox and R programs internally. Thus, MBBC users are not required to know how to use Ox, R or C++, but they must be pre-installed. AVAILABILITY: A self-extractable zip file, MBBC20zip.exe, is available at the MBBC webpage www.stat.ufl.edu/~casella/mbbc/, which contains MBBC.exe, source files, and all other related files. The current version works only in the Windows operating system. A free installation program and overview for Ox is available at www.doornik.com. A detailed installation guide for Ox is provided by MBBC, and is accessible without installing Ox. R is available at www.r-project.org/. Yongsung Joo, James G. Booth, Younghwan Namkoong, George Casella |
Bioinform. | 3 |