因子分析中特征向量和主成分的应用研究

讨论了因子分析的基本思想,结合实例从相关系数矩阵出发,计算其特征根和对应的特征向量,然后给出进行主成分分析的三种方法;进行旋转前后因子载荷矩阵的共同度、累计方差、特征根等多角度比较,深刻揭示因子分析和主成分分析之间的关系.     

用主成分分析法作多指标综合评价应该注意的问题

主成分分析法是一种很好的多指标综合评价方法,但须注意其适用性,也要对评价结果恰当地使用.如果样本太少,或者各变量之间的相关性很小,则不适合使用;涉及到动态的价值型的指标评价问题必须作不变价在处理;如果仅仅是进行排序评价则只用一个主成分得分进行评价即可;若还要进行其他方面的分析,则在选取主成分个数时,只能选取特征根大于1所对应主成分;计算各样本的主成分得分一定要采取变权的方式进行;在对各主成分进行命名和特征概括时要首先考察各变量在不同主成分载荷的绝对值大小,在此基础上选择同一主成分上载荷较大的变量主成分命名和特征概括;如果要做倍比分析,则要把各样本的主成分得分映射到适当的正数区间,该区间的选择需要一定的经验,或者参照其他指标的倍比关系确定.     

主成分分析法在学生成绩评价中的应用

简述了主成分的定义,给出了求解主成分的重要定理及性质的证明、对主要的性质进行了解释,归纳总结出求解主成分的步骤.在应用到评价学生成绩的例子中,借助统计软件SAS计算出每一个学生在各主成分的得分和综合得分,根据各主成分的得分对学生在学科中的优势与劣势进行了说明,为教师有针对性的进行因材施教提供了一个依据.     

主成分分析法在高校学生质量综合评价中的应用

主成分分析法能够在保证原始数据信息损失最小的情况下,以少数的综合变量取代原有的多维变量,使数据结构大为简化,并且客观地确定变量权重,避免了主观随意性.应用主成分分析方法对高等学校学生质量进行了综合评价,根据综合得分给出了科学的排名,客观地反映了学生各方面的特征.     

对台湾工农业产品产量的主成分分析

主成分析分析法是一种将多个指标化为少数几个不相关的综合指标 (即主成分 )的多元统计分析方法 .本文通过运用主成分方法对我国台湾地区 1 989 1 996工农业主要指标的原始数据的处理分析 ,表明主成分分析确是在实用中很可行的一种常用的统计方法 .     

主成分分析在中国上市公司综合评价中的作用

主要介绍了主成分分析在上市公司综合评价中的作用 .主成分分析作为一种客观赋权的方法 .权数是能随着宏观经济环境变化而变化的动态权数体系 ,因为主成分分析所应用的数据来源于上市公司年度报告所提供的财务指标 .它主要对所选择的 40只绩优股 ,进行横向的比较 ,并根据第一主成分得分进行排序 ,给广大的投资者提供参考 .     

新疆城镇化水平综合评价模型研究

城镇化是社会、经济发展的产物,受地理、环境、资源等因素的影响,我国不同区域以及新疆各地的城镇化进程存在很大差异.因此,对城镇化发展进行客观而综合评价就显得十分必要.使用主成分分析法对新疆统计年鉴提供的相关数据进行了降维处理,得到了与新疆城镇化水平相关的三个主成分(经济城镇化、生活城镇化和资源城镇化),给出了新疆20个城市的三个主成分得分,并对此加权得到了各城市城镇化水平的综合得分.据此,总结了新疆各城市城镇化发展的特点,并提出了各个城市应认清自身优势和劣势,充分把握对口支援和全国科技支疆机遇,推进新疆城镇化建设.     

因子分析在京杭大运河水质评价中的应用

用主成分分析的方法找出影响京杭大运河淮安段水质的主因子,求出因子得分函数,计算各样本的因子得分及水质综合评分,据此对京杭大运河淮安段各监测断面的水质进行评价.     

基于主成分——BP神经网络的期货市场预测

结合主成分分析法和神经网络的优点,提出了基于主成分分析的神经网络方法来对期货市场进行预测.引入主成分分析法对原始输入变量进行预处理,选择输入变量的主成分作为网络输入,一方面减少了输入维度,消除了各输入变量的相关性;另一方面提高了网络的收敛性和稳定性,也简化了网络的结构.通过实例验证,基于主成分的神经网络比一般神经网络训练精度更高.     

基于主成分分析的水质评价方法

主成分分析法能够在保证原始数据信息损失最小的情况下,以少数的综合变量取代原有的多维变量,使数据结构大为简化,并且客观地确定变量权数,避免了主观随意性.应用主成分分析法对长春市地面水环境进行评价,且与其它评价方法相比较,结果显示主成分分析法更客观且指导性较强,是一种行之有效的水质评价方法.通过主成分分析进行水质评价,可为水资源规划、利用、开发和环境系统优化提供更为客观的参考依据.     

Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph

