Biased respondent group selection under limited budget for minority opinion survey

Donghyun Kim, Wei Wang, Matthew Tetteh, Jun Liang, Soyoon Park, Wonjun Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper discusses a new approach to use the information from a special social network with high homophily to select a survey respondent group under a limited budget such that the result of the survey is biased to the minority opinions. This approach has a wide range of potential applications, e.g. collecting complaints from the customers of a new product while most of them are satisfied. We formally define the problem of computing such group with better utilization as the p-biased representative selection problem (p-BRSP). This problem has two separate objectives and is difficult to deal with. Thus, we also propose a new unified-objective which is a function of the two optimization objectives. Most importantly, we introduce two polynomial time heuristic algorithms for the problem, where each of which has an approximation ratio with respect to each of the objectives.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages182-192
Number of pages11
Volume9197
ISBN (Print)9783319217857
DOIs
Publication statusPublished - 2015
Externally publishedYes
Event4th International Conference on Computational Social Networks, CSoNet 2015 - Beijing, China
Duration: 2015 Aug 42015 Aug 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9197
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Computational Social Networks, CSoNet 2015
CountryChina
CityBeijing
Period15/8/415/8/6

Fingerprint

Biased
Heuristic algorithms
Polynomials
Heuristic algorithm
Social Networks
Polynomial-time Algorithm
Customers
Optimization
Computing
Approximation
Range of data

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kim, D., Wang, W., Tetteh, M., Liang, J., Park, S., & Lee, W. (2015). Biased respondent group selection under limited budget for minority opinion survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9197, pp. 182-192). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9197). Springer Verlag. https://doi.org/10.1007/978-3-319-21786-4_16

Biased respondent group selection under limited budget for minority opinion survey. / Kim, Donghyun; Wang, Wei; Tetteh, Matthew; Liang, Jun; Park, Soyoon; Lee, Wonjun.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9197 Springer Verlag, 2015. p. 182-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9197).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, D, Wang, W, Tetteh, M, Liang, J, Park, S & Lee, W 2015, Biased respondent group selection under limited budget for minority opinion survey. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 9197, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9197, Springer Verlag, pp. 182-192, 4th International Conference on Computational Social Networks, CSoNet 2015, Beijing, China, 15/8/4. https://doi.org/10.1007/978-3-319-21786-4_16
Kim D, Wang W, Tetteh M, Liang J, Park S, Lee W. Biased respondent group selection under limited budget for minority opinion survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9197. Springer Verlag. 2015. p. 182-192. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-21786-4_16
Kim, Donghyun ; Wang, Wei ; Tetteh, Matthew ; Liang, Jun ; Park, Soyoon ; Lee, Wonjun. / Biased respondent group selection under limited budget for minority opinion survey. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9197 Springer Verlag, 2015. pp. 182-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{120730895def40d08f2cf6b24647f06e,
title = "Biased respondent group selection under limited budget for minority opinion survey",
abstract = "This paper discusses a new approach to use the information from a special social network with high homophily to select a survey respondent group under a limited budget such that the result of the survey is biased to the minority opinions. This approach has a wide range of potential applications, e.g. collecting complaints from the customers of a new product while most of them are satisfied. We formally define the problem of computing such group with better utilization as the p-biased representative selection problem (p-BRSP). This problem has two separate objectives and is difficult to deal with. Thus, we also propose a new unified-objective which is a function of the two optimization objectives. Most importantly, we introduce two polynomial time heuristic algorithms for the problem, where each of which has an approximation ratio with respect to each of the objectives.",
author = "Donghyun Kim and Wei Wang and Matthew Tetteh and Jun Liang and Soyoon Park and Wonjun Lee",
year = "2015",
doi = "10.1007/978-3-319-21786-4_16",
language = "English",
isbn = "9783319217857",
volume = "9197",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "182--192",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Biased respondent group selection under limited budget for minority opinion survey

AU - Kim, Donghyun

AU - Wang, Wei

AU - Tetteh, Matthew

AU - Liang, Jun

AU - Park, Soyoon

AU - Lee, Wonjun

PY - 2015

Y1 - 2015

N2 - This paper discusses a new approach to use the information from a special social network with high homophily to select a survey respondent group under a limited budget such that the result of the survey is biased to the minority opinions. This approach has a wide range of potential applications, e.g. collecting complaints from the customers of a new product while most of them are satisfied. We formally define the problem of computing such group with better utilization as the p-biased representative selection problem (p-BRSP). This problem has two separate objectives and is difficult to deal with. Thus, we also propose a new unified-objective which is a function of the two optimization objectives. Most importantly, we introduce two polynomial time heuristic algorithms for the problem, where each of which has an approximation ratio with respect to each of the objectives.

AB - This paper discusses a new approach to use the information from a special social network with high homophily to select a survey respondent group under a limited budget such that the result of the survey is biased to the minority opinions. This approach has a wide range of potential applications, e.g. collecting complaints from the customers of a new product while most of them are satisfied. We formally define the problem of computing such group with better utilization as the p-biased representative selection problem (p-BRSP). This problem has two separate objectives and is difficult to deal with. Thus, we also propose a new unified-objective which is a function of the two optimization objectives. Most importantly, we introduce two polynomial time heuristic algorithms for the problem, where each of which has an approximation ratio with respect to each of the objectives.

UR - http://www.scopus.com/inward/record.url?scp=84947224475&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947224475&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-21786-4_16

DO - 10.1007/978-3-319-21786-4_16

M3 - Conference contribution

AN - SCOPUS:84947224475

SN - 9783319217857

VL - 9197

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 182

EP - 192

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -