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

Yiheng Tu

dblp:160/7357 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2022
—ORCID · unresolved

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

Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › clustering
affinity learning
0.612022
A Simple Approach to Automated Spectral Clustering · NeurIPS 2022
Data mining
clustering
0.612022
A Simple Approach to Automated Spectral Clustering · NeurIPS 2022
Data mining › clustering
spectral clustering
0.612022
A Simple Approach to Automated Spectral Clustering · NeurIPS 2022
Mathematical optimization
bayesian optimization
0.612022
A Simple Approach to Automated Spectral Clustering · NeurIPS 2022
Mathematical optimization › optimization for machine learning
hyperparameter optimization
0.612022
A Simple Approach to Automated Spectral Clustering · NeurIPS 2022
Multimedia analysis and retrieval › multimedia analysis › multimedia collection analysis › image collection analysis
image clustering
0.212022
A Simple Approach to Automated Spectral Clustering · NeurIPS 2022

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

relative-eigen-gap · 1.7least squares representation · 1.7grid search · 1.7bayesian optimization · 1.7
YearPublicationVenuePosition
2022 A Simple Approach to Automated Spectral Clustering
abstract
The performance of spectral clustering heavily relies on the quality of affinity matrix. A variety of affinity-matrix-construction (AMC) methods have been proposed but they have hyperparameters to determine beforehand, which requires strong experience and leads to difficulty in real applications, especially when the inter-cluster similarity is high and/or the dataset is large. In addition, we often need to choose different AMC methods for different datasets, which still depends on experience. To solve these two challenging problems, in this paper, we present a simple yet effective method for automated spectral clustering. First, we propose to find the most reliable affinity matrix via grid search or Bayesian optimization among a set of candidates given by different AMC methods with different hyperparameters, where the reliability is quantified by the \textit{relative-eigen-gap} of graph Laplacian introduced in this paper. Second, we propose a fast and accurate AMC method based on least squares representation and thresholding and prove its effectiveness theoretically. Finally, we provide a large-scale extension for the automated spectral clustering method, of which the time complexity is linear with the number of data points. Extensive experiments of natural image clustering show that our method is more versatile, accurate, and efficient than baseline methods.
Jicong Fan 0001, Yiheng Tu, Zhao Zhang 0001, Ming-Bo Zhao, Haijun Zhang 0002
NeurIPS2
2018 A novel and effective fMRI decoding approach based on sliced inverse regression and its application to pain prediction
Yiheng Tu, Zening Fu, Ao Tan, Yeung Sam Hung, Zhiguo Zhang 0001
Neurocomputing1
2014 Prediction of pain perception using multivariate pattern analysis of laser-evoked EEG oscillations
abstract
This paper is aimed to predict pain perception from laser-evoked EEG oscillatory activities in the time-frequency domain with multivariate pattern analysis (MVPA). We first identify pre-/post-stimulus EEG oscillatory activities that are correlated with the intensity of laser-evoked pain perception using a multivariate linear regression (MVLR) model, which is solved by partial least-squares regression (PLSR). Further, we used the MVLR model to predict the intensity of pain perception from identified pain-correlated time-frequency EEG data for each subject. Our results showed that the proposed MVLR prediction model provided a qualitative prediction of pain (classification of low pain and high pain) with an accuracy of 78.53 ± 1.16% and a quantitative prediction of pain (on a continuous scale from 0 to 10) with a mean absolute error (MAE) of 1.45 ± 0.05, both of which are significantly better than the results of the conventional pain prediction based on single-trial detection of laser-evoked potentials. Besides, for the first time it was found that the pre-stimulus EEG oscillation could significantly contribute to the prediction, which extended our notion of the determinants of pain perception.
Yiheng Tu, Yeung Sam Hung, Zhiguo Zhang 0001
ICARCV1