函数主成分分析
功能数据分析
主成分分析
计算机科学
多元统计
一般化
非线性系统
人工智能
代表(政治)
模式识别(心理学)
数据挖掘
机器学习
数学
数学分析
物理
量子力学
政治
政治学
法学
标识
DOI:10.1080/10618600.2023.2233581
摘要
AbstractUsing representations of functional data can be more convenient and beneficial in subsequent statistical models than direct observations. These representations, in a lower-dimensional space, extract and compress information from individual curves. The existing representation learning approaches in functional data analysis usually use linear mapping in parallel to those from multivariate analysis, for example, functional principal component analysis (FPCA). However, functions, as infinite-dimensional objects, sometimes have nonlinear structures that cannot be uncovered by linear mapping. Linear methods will be more overwhelmed by multivariate functional data. For that matter, this article proposes a functional nonlinear learning (FunNoL) method to sufficiently represent multivariate functional data in a lower-dimensional feature space. Furthermore, we merge a classification model for enriching the ability of representations in predicting curve labels. Hence, representations from FunNoL can be used for both curve reconstruction and classification. Additionally, we have endowed the proposed model with the ability to address the missing observation problem as well as to further denoise observations. The resulting representations are robust to observations that are locally disturbed by uncontrollable random noises. We apply the proposed FunNoL method to several real datasets and show that FunNoL can achieve better classifications than FPCA, especially in the multivariate functional data setting. Simulation studies have shown that FunNoL provides satisfactory curve classification and reconstruction regardless of data sparsity. Supplementary materials for this article are available online.Keywords: Curve classificationFeature mappingFunctional data analysisNeural networks Supplementary MaterialsA supplementary document includes the additional application and simulation results, proofs of the generalization bound, and some technical details.AcknowledgmentsThe authors would like to thank the editor, the associate editor, and one referee for many insightful comments. These comments are very helpful for us to improve our work.Disclosure StatementThe authors report there are no competing interests to declare.Additional informationFundingThis research is supported by the Discovery grant (RGPIN-2023-04057) to J.Cao from the Natural Sciences and Engineering Research Council of Canada (NSERC).
科研通智能强力驱动
Strongly Powered by AbleSci AI