scholarly journals A NEW HIGHER ORDER APPROXIMATION TO A PERCENTAGE POINT OF THE DISTRIBUTION OF THE SAMPLE CORRELATION COEFFICIENT

1998 ◽  
Vol 28 (1) ◽  
pp. 45-57 ◽  
Author(s):  
Masafumi Akahira ◽  
Norio Torigoe
Keyword(s):  
Correlation Coefficient ◽  
Order Approximation ◽  
Higher Order ◽  
Sample Correlation

An approximation to the distribution of the sample correlation coefficient

Biometrika ◽  
1978 ◽  
Vol 65 (3) ◽  
pp. 654-656 ◽  
Author(s):  
SADANORI KONISHI
Keyword(s):  
Correlation Coefficient ◽  
Sample Correlation

Using Incidence Sampling to Estimate Covariances

1979 ◽  
Vol 4 (1) ◽  
pp. 41-58 ◽  
Author(s):  
Thomas R. Knapp
Keyword(s):  
Missing Data ◽  
Correlation Coefficient ◽  
Sample Covariance ◽  
Sample Correlation

This paper is an attempt to illustrate the generality of incidence sampling for estimating a parameter whose estimator preserves the unbiasedness of generalized symmetric means, a property which the sample covariance possesses but which the sample correlation coefficient does not. The problem of missing data is also addressed.

On the Distribution of the Sample Correlation Coefficient

1992 ◽  
pp. 466-469
Author(s):  
N. N. Mikhail ◽  
F. A. Chimenti ◽  
J. D. Kidder
Keyword(s):  
Correlation Coefficient ◽  
Sample Correlation

scholarly journals Learning Graph Convolutional Network for Skeleton-Based Human Action Recognition by Neural Searching

2020 ◽  
Vol 34 (03) ◽  
pp. 2669-2676 ◽  
Author(s):  
Wei Peng ◽  
Xiaopeng Hong ◽  
Haoyu Chen ◽  
Guoying Zhao
Keyword(s):  
Action Recognition ◽  
Large Scale ◽  
Order Approximation ◽  
Human Action Recognition ◽  
Search Space ◽  
Human Action ◽  
Higher Order ◽  
Dynamic Graph ◽  
Convolutional Network ◽  
Representational Capacity

Human action recognition from skeleton data, fuelled by the Graph Convolutional Network (GCN) with its powerful capability of modeling non-Euclidean data, has attracted lots of attention. However, many existing GCNs provide a pre-defined graph structure and share it through the entire network, which can loss implicit joint correlations especially for the higher-level features. Besides, the mainstream spectral GCN is approximated by one-order hop such that higher-order connections are not well involved. All of these require huge efforts to design a better GCN architecture. To address these problems, we turn to Neural Architecture Search (NAS) and propose the first automatically designed GCN for this task. Specifically, we explore the spatial-temporal correlations between nodes and build a search space with multiple dynamic graph modules. Besides, we introduce multiple-hop modules and expect to break the limitation of representational capacity caused by one-order approximation. Moreover, a corresponding sampling- and memory-efficient evolution strategy is proposed to search in this space. The resulted architecture proves the effectiveness of the higher-order approximation and the layer-wise dynamic graph modules. To evaluate the performance of the searched model, we conduct extensive experiments on two very large scale skeleton-based action recognition datasets. The results show that our model gets the state-of-the-art results in term of given metrics.

Sign in / Sign up

Export Citation Format

Share Document