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

Yan Liu 0008

dblp:l/YanLiu8 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2009
0000-0003-4242-4840ORCID · corroborated

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

Human-computer interaction and ubiquitous computing · 3 · 3 first-authorArtificial intelligence and machine learning · 1Databases, 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
2 papers
Kernel, tree and ensemble methods · 38% Learning paradigms · 31% Probabilistic and Bayesian machine learning · 31%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting
0.112009
Information theoretic regularization for semi-supervised boosting · KDD 2009
Machine learning › Probabilistic and Bayesian machine learning
information regularization
0.112009
Information theoretic regularization for semi-supervised boosting · KDD 2009
Machine learning › Learning paradigms › semi-supervised learning
semi-supervised boosting
0.112009
Information theoretic regularization for semi-supervised boosting · KDD 2009
Machine learning › Kernel, tree and ensemble methods
decision tree
0.012007
Design and evaluation of visualization support to facilitate decision trees classification · Int. J. Hum. Comput. Stud. 2007

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

visualization · 0.1information regularization · 0.1functional gradient descent · 0.1boosting · 0.1
YearPublicationVenuePosition
2009 Information theoretic regularization for semi-supervised boosting
abstract
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labeled and unlabeled training data. Our approach is based on extending information regularization framework to boosting, bearing loss functions that combine log loss on labeled data with the information-theoretic measures to encode unlabeled data. Even though the information-theoretic regularization terms make the optimization non-convex, we propose simple sequential gradient descent optimization algorithms, and obtain impressively improved results on synthetic, benchmark and real world tasks over supervised boosting algorithms which use the labeled data alone and a state-of-the-art semi-supervised boosting algorithm.
Yan Liu 0008
KDD3
2009 The Cognitive Artifacts of Designing. Lawrence Erlbaum Associates by Willemien Visser
abstract
The aim of the book is to present a cognitive descriptive model of design, considering design as the construction of representations, both internal (e.g., mental models) and external (e.g., drawing...
Yan Liu 0008
Int. J. Hum. Comput. Interact.1
2007 Design and evaluation of visualization support to facilitate decision trees classification
Yan Liu 0008, Gavriel Salvendy
Int. J. Hum. Comput. Stud.1
2006 Design and evaluation of visualization support to facilitate association rules modeling
abstract
Association rules mining is a popular data mining modeling tool. It discovers interesting associations or correlation relationships among a large set of data items, showing attribute values that occur frequently together in a given dataset. Despite their great potential benefit, current association rules modeling tools are far from optimal. This article studies how visualization techniques can be applied to facilitate the association rules modeling process, particularly what visualization elements should be incorporated and how they can be displayed. Original designs for visualization of rules, integration of data and rule visualizations, and visualization of rule derivation process for supporting interactive visual association rules modeling are proposed in this research. Experimental results indicated that, compared to an automatic association rules modeling process, the proposed interactive visual association rules modeling can significantly improve the effectiveness of modeling, enhance understanding of the applied algorithm, and bring users greater satisfaction with the task. The proposed integration of data and rule visualizations can significantly facilitate understanding rules compared to their nonintegrated counterpart.
Yan Liu 0008, Gavriel Salvendy
Int. J. Hum. Comput. Interact.1