一种基于谱聚类分析的粒子群聚类算法

本文研究了谱聚类中NJW算法的样本最优划分问题.利用粒子群算法在聚类问题上搜索到的全局最优,获得了NJW算法对聚类样本的最优划分.推广了谱聚类算法在样本划分时的普适性和稳定性.实验对比验证该算法是有效的.     

基于灰色聚类-SPA的建筑施工项目安全风险评价

针对建筑施工阶段的安全风险,建立了基于灰色聚类-集对分析(SPA)的建筑施工项目安全风险的综合评价模型.在应用SPA确定安全风险评价因素权重的基础上,采用灰色聚类方法对建筑施工项目进行聚类分析,评价建筑施工项目安全风险所处的等级,最后依据SPA中集对势等级次序表分析建筑施工项目安全风险发展态势.实例分析证明了该模型的适用性和合理性,对比分析表明其评价结果的可靠性,为施工企业的安全风险决策提供借鉴.     

Extracting partial canonical structure for large scale eigenvalue problems

We present methods for computing a nearby partial Jordan-Schur form of a given matrix and a nearby partial Weierstrass-Schur form of a matrix pencil. The focus is on the use and the interplay of the algorithmic building blocks – the implicitly restarted Arnoldi method with prescribed restarts for computing an invariant subspace associated with the dominant eigenvalue, the clustering method for grouping computed eigenvalues into numerically multiple eigenvalues and the staircase algorithm for computing the structure revealing form of the projected problem. For matrix pencils, we present generalizations of these methods. We introduce a new and more accurate clustering heuristic for both matrices and matrix pencils. Particular emphasis is placed on reliability of the partial Jordan-Schur and Weierstrass-Schur methods with respect to the choice of deflation parameters connecting the steps of the algorithm such that the errors are controlled. Finally, successful results from computational experiments conducted on problems with known canonical structure and varying ill-conditioning are presented. This revised version was published online in June 2006 with corrections to the Cover Date.     

Graph Sparsification by Universal Greedy Algorithms

Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications, such as simplification of social networks, least squares problems, and numerical solution of symmetric positive definite linear systems. In this paper, inspired by the well-known sparse signal recovery algorithm called orthogonal matching pursuit (OMP), we introduce a deterministic, greedy edge selection algorithm, which is called the universal greedy approach (UGA) for the graph sparsification problem. For a general spectral sparsification problem, e.g., the positive subset selection problem from a set of $m$ vectors in $\mathbb{R}^n$, we propose a nonnegative UGA algorithm which needs $O(mn^2+ n^3/\epsilon^2)$ time to find a $\frac{1+\epsilon/\beta}{1-\epsilon/\beta}$-spectral sparsifier with positive coefficients with sparsity at most $\lceil\frac{n}{\epsilon^2}\rceil$, where $\beta$ is the ratio between the smallest length and largest length of the vectors. The convergence of the nonnegative UGA algorithm is established. For the graph sparsification problem, another UGA algorithm is proposed which can output a $\frac{1+O(\epsilon)}{1-O(\epsilon)}$-spectral sparsifier with $\lceil\frac{n}{\epsilon^2}\rceil$ edges in $O(m+n^2/\epsilon^2)$ time from a graph with $m$ edges and $n$ vertices under some mild assumptions. This is a linear time algorithm in terms of the number of edges that the community of graph sparsification is looking for. The best result in the literature to the knowledge of the authors is the existence of a deterministic algorithm which is almost linear, i.e. $O(m^{1+o(1)})$ for some $o(1)=O(\frac{(\log\log(m))^{2/3}}{\log^{1/3}(m)})$. Finally, extensive experimental results, including applications to graph clustering and least squares regression, show the effectiveness of proposed approaches.     

基于模糊的投影寻踪算法在中医证候分类中的应用

本文提出一种新的聚类算法-基于模糊的投影寻踪算法,可以有效的处理医学中常常遇到的高维混合数据的模糊聚类问题.并将其应用在慢性肾衰的辩证分析问题中,为已有的慢性肾衰证候的分型标准提供科学支持.本文的研究方法为中医辩证的现代化研究开拓了新的思路,值得进一步深入探讨。     

目标价格政策前后国内棉花期货市场波动特征分析——基于ARCH族模型

目标价格机制给棉花期货市场带来的政策效应是期货投资者和政策制定者密切关注的问题.选取CF401、CF501期货合约作为政策实施前后的对比序列,运用基于GED和Normal的ARCH族模型进行实证分析,结果表明:目标价格政策实施后,期货市场活跃度增强,投资者投资意愿增强,与现货市场联动性增强;同时,波动集群效应更显著,不存在高风险高报酬特征,价格收益率波动呈现非对成型,目标价格机制的政策效应基本发挥.最后,针对完善期货市场提出相应建议.     

几种典型数据类型的谱聚类方法研究

主要针对几种典型数据的多流形结构分析问题进行了研究.综合分析多种谱聚类算法优缺点,以谱多流形聚类算法为主线,结合实验结果对多种谱聚类算法进行了分析,最后针对数据空间密度不均匀的情况对谱多流形聚类算法进行了一定的改进,提出了一种基于自适应近邻值的谱多流形聚类算法,并通过实验证明其达到了混合多流形聚类的目的.     

聚类分析在分枝定界法中的应用

针对界约束二次规划的分枝定界法中出现的紧、松弛策略,结合聚类分析方法,给出了新的剖分边的选取原则,把球约束二次规划作为子问题,使得原问题整体最优值的上、下界能较快的达到.     

多指标面板数据的聚类分析及其应用

多指标面板数据的多元统计分析在国内研究中尚属空白.本文分析了面板数据的数据格式和数字特征,根据聚类分析原理,重新构造了多指标面板数据的距离函数和离差平方和函数,在此基础上,说明了多指标面板数据的聚类分析过程.最后对我国各地区工业企业生产效率进行了聚类实证分析,显示了良好的效果。     

可变模糊集合理论与可变模型集

在对立模糊集定义基础上给出以相对隶属函数表示的模糊可变集合定义,给出可变模糊聚类迭代模型、可变模糊模式识别模型、可变模糊对立识别模型.它们是可变模糊聚类、识别、优选决策、评价相统一的理论模型集,是可变模糊集的基础模型与核心内容,可用于自然、管理、人文、社会等各种学科中关于模糊聚类、识别、优选决策、评价、预测等众多实际领域.