IDEAS home Printed from https://ideas.repec.org/a/spr/qualqt/v58y2024i2d10.1007_s11135-023-01680-1.html
   My bibliography  Save this article

A network model for multiple selection questions in opinion surveys

Author

Listed:
  • Stefano Benati

    (Università di Trento)

  • Justo Puerto

    (IMUS. Universidad de Sevilla)

Abstract

Opinion surveys can contain closed questions to which respondents can give multiple answers. We propose to model these data as networks in which vertices are the eligible items and arcs are the respondents. This representation opens up the possibility of using complex networks methodologies to retrieve information and most prominently, the possibility of using clustering/community detection techniques to reduce data complexity. We will take advantage of the implicit null hypothesis of the modularity function, namely, that items are chosen without any preferential pairing, to show how the hypothesis can be tested through the usual calculation of p-values. We illustrate the methodology with an application to Eurobarometer data. There, a question about national concerns can receive up to two selections. We will show that community clustering groups together concerns that can be interpreted in a consistent way and in general terms, such as Economy, or Security or Welfare issues. Moreover, we will show how different society groups are worried by different class of items.

Suggested Citation

  • Stefano Benati & Justo Puerto, 2024. "A network model for multiple selection questions in opinion surveys," Quality & Quantity: International Journal of Methodology, Springer, vol. 58(2), pages 1163-1179, April.
  • Handle: RePEc:spr:qualqt:v:58:y:2024:i:2:d:10.1007_s11135-023-01680-1
    DOI: 10.1007/s11135-023-01680-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11135-023-01680-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11135-023-01680-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bogumił Kamiński & Valérie Poulin & Paweł Prałat & Przemysław Szufel & François Théberge, 2019. "Clustering via hypergraph modularity," PLOS ONE, Public Library of Science, vol. 14(11), pages 1-15, November.
    2. Benati, Stefano & Puerto, Justo & Rodríguez-Chía, Antonio M. & Temprano, Francisco, 2022. "A mathematical programming approach to overlapping community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 602(C).
    3. G. Agarwal & D. Kempe, 2008. "Modularity-maximizing graph communities via mathematical programming," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 66(3), pages 409-418, December.
    4. Gilles ROUET, 2016. "European Union: fears and hopes," Eastern Journal of European Studies, Centre for European Studies, Alexandru Ioan Cuza University, vol. 7, pages 5-33, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiang, Ju & Tang, Yan-Ni & Gao, Yuan-Yuan & Zhang, Yan & Deng, Ke & Xu, Xiao-Ke & Hu, Ke, 2015. "Multi-resolution community detection based on generalized self-loop rescaling strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 432(C), pages 127-139.
    2. Ponce, Diego & Puerto, Justo & Temprano, Francisco, 2024. "Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 519-538.
    3. Liu, X. & Murata, T., 2010. "Advanced modularity-specialized label propagation algorithm for detecting communities in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(7), pages 1493-1500.
    4. Vincent Labatut & Jean-Michel Balasque, 2012. "Detection and Interpretation of Communities in Complex Networks: Methods and Practical Application," Post-Print hal-00633653, HAL.
    5. Yazdanparast, Sakineh & Havens, Timothy C., 2017. "Modularity maximization using completely positive programming," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 20-32.
    6. Dong Wang & Jiexun Li & Kaiquan Xu & Yizhen Wu, 2017. "Sentiment community detection: exploring sentiments and relationships in social networks," Electronic Commerce Research, Springer, vol. 17(1), pages 103-132, March.
    7. Luca Brusa & Catherine Matias, 2024. "Model‐based clustering in simple hypergraphs through a stochastic blockmodel," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 51(4), pages 1661-1684, December.
    8. Harun Pirim & Burak Eksioglu & Fred W. Glover, 2018. "A Novel Mixed Integer Linear Programming Model for Clustering Relational Networks," Journal of Optimization Theory and Applications, Springer, vol. 176(2), pages 492-508, February.
    9. Ke Hu & Ju Xiang & Yun-Xia Yu & Liang Tang & Qin Xiang & Jian-Ming Li & Yong-Hong Tang & Yong-Jun Chen & Yan Zhang, 2020. "Significance-based multi-scale method for network community detection and its application in disease-gene prediction," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-24, March.
    10. Chessa, Michela & Persenda, Arnaud & Torre, Dominique, 2023. "Brexit and Canadadvent: An application of graphs and hypergraphs to recent international trade agreements," International Economics, Elsevier, vol. 175(C), pages 1-12.
    11. Sonia Cafieri & Alberto Costa & Pierre Hansen, 2014. "Reformulation of a model for hierarchical divisive graph modularity maximization," Annals of Operations Research, Springer, vol. 222(1), pages 213-226, November.
    12. Sukeda, Issey & Miyauchi, Atsushi & Takeda, Akiko, 2023. "A study on modularity density maximization: Column generation acceleration and computational complexity analysis," European Journal of Operational Research, Elsevier, vol. 309(2), pages 516-528.
    13. Xiang-Sun Zhang & Zhenping Li & Rui-Sheng Wang & Yong Wang, 2012. "A combinatorial model and algorithm for globally searching community structure in complex networks," Journal of Combinatorial Optimization, Springer, vol. 23(4), pages 425-442, May.
    14. Ruijie Liu & Yajing Huang, 2023. "Structural Analysis of Projected Networks of Shareholders and Stocks Based on the Data of Large Shareholders’ Shareholding in China’s Stocks," Mathematics, MDPI, vol. 11(6), pages 1-25, March.
    15. Li, Zhangtao & Liu, Jing, 2016. "A multi-agent genetic algorithm for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 449(C), pages 336-347.
    16. Thang N. Dinh & Nam P. Nguyen & Md Abdul Alim & My T. Thai, 2015. "A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 747-767, October.
    17. Santiago, Rafael & Lamb, Luís C., 2017. "Efficient modularity density heuristics for large graphs," European Journal of Operational Research, Elsevier, vol. 258(3), pages 844-865.
    18. Jinshan Qi & Liang Xun & Xiaoping Zhou & Zhiyu Li & Yu Liu & Hengchao Cheng, 2018. "Micro-blog user community discovery using generalized SimRank edge weighting method," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-21, May.
    19. Alexander Belyi & Stanislav Sobolevsky & Alexander Kurbatski & Carlo Ratti, 2023. "Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(2), pages 269-297, October.
    20. Chen-Kun Tsung & Sing-Ling Lee & Hann-Jang Ho & ShengKai Chou, 2021. "A modularity-maximization-based approach for detecting multi-communities in social networks," Annals of Operations Research, Springer, vol. 303(1), pages 381-411, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:qualqt:v:58:y:2024:i:2:d:10.1007_s11135-023-01680-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.