اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRepresentative Methods of Computational Socioeconomics
196
0
0.0
(
0
)
تأليف
Tao Zhou
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The increasing data availability and imported analyzing tools from computer science and physical science have sharply changed traditional methodologies of social sciences, leading to a new branch named computational socioeconomics that studies various phenomena in socioeconomic development by using quantitative methods based on large-scale real-world data. Sited on recent publications, this Perspective will introduce three representative methods: (i) natural data analyses, (ii) large-scale online experiments, and (iii) integration of big data and surveys. This Perspective ends up with in-depth discussion on the limitations and challenges of the above-mentioned emerging methods.
قيم البحث
اقرأ أيضاً
Understanding how humans use and consume space by comparing stratified groups, either through observation or controlled study, is key to designing better spaces, cities, and policies. GPS data traces provide detailed movement patterns of individuals
but can be difficult to interpret due to the scale and scope of the data collected. For actionable insights, GPS traces are usually reduced to one or more features which express the spatial phenomenon of interest. However, it is not always clear which spatial features should be employed, and substantial effort can be invested into designing features which may or may not provide insight. In this paper we present an alternative approach: a standardized feature set with actionable interpretations that can be efficiently run against many datasets. We show that these features can distinguish between disparate human mobility patterns, although no single feature can distinguish them alone.
We reframe common tasks in jet physics in probabilistic terms, including jet reconstruction, Monte Carlo tuning, matrix element - parton shower matching for large jet multiplicity, and efficient event generation of jets in complex, signal-like region
s of phase space. We also introduce Ginkgo, a simplified, generative model for jets, that facilitates research into these tasks with techniques from statistics, machine learning, and combinatorial optimization. We review some of the recent research in this direction that has been enabled with Ginkgo. We show how probabilistic programming can be used to efficiently sample the showering process, how a novel trellis algorithm can be used to efficiently marginalize over the enormous number of clustering histories for the same observed particles, and how dynamic programming, A* search, and reinforcement learning can be used to find the maximum likelihood clustering in this enormous search space. This work builds bridges with work in hierarchical clustering, statistics, combinatorial optmization, and reinforcement learning.
Materials with thickness ranging from a few nanometers to a single atomic layer present unprecedented opportunities to investigate new phases of matter constrained to the two-dimensional plane.Particle-particle Coulomb interaction is dramatically aff
ected and shaped by the dimensionality reduction, driving well-established solid state theoretical approaches to their limit of applicability. Methodological developments in theoretical modelling and computational algorithms, in close interaction with experiments, led to the discovery of the extraordinary properties of two-dimensional materials, such as high carrier mobility, Dirac cone dispersion and bright exciton luminescence, and inspired new device design paradigms. This review aims to describe the computational techniques used to simulate and predict the optical, electronic and mechanical properties of two-dimensional materials, and to interpret experimental observations. In particular, we discuss in detail the particular challenges arising in the simulation of two-dimensional constrained fermions, and we offer our perspective on the future directions in this field.
In real-world systems, phase transitions often materialize abruptly, making it difficult to design appropriate controls that help uncover underlying processes. Some agent-based computational models display transformations similar to phase transitions
. For such cases, it is possible to elicit detailed underlying processes that can be subsequently tested for applicability in real-world systems. In a genetic algorithm, we investigate how a modest difference in the concentration of correct and incorrect knowledge leads to radically different outcomes obtained through learning efforts by a group of agents. We show that a difference in concentration of correct and incorrect knowledge triggers virtuous and vicious cycles that impact the emergent outcome. When virtuous cycles are in operation, delaying the onset of equilibrium attains superior outcomes. For the vicious cycles, reaching equilibrium quickly attains superior outcomes. Our approach helps uncover simple mechanisms by which Nature works, jettisoning the yoke of unrealistic assumptions endemic in mathematics-based approaches. Our explanatory model helps direct research to investigate concentrations of inputs that obtains outcomes on the favourable side of phase transitions. For example, by tracking change in concentration of relevant parameters, scientists may look for reasons why cells cease to reproduce fit cells in organs. This can help design rejuvenation of organs. Further, in the world of physics, our model may inform in situations where the dominant Ising model falls short.
Rankings of people and items has been highly used in selection-making, match-making, and recommendation algorithms that have been deployed on ranging of platforms from employment websites to searching tools. The ranking position of a candidate affect
s the amount of opportunities received by the ranked candidate. It has been observed in several works that the ranking of candidates based on their score can be biased for candidates belonging to the minority community. In recent works, the fairness-aware representative ranking was proposed for computing fairness-aware re-ranking of results. The proposed algorithm achieves the desired distribution of top-ranked results with respect to one or more protected attributes. In this work, we highlight the bias in fairness-aware representative ranking for an individual as well as for a group if the group is sub-active on the platform. We define individual unfairness and group unfairness and propose methods to generate ideal individual and group fair representative ranking if the universal representation ratio is known or unknown. The simulation results show the quantified analysis of fairness in the proposed solutions. The paper is concluded with open challenges and further directions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
