Pathways Between Social Science and Computational Social Science

 







This volume shows that the emergence of computational social science (CSS) is an endogenous response to problems from within the social sciences and not exogeneous. The three parts of the volume address various pathways along which CSS has been developing from and interacting with existing research frameworks. The first part exemplifies how new theoretical models and approaches on which CSS research is based arise from theories of social science. The second part is about methodological advances facilitated by CSS-related techniques. The third part illustrates the contribution of CSS to traditional social science topics, further attesting to the embedded nature of CSS. The expected readership of the volume includes researchers with a traditional social science background who wish to approach CSS, experts in CSS looking for substantive links to more traditional social science theories, methods and topics, and finally, students working in both fields.


TABLE OF CONTENTS:


Modeling the Complex Network of Social Interactions
Pages 3-19
Kertész, János (et al.)


Formal Design Methods and the Relation Between Simulation Models and Theory: A Philosophy of Science Point of View
Pages 21-45
Troitzsch, Klaus G.


The Potential of Automated Text Analytics in Social Knowledge Building
Pages 49-70
Németh, Renáta (et al.)


Combining Scientific and Non-scientific Surveys to Improve Estimation and Reduce Costs
Pages 71-93
Sakshaug, Joseph W. (et al.)


Harnessing the Power of Data Science to Grasp Insights About Human Behaviour, Thinking, and Feeling from Social Media Images
Pages 95-122
Dudău, Diana Paula


Validating Simulation Models: The Case of Opinion Dynamics
Pages 123-155
Troitzsch, Klaus G.


A Spatio-Temporal Approach to Latent Variables: Modelling Gender (im)balance in the Big Data Era
Pages 159-177
Crippa, Franca (et al.)


Agent-Based Organizational Ecologies: A Generative Approach to Market Evolution
Pages 179-196
García-Díaz, César


Networks of the Political Elite and Political Agenda Topics: Creation and Analysis of Historical Corpora Using NLP and SNA Methods
Pages 197-214
Gulyás, Attila (et al.)




From Durkheim to Machine Learning: Finding the Relevant Sociological Content in Depression and Suicide-Related Social Media Discourses
Pages 237-258
Koltai, Júlia (et al.)

Comments

Post a Comment

Popular posts from this blog

Smart Lotteries in School Choice Ex-ante Pareto-Improvement with Ex-post Stability

Image
Working Paper: https://cgi.cse.unsw.edu.au/~haziz/PIRMES.pdf  Abstract: In a typical school choice application, the students have strict preferences over the schools while the schools have coarse priorities over the students based on their distance and their enrolled siblings. The outcome of a centralized admission mechanism is then usually obtained by the Deferred Acceptance (DA) algorithm with random tie-breaking. Therefore, every possible outcome of this mechanism is a stable solution for the coarse priorities that will arise with certain probability. This implies a probabilistic assignment, where the admission probability for each student-school pair is specified. In this paper, we propose a new efficiency-improving stable `smart lottery' mechanism. We aim to improve the probabilistic assignment ex-ante in a stochastic dominance sense, while ensuring that the improved random matching is still ex-post stable, meaning that it can be decomposed into stable matchings regarding the ...
Read more

Proportionally Representative Clustering

Image
H. Aziz, B. Lee, S. Morota Chu, and J. Vollen. Proportionally Representative Clustering.  WINE 2024 .  [  Pdf  ]  In recent years, there has been a surge in effort to formalize notions of fairness in machine learning. We focus on centroid clustering— one of the fundamental tasks in unsupervised machine learning. We pro- pose a new axiom “proportionally representative fairness” (PRF) that is designed for clustering problems where the selection of centroids re- flects the distribution of data points and how tightly they are clustered together. Our fairness concept is not satisfied by existing fair cluster- ing algorithms. We design efficient algorithms to achieve PRF both for unconstrained and discrete clustering problems. Our algorithm for the unconstrained setting is also the first known polynomial-time approxi- mation algorithm for the well-studied Proportional Fairness (PF) axiom [ 13 ]. Our algorithm for the discrete setting also matches the best kn...
Read more

Fair budgets from ranked ballots: PB-EAR

How do you split a shared budget fairly when people rank projects that cost very different amounts? PB-EAR, from our AAAI 2021 paper  Proportionally Representative Participatory Budgeting with Ordinal Preferences  ( AAAI version ), gives every voter an equal slice of the budget and lets groups pool their slices to fund the projects they rank highest, looking further down the ballots only when nothing is yet affordable. Every cohesive group is guaranteed its proportional share, and the rule extends our  Expanding Approvals Rule  for elections to budgets with project costs, ties and unequal voter weights.  That makes it a natural fit for DAO grant rounds such as   TheDAO Security Fund 's ETHSecurity Initiatives, where badge holders will rank the security initiatives listed on   the app  to allocate the fund's budget. The two-minute video below walks through a worked example. Here's an educational tool someone built to show how PB-EAR works. 
Read more