The Minimum Information Dominating Set for Opinion Sampling in Social Networks.
IEEE Transactions on Network Science and Engineering（2016）
摘要
We consider the problem of sampling a node-valued graph. The objective is to infer the values of all nodes from that of a minimum subset of nodes by exploiting correlations in node values. We first introduce the concept of information dominating set (IDS). A subset of nodes in a given graph is an IDS if the values of these nodes are sufficient to infer the values of all nodes. We focus on two fund...
更多查看译文
关键词
Social network services,Power system faults,Time complexity,Information management,Correlation,Sampling methods,Graph theory
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要