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

Liyue Zhao

dblp:35/1956 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 2

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
Probabilistic and Bayesian machine learning · 64% Learning paradigms · 21% Video understanding and tracking · 6%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian classification
0.412020
A Variational Approach for Learning from Positive and Unlabeled Data · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
class prior estimation
0.412020
A Variational Approach for Learning from Positive and Unlabeled Data · NeurIPS 2020
Machine learning › Learning paradigms › weakly supervised learning
positive-unlabeled learning
0.412020
A Variational Approach for Learning from Positive and Unlabeled Data · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference
variational learning
0.412020
A Variational Approach for Learning from Positive and Unlabeled Data · NeurIPS 2020
Machine learning › Efficient and distributed learning
active learning
0.112009
An active learning approach for segmenting human activity datasets · ACM Multimedia 2009
Computer vision › Segmentation and scene understanding › annotation-efficient segmentation
active learning for segmentation
0.112009
An active learning approach for segmenting human activity datasets · ACM Multimedia 2009
Computer vision › Video understanding and tracking › temporal understanding
temporal segmentation
0.112009
An active learning approach for segmenting human activity datasets · ACM Multimedia 2009
Computer vision › Video understanding and tracking › motion analysis
motion capture analysis
0.012009
An active learning approach for segmenting human activity datasets · ACM Multimedia 2009

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

variational principle · 0.4variational optimization · 0.4unsupervised clustering · 0.1support vector machine · 0.1active learning · 0.1
YearPublicationVenuePosition
2020 A Variational Approach for Learning from Positive and Unlabeled Data
abstract
Learning binary classifiers only from positive and unlabeled (PU) data is an important and challenging task in many real-world applications, including web text classification, disease gene identification and fraud detection, where negative samples are difficult to verify experimentally. Most recent PU learning methods are developed based on the misclassification risk of the supervised learning type, and they may suffer from inaccurate estimates of class prior probabilities. In this paper, we introduce a variational principle for PU learning that allows us to quantitatively evaluate the modeling error of the Bayesian classifier directly from given data. This leads to a loss function which can be efficiently calculated without involving class prior estimation or any other intermediate estimation problems, and the variational learning method can then be employed to optimize the classifier under general conditions. We illustrate the effectiveness of the proposed variational method on a number of benchmark examples.
Fangqing Liu, Liyue Zhao
NeurIPS4
2012 Importance-weighted label prediction for active learning with noisy annotations
Liyue Zhao, Gita Reese Sukthankar, Rahul Sukthankar
ICPR1
2010 Motif Discovery and Feature Selection for CRF-based Activity Recognition
abstract
Due to their ability to model sequential data without making unnecessary independence assumptions, conditional random fields (CRFs) have become an increasingly popular discriminative model for human activity recognition. However, how to represent signal sensor data to achieve the best classification performance within a CRF model is not obvious. This paper presents a framework for extracting motif features for CRF-based classification of IMU (inertial measurement unit) data. To do this, we convert the signal data into a set of motifs, approximately repeated symbolic sub sequences, for each dimension of IMU data. These motifs leverage structure in the data and serve as the basis to generate a large candidate set of features from the multi-dimensional raw data. By measuring reductions in the conditional log-likelihood error of the training samples, we can select features and train a CRF classifier to recognize human activities. An evaluation of our classifier on the CMU Multi-Modal Activity Database reveals that it outperforms the CRF-classifier trained on the raw features as well as other standard classifiers used in prior work.
Liyue Zhao, Gita Reese Sukthankar, Rahul Sukthankar
ICPR1
2009 An active learning approach for segmenting human activity datasets
abstract
Human activity datasets collected under natural conditions are an important source of data. Since these contain multiple activities in unscripted sequence, temporal segmentation of multimodal datasets is an important precursor to recognition and analysis. Manual segmentation is prohibitively time consuming and unsupervised approaches for segmentation are unreliable since they fail to exploit the semantic context of the data. Gathering labels for supervised learning places a large workload on the human user since it is relatively easy to gather a mass of unlabeled data but expensive to annotate. This paper proposes an active learning approach for segmenting large motion capture datasets with both small training sets and working sets. Support Vector Machines (SVMs) are learned using an active learning paradigm; after the classifiers are initialized with a small set of labeled data, the users are iteratively queried for labels as needed. We propose a novel method for initializing the classifiers, based on unsupervised segmentation and clustering of the dataset. By identifying and training the SVM with points from pure clusters, we can improve upon a random sampling strategy for creating the query set. Our active learning approach improves upon the initial unsupervised segmentation used to initialize the classifier, while requiring substantially less data than a fully supervised method; the resulting segmentation is comparable to the latter while requiring significantly less effort from the user.
Liyue Zhao, Gita Reese Sukthankar
ACM Multimedia1
2007 Combining Audio and Video by Dominance in Bimodal Emotion Recognition
Lixing Huang, Le Xin, Liyue Zhao, Jianhua Tao 0001
ACII3
2007 Expressive Face Animation Synthesis Based on Dynamic Mapping Method
Panrong Yin, Liyue Zhao, Lixing Huang, Jianhua Tao 0001
ACII2