Towards Network Reduction on Big Data

Xing Fang, J. Zhan, Nicholas Koceja
{"title":"Towards Network Reduction on Big Data","authors":"Xing Fang, J. Zhan, Nicholas Koceja","doi":"10.1109/SocialCom.2013.103","DOIUrl":null,"url":null,"abstract":"The increasing ease of data collection experience and the increasing availability of large data storage space lead to the existence of very large datasets that are commonly referred as \"Big Data\". Such data not only take over large amount of database storage, but also increase the difficulties for data analysis due to data diversity, which, also makes the datasets seemingly isolated with each other. In this paper, we present a solution to the problem that is to build up connections among the diverse datasets, based upon their similarities. Particularly, a concept of similarity graph along with a similarity graph generation algorithm were introduced. We then proposed a similarity graph reduction algorithm that reduces vertices of the graph for the purpose of graph simplification.","PeriodicalId":129308,"journal":{"name":"2013 International Conference on Social Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Social Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SocialCom.2013.103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The increasing ease of data collection experience and the increasing availability of large data storage space lead to the existence of very large datasets that are commonly referred as "Big Data". Such data not only take over large amount of database storage, but also increase the difficulties for data analysis due to data diversity, which, also makes the datasets seemingly isolated with each other. In this paper, we present a solution to the problem that is to build up connections among the diverse datasets, based upon their similarities. Particularly, a concept of similarity graph along with a similarity graph generation algorithm were introduced. We then proposed a similarity graph reduction algorithm that reduces vertices of the graph for the purpose of graph simplification.
面向大数据的网络精简
数据收集体验的日益便利和大数据存储空间的日益可用性导致了通常被称为“大数据”的超大型数据集的存在。这些数据不仅占用了大量的数据库存储空间,而且由于数据的多样性增加了数据分析的难度,也使得数据集看起来彼此孤立。在本文中,我们提出了一种解决方案,即根据不同数据集的相似性在不同数据集之间建立联系。特别介绍了相似图的概念和相似图生成算法。然后,我们提出了一种相似图约简算法,该算法通过减少图的顶点来简化图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信