Efficient Representation, Measurement, and Recovery of Large-scale Networks

G. Mahindre, A. Jayasumana
{"title":"Efficient Representation, Measurement, and Recovery of Large-scale Networks","authors":"G. Mahindre, A. Jayasumana","doi":"10.1109/IGCC.2018.8752162","DOIUrl":null,"url":null,"abstract":"Real-world networks have millions of users and are complex in structure. Efficient techniques are required to capture the network characteristics as compact data. The overall purpose of this research is to mine information from partially or completely available graph data and obtain optimum data representation for networks. The first phase involves studying network data to draw meaningful relations and properties about the network. We extend this work to introduce a novel way of sampling graphs in lossless manner. The second phase involves observing and processing the partial data available to complete the graph data by estimation methods. We also leverage our knowledge about graphs to design an optimal network sampling technique. Subsequently, these techniques will be applied to both static as well as dynamic graphs.","PeriodicalId":388554,"journal":{"name":"2018 Ninth International Green and Sustainable Computing Conference (IGSC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Ninth International Green and Sustainable Computing Conference (IGSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IGCC.2018.8752162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Real-world networks have millions of users and are complex in structure. Efficient techniques are required to capture the network characteristics as compact data. The overall purpose of this research is to mine information from partially or completely available graph data and obtain optimum data representation for networks. The first phase involves studying network data to draw meaningful relations and properties about the network. We extend this work to introduce a novel way of sampling graphs in lossless manner. The second phase involves observing and processing the partial data available to complete the graph data by estimation methods. We also leverage our knowledge about graphs to design an optimal network sampling technique. Subsequently, these techniques will be applied to both static as well as dynamic graphs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大规模网络的有效表示、测量和恢复
现实世界的网络拥有数以百万计的用户,并且结构复杂。需要有效的技术来捕获网络特征作为紧凑的数据。本研究的总体目的是从部分或完全可用的图数据中挖掘信息,并获得网络的最佳数据表示。第一阶段是研究网络数据,绘制出网络的有意义的关系和属性。我们扩展了这项工作,引入了一种无损采样图的新方法。第二阶段包括观察和处理可用的部分数据,通过估计方法完成图数据。我们还利用我们关于图的知识来设计最佳的网络采样技术。随后,这些技术将应用于静态和动态图形。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Dynamic Programming Technique for Energy-Efficient Multicore Systems Holistic Approaches to HPC Power and Workflow Management* IGSC 2018 PhD Workshop on Power/Energy Management at Extreme Scale [Copyright notice] DiRP: Distributed Intelligent Rendezvous Point for Multicast Control Plane
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1