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 language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher | Springer Verlag |
| Pages | 182-192 |
| Number of pages | 11 |
| Volume | 9197 |
| ISBN (Print) | 9783319217857 |
| DOIs | |
| Publication status | Published - 2015 |
| Externally published | Yes |
| Event | 4th International Conference on Computational Social Networks, CSoNet 2015 - Beijing, China Duration: 2015 Aug 4 → 2015 Aug 6 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 9197 |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 4th International Conference on Computational Social Networks, CSoNet 2015 |
|---|---|
| Country | China |
| City | Beijing |
| Period | 15/8/4 → 15/8/6 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
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 proceeding › Conference contribution
}
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 -