Principal eigenvectors of adjacency matrices are often adopted as measures of centrality for a graph or digraph. However, previous principal-eigenvector-like measures for a digraph usually consider only the strongly connected component whose adjacency submatrix has the largest eigenvalue. In this paper, for each and every strongly connected component in a digraph, we add weights to diagonal elements of its member nodes in the adjacency matrix such that the modified matrix will have the new unique largest eigenvalue and corresponding principal eigenvectors. Consequently, we use the new principal eigenvectors of the modified matrices, based on different strongly connected components, not only to compose centrality measures but also to identify bowtie structures for a digraph.     

Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph

Eigenvector centrality is a popular measure that uses the principal eigenvector of the adjacency matrix to distinguish importance of nodes in a graph. To find the principal eigenvector, the power method iterating from a random initial vector is often adopted. In this article, we consider the adjacency matrix of a directed graph and choose suitable initial vectors according to strongly connected components of the graph instead so that nonnegative eigenvectors, including the principal one, can be found. Consequently, for aggregating nonnegative eigenvectors, we propose a weighted measure of centrality, called the aggregated-eigenvector centrality. Weighting each nonnegative eigenvector by the reachability of the associated strongly connected component, we can obtain a measure that follows a status hierarchy in a directed graph.     

Recursive estimation for ordered eigenvectors of symmetric matrix with observation noise

The principal component analysis is to recursively estimate the eigenvectors and the corresponding eigenvalues of a symmetric matrix A based on its noisy observations Ak=A+Nk, where A is allowed to have arbitrary eigenvalues with multiplicity possibly bigger than one. In the paper the recursive algorithms are proposed and their ordered convergence is established: It is shown that the first algorithm a.s. converges to a unit eigenvector corresponding to the largest eigenvalue, the second algorithm a.s. converges to a unit eigenvector corresponding to either the second largest eigenvalue in the case the largest eigenvalue is of single multiplicity or the largest eigenvalue if the multiplicity of the largest eigenvalue is bigger than one, and so on. The convergence rate is also derived.     

基于多重共线性的处理方法

多重共线性简称共线性是多元线性回归分析中一个重要问题。消除共线性的危害一直是回归分析的一个重点。目前处理严重共线性的常用方法有以下几种:岭回归、主成分回归、逐步回归、偏最小二乘法、Lasso回归等。本文就这几种方法进行比较分析,介绍它们的优缺点,通过实例分析以便于选择合适的方法处理共线性。     

对应用主成分法进行综合评价的探讨

本文针对用主成分法进行综合评价时存在的缺点,提出了分组主成分评价法。即先用因子分析法对变量进行分组后,然后再分别对各组变量进行主成分评价,既保证了主成分法的优点,也克服它在评价中的缺点,提高综合评价结果的合理性。并用该方法对实例进行了分析,取得了较好的效果。     

基于主成分分析的湖南竞争力评价研究

介绍了主成分分析方法,提出了运用主成分评价模型必须满足的条件。并且借鉴中国科学院可持续发展研究组构建的可持续发展指标体系,运用主成分分析构建了区域竞争力的综合评价指标,将湖南的经济发展与其他地区比较,并提出相应的策略。     

Asymptotic theory for the principal component analysis of a vector random function: Some applications to statistical inference

From the results of convergence by sampling in linear principal component analysis (of a random function in a separable Hilbert space), the limiting distribution is given for the principal values and the principal factors. These results can be explicitly written in the normal case. Some applications to statistical inference are investigated.     

Construction of data-adaptive orthogonal wavelet bases with an extension of principal component analysis

We show that orthonormal bases of functions with multiscale compact supports can be obtained from a generalization of principal component analysis. These functions, called multiscale principal components (MPCs), are eigenvectors of the correlation operator expressed in different vector subspaces. MPCs are data-adaptive functions that minimize their correlation with the reference signal. Using MPCs, we construct orthogonal bases which are similar to dyadic wavelet bases. We observe that MPCs are natural wavelets, i.e. their average is zero or nearly zero if the signal has a dominantly low-pass spectrum. We show that MPCs perform well in simple data compression experiments, in the presence or absence of singularities. We also introduce concentric MPCs, which are orthogonal basis functions having multiscale concentric supports. Use as kernels in convolution products with a signal, these functions allow to define a wavelet transform that has a striking capacity to emphasize atypical patterns.     

Structure of principal eigenvectors and genetic diversity

The main concern of this paper is long-term genotypic diversity. Genotypes are represented as finite sequences (s₁,s₂,…,s_n), where the entries {s_i} are drawn from a finite alphabet. The mutation matrix is given in terms of Hamming distances. It is proved that the long time behavior of solutions for a class of genotype evolution models is governed by the principal eigenvectors of the sum of the mutation and fitness matrices. It is proved that the components of principal eigenvectors are symmetric and monotonely decreasing in terms of Hamming distances whenever the fitness matrix has those properties.