• Corpus ID: 1644087

Minimum Information Dominating Set for Opinion Sampling

  title={Minimum Information Dominating Set for Opinion Sampling},
  author={Jianhang Gao and Qing Zhao and Ananthram Swami},
We consider the problem of inferring the opinions of a social network through strategically sampling a minimum subset of nodes by exploiting correlations in node opinions. We first introduce the concept of information dominating set (IDS). A subset of nodes in a given network is an IDS if knowing the opinions of nodes in this subset is sufficient to infer the opinion of the entire network. We focus on two fundamental algorithmic problems: (i) given a subset of the network, how to determine… 
1 Citations

Figures from this paper


A better approximation ratio for the vertex cover problem
It is observed that a solution of the semidefinite relaxation for vertex cover, when strengthened with the triangle inequalities, can be transformed into a solution to a balanced cut problem, and therefore the existence of big well-separated sets in the sense of Arora et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
Majority Consensus and the Local Majority Rule
It is shown that, for any truly local network of agents, there are instances in which the network is not capable of reaching such consensus, and every truly local computation approach that requires reaching consensus is not failure-free.
Respondent-driven sampling : A new approach to the study of hidden populations
A new variant of chain-referral sampling, respondent-driven sampling, is introduced that employs a dual system of structured incentives to overcome some of the deficiencies of such samples and discusses how respondent- driven sampling can improve both network sampling and ethnographic investigation.
A Notion of Equilibrium and Its Possibility Under Majority Rule
Consider a committee that is faced with the task of deciding on how to change the magnitude of several variables. It is assumed that agreement is defined by majority rule. The decision-making body
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
    50 Years of Integer Programming
  • 1972
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
When properly undertaken, the sample survey provides an objective, efficient, and valid method of obtaining the characteristics of an entire population from only a small part of that population.
On the Two Different Aspects of the Representative Method: the Method of Stratified Sampling and the Method of Purposive Selection
Owing to the work of the International Statistical Institute,* and perhaps still more to personal achievements of Professor A.L. Bowley, the theory and the possibility of practical applications of
On adaptive sampling
We analyze the storage/accuracy trade-off of an adaptive sampling algorithm due to Wegman that makes it possible to evaluate probabilistically the number of distinct elements in a large file stored
Indirect Sampling
  • Springer
  • 2007