二维界面中高维数据的分解与可视化

Mimoun Lamrini, M. Chkouri
{"title":"二维界面中高维数据的分解与可视化","authors":"Mimoun Lamrini, M. Chkouri","doi":"10.1109/ICSSD47982.2019.9002846","DOIUrl":null,"url":null,"abstract":"Data visualization has a crucial role in understanding and processing voluminous data (i.e., Big Data) and subsequently has become more important with the coincidence of the exponential growth of data analysis need.The problem of high-dimensional data visualization in a data processing software interface cannot be entirely displayed, in consideration that once the data size exceeds two-dimension, it cannot be projected into a two-dimension interface. Furthermore, the rough analysis and evaluation of high-dimensional data become considerably ambiguous, thus, making a precise decision on that data cannot be achieved. In order to overcome this anomaly, resorting to data dimensionality reduction is a plausible solution.In this paper, the integration of Principal Component Analysis (PCA) combined with the Matrix by Block Decomposition (MBD) method(A.K.A block segmentation). According to the literature, the MBD method turned out quite efficient in data segmentation, wherein a huge data can be divided into regular blocks. By doing so, it becomes easier to access and visualize a given part of data. In order to further enhance the visualization understanding, K-means segmentation has been integrated in our proposed algorithm.In our study, we took into account other data dimensionality reduction techniques such as Linear Discriminant Analysis (LDA), Multi-Dimensional Scaling(MDS).","PeriodicalId":342806,"journal":{"name":"2019 1st International Conference on Smart Systems and Data Science (ICSSD)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Decomposition and Visualization of High-Dimensional Data in a Two Dimensional Interface\",\"authors\":\"Mimoun Lamrini, M. Chkouri\",\"doi\":\"10.1109/ICSSD47982.2019.9002846\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data visualization has a crucial role in understanding and processing voluminous data (i.e., Big Data) and subsequently has become more important with the coincidence of the exponential growth of data analysis need.The problem of high-dimensional data visualization in a data processing software interface cannot be entirely displayed, in consideration that once the data size exceeds two-dimension, it cannot be projected into a two-dimension interface. Furthermore, the rough analysis and evaluation of high-dimensional data become considerably ambiguous, thus, making a precise decision on that data cannot be achieved. In order to overcome this anomaly, resorting to data dimensionality reduction is a plausible solution.In this paper, the integration of Principal Component Analysis (PCA) combined with the Matrix by Block Decomposition (MBD) method(A.K.A block segmentation). According to the literature, the MBD method turned out quite efficient in data segmentation, wherein a huge data can be divided into regular blocks. By doing so, it becomes easier to access and visualize a given part of data. In order to further enhance the visualization understanding, K-means segmentation has been integrated in our proposed algorithm.In our study, we took into account other data dimensionality reduction techniques such as Linear Discriminant Analysis (LDA), Multi-Dimensional Scaling(MDS).\",\"PeriodicalId\":342806,\"journal\":{\"name\":\"2019 1st International Conference on Smart Systems and Data Science (ICSSD)\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 1st International Conference on Smart Systems and Data Science (ICSSD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSSD47982.2019.9002846\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 1st International Conference on Smart Systems and Data Science (ICSSD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSD47982.2019.9002846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

数据可视化在理解和处理海量数据(即大数据)方面发挥着至关重要的作用,随着数据分析需求的指数级增长,数据可视化也变得越来越重要。数据处理软件界面中的高维数据可视化问题无法完全展现出来,因为一旦数据规模超过二维,就无法投影到二维界面中。此外,对高维数据的粗略分析和评价变得相当模糊,因此无法对该数据做出精确的决策。为了克服这种异常,采用数据降维是一种可行的解决方案。本文采用分块分解(MBD)方法,将主成分分析(PCA)与矩阵相结合块分割)。从文献来看,MBD方法在数据分割方面是非常高效的,可以将庞大的数据分割成规则的块。通过这样做,可以更容易地访问和可视化给定的数据部分。为了进一步增强可视化理解,我们提出的算法中集成了k均值分割。在我们的研究中,我们考虑了其他数据降维技术,如线性判别分析(LDA),多维尺度(MDS)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Decomposition and Visualization of High-Dimensional Data in a Two Dimensional Interface
Data visualization has a crucial role in understanding and processing voluminous data (i.e., Big Data) and subsequently has become more important with the coincidence of the exponential growth of data analysis need.The problem of high-dimensional data visualization in a data processing software interface cannot be entirely displayed, in consideration that once the data size exceeds two-dimension, it cannot be projected into a two-dimension interface. Furthermore, the rough analysis and evaluation of high-dimensional data become considerably ambiguous, thus, making a precise decision on that data cannot be achieved. In order to overcome this anomaly, resorting to data dimensionality reduction is a plausible solution.In this paper, the integration of Principal Component Analysis (PCA) combined with the Matrix by Block Decomposition (MBD) method(A.K.A block segmentation). According to the literature, the MBD method turned out quite efficient in data segmentation, wherein a huge data can be divided into regular blocks. By doing so, it becomes easier to access and visualize a given part of data. In order to further enhance the visualization understanding, K-means segmentation has been integrated in our proposed algorithm.In our study, we took into account other data dimensionality reduction techniques such as Linear Discriminant Analysis (LDA), Multi-Dimensional Scaling(MDS).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信