{"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.