张红军. 多维数据集中高维数据可视化算法研究[J]. 微电子学与计算机, 2017, 34(5): 110-113, 118.
引用本文: 张红军. 多维数据集中高维数据可视化算法研究[J]. 微电子学与计算机, 2017, 34(5): 110-113, 118.
ZHANG Hong-jun. Cube High-Dimensional Data Visualization Algorithm Research[J]. Microelectronics & Computer, 2017, 34(5): 110-113, 118.
Citation: ZHANG Hong-jun. Cube High-Dimensional Data Visualization Algorithm Research[J]. Microelectronics & Computer, 2017, 34(5): 110-113, 118.

多维数据集中高维数据可视化算法研究

Cube High-Dimensional Data Visualization Algorithm Research

  • 摘要: 多维数据集中包含海量的复杂高维数据, 如何对这些数据进行科学的理解、分析和使用, 是数据挖掘领域的一个重点和难点课题.针对传统可视化算法无法解决高维数据多属性的可视化问题, 算法复杂、适用性较差的不足, 提出基于快速数据聚类的可视化算法研究.算法构建了一种多维数据模型, 采用三角多项式建立映射关系; 对多维数据集做不同层次的划分, 并基于聚类的效果筛选最佳聚类数; 最后在平行坐标系基础上, 对高维数据进行时序多维分析, 提高算法鲁棒性.实验证明提出算法简洁易用, 能够较好地实现对多维数据集中高维数据的理解和分析.

     

    Abstract: Cube contains vast amounts of complex data, how to carry on the scientific understanding and analysis of the data and use, is an important and difficult topic in the field of data mining. For traditional visualization algorithm can't solve the problem of high-dimensional data visualization of multiple attribute, the deficiencies of the algorithm is less complex, applicability, visualization algorithm based on fast data clustering is proposed. Algorithm firstly builds a kind of multidimensional data model, trigonometric polynomial is adopted to establish the mapping relation; The cube for different levels of division, and based on clustering effect to screen the optimal clustering number; Finally based on parallel coordinates, temporal multi-dimensional analysis of high-dimensional data, improve the robustness of the algorithm. Experiments prove that the proposed algorithm is concise and easy to use, can well realize the cube understanding and analysis of high-dimensional data.

     

/

返回文章
返回