Linear manifold clustering for high dimensional data based on line manifold searching and fusing

High dimensional data clustering, with the inherent sparsity of data and the existence of noise, is a serious challenge for clustering algorithms. A new linear manifold clustering method was proposed to address this problem. The basic idea was to search the line manifold clusters hidden in datasets, and then fuse some of the line manifold clusters to construct higher dimensional manifold clusters. The orthogonal distance and the tangent distance were considered together as the linear manifold distance metrics. Spatial neighbor information was fully utilized to construct the original line manifold and optimize line manifolds during the line manifold cluster searching procedure. The results obtained from experiments over real and synthetic data sets demonstrate the superiority of the proposed method over some competing clustering methods in terms of accuracy and computation time. The proposed method is able to obtain high clustering accuracy for various data sets with different sizes, manifold dimensions and noise ratios, which confirms the anti-noise capability and high clustering accuracy of the proposed method for high dimensional data.     

面向调控网络参数学习的无迹粒子滤波算法

目前基于微分方程模型学习网络参数的工作普遍基于卡尔曼滤波器,对所分析系统有线性假设前提,而基因调控网络具有强非线性,因此需要更适用于非线性模型的方法。提出了一种基于无迹粒子滤波器学习基因调控网络参数的方法,由于粒子滤波方法不受模型线性假设的约束,因此能够对非线性系统进行更好的拟合。通过对Repressillar模型中隐变量与未知参数的估计并与无迹卡尔曼滤波器所获结果的比较,提出的算法有效减少了估计误差。并对粒子数目对结果的影响进行了分析。相较于卡尔曼滤波器,无迹粒子滤波方法对于调控网络参数学习精度更高。粒子数目太少或太多都会减弱估计精度,因此选择适当的粒子数目非常重要。