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

Chaofan Huang

dblp:203/4442 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian nonparametric model
0.312017
An Infinite Hidden Markov Model With Similarity-Biased Transitions · ICML 2017
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.312017
An Infinite Hidden Markov Model With Similarity-Biased Transitions · ICML 2017
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model
0.312017
An Infinite Hidden Markov Model With Similarity-Biased Transitions · ICML 2017
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian nonparametric model
hierarchical dirichlet process
0.312017
An Infinite Hidden Markov Model With Similarity-Biased Transitions · ICML 2017
Audio and music processing
speaker diarization
0.112017
An Infinite Hidden Markov Model With Similarity-Biased Transitions · ICML 2017

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

similarity-biased transitions · 0.6markov jump process · 0.6gibbs sampling · 0.6
YearPublicationVenuePosition
2018 Interval-valued probabilistic linguistic term sets in multi-criteria group decision making
abstract
The theory of probabilistic linguistic term sets (PLTSs) is very useful in objectively dealing with the multi-criteria group decision making (MCGDM) problems in which there is hesitancy in providing linguistic assessments; and PLTSs allow experts to express their preferences on one linguistic term over another. In order to reflect the uncertainty and inconsistency of decision-makers and handle incomplete linguistic information, we propose a new PLTS called interval-valued probabilistic linguistic term set (IVPLTS). In addition, the existing approaches associated with PLTSs are limited or highly complex in real applications. Therefore, new operations, comparison laws, and aggregation operators are developed for IVPLTS. Furthermore, we establish an efficient framework for MCGDM problems based on the proposed comparison method and the fuzzy preference relation. Then we apply it to a real-life case under linguistic environment. The extended TOPSIS methods combined with PLTSs by using different operational laws are also included for comparison. The final results demonstrate the efficiency and practicality of the new framework.
Cheng-Zu Bai, Ren Zhang 0004, Shuang Shen, Chaofan Huang
Int. J. Intell. Syst.4
2017 An Infinite Hidden Markov Model With Similarity-Biased Transitions
abstract
We describe a generalization of the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) which is able to encode prior information that state transitions are more likely between “nearby” states. This is accomplished by defining a similarity function on the state space and scaling transition probabilities by pairwise similarities, thereby inducing correlations among the transition distributions. We present an augmented data representation of the model as a Markov Jump Process in which: (1) some jump attempts fail, and (2) the probability of success is proportional to the similarity between the source and destination states. This augmentation restores conditional conjugacy and admits a simple Gibbs sampler. We evaluate the model and inference method on a speaker diarization task and a “harmonic parsing” task using four-part chorale data, as well as on several synthetic datasets, achieving favorable comparisons to existing models.
Colin R. Dawson, Chaofan Huang, Clayton T. Morrison
ICML2