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

Huixia Judy Wang

dblp:03/7807 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2009
0000-0002-5195-8564ORCID · verified

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

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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.

Theoretical computer science
1 paper
Information theory · 50% Algorithms and data structures · 50%

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

TopicWeightPapersLastEvidence papers
Information theory
hypothesis testing
0.112009
Efficient Moments-based Permutation Tests · NIPS 2009
Algorithms and data structures
permutation test
0.112009
Efficient Moments-based Permutation Tests · NIPS 2009

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

recursive moment derivation · 0.1pearson distribution series approximation · 0.1
YearPublicationVenuePosition
2009 Efficient Moments-based Permutation Tests
abstract
In this paper, we develop an efficient moments-based permutation test approach to improve the system’s efficiency by approximating the permutation distribution of the test statistic with Pearson distribution series. This approach involves the calculation of the first four moments of the permutation distribution. We propose a novel recursive method to derive these moments theoretically and analytically without any permutation. Experimental results using different test statistics are demonstrated using simulated data and real data. The proposed strategy takes advantage of nonparametric permutation tests and parametric Pearson distribution approximation to achieve both accuracy and efficiency.
Chunxiao Zhou, Huixia Judy Wang, Yongmei Michelle Wang
NIPS2
2008 3D face analysis for distinct features using statistical randomization
abstract
It is a fascinating yet challenging problem to accurately and efficiently localize regionally distinct features between face groups in multi-dimensional signal processing and analysis. Given a data with unknown distribution and small sample size, we propose a new statistical analysis framework using hybrid randomization (i.e., permutation) tests to improve the system's efficiency in identifying distinct features. The proposed method fits the nonparametric distribution of the test statistic with Pearson distribution series. We bypass the tedious online randomization via calculating the first four moments of the permutation distribution. This can reduce the computational complexity from O(n!) to O(n2) over traditional methods for the modified Hotelling's T2test statistics. Experiments on simulated data and 3D face analysis demonstrate the efficiency, accuracy and robustness of the proposed approach.
Chunxiao Zhou, Yuxiao Hu 0001, Yun Fu 0001, Huixia Judy Wang, Thomas S. Huang, Yongmei Michelle Wang
ICASSP4