Mining Reaction and Diffusion Dynamics in Social Activities

• URL: http://arxiv.org/abs/2208.04846v1
• Date: Sun, 7 Aug 2022 15:42:57 GMT
• Title: Mining Reaction and Diffusion Dynamics in Social Activities
• Authors: Taichi Murayama and Yasuko Matsubara and Sakurai Yasushi
• Abstract summary: Large quantifies of online user activity data, such as weekly web search volumes, serve as an important social sensor. It is an important task to accurately forecast the future activity by discovering latent interactions from such data. F FluxCube is an effective mining method that forecasts large collections of co-evolving online user activity.
• Score: 4.288475943477759
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Large quantifies of online user activity data, such as weekly web search volumes, which co-evolve with the mutual influence of several queries and locations, serve as an important social sensor. It is an important task to accurately forecast the future activity by discovering latent interactions from such data, i.e., the ecosystems between each query and the flow of influences between each area. However, this is a difficult problem in terms of data quantity and complex patterns covering the dynamics. To tackle the problem, we propose FluxCube, which is an effective mining method that forecasts large collections of co-evolving online user activity and provides good interpretability. Our model is the expansion of a combination of two mathematical models: a reaction-diffusion system provides a framework for modeling the flow of influences between local area groups and an ecological system models the latent interactions between each query. Also, by leveraging the concept of physics-informed neural networks, FluxCube achieves high interpretability obtained from the parameters and high forecasting performance, together. Extensive experiments on real datasets showed that FluxCube outperforms comparable models in terms of the forecasting accuracy, and each component in FluxCube contributes to the enhanced performance. We then show some case studies that FluxCube can extract useful latent interactions between queries and area groups.

Related papers

• Most Influential Subset Selection: Challenges, Promises, and Beyond [9.479235005673683]
  We study the Most Influential Subset Selection (MISS) problem, which aims to identify a subset of training samples with the greatest collective influence. We conduct a comprehensive analysis of the prevailing approaches in MISS, elucidating their strengths and weaknesses. We demonstrate that an adaptive version of theses which applies them iteratively, can effectively capture the interactions among samples.
  arXiv  Detail & Related papers  (2024-09-25T20:00:23Z)
• Influence Maximization via Graph Neural Bandits [54.45552721334886]
  We set the IM problem in a multi-round diffusion campaign, aiming to maximize the number of distinct users that are influenced. We propose the framework IM-GNB (Influence Maximization with Graph Neural Bandits), where we provide an estimate of the users' probabilities of being influenced.
  arXiv  Detail & Related papers  (2024-06-18T17:54:33Z)
• DySuse: Susceptibility Estimation in Dynamic Social Networks [2.736093604280113]
  We propose a task, called susceptibility estimation in dynamic social networks, which is more realistic and valuable in real-world applications. We leverage a structural feature module to independently capture the structural information of influence diffusion on each single graph snapshot. Our framework is superior to the existing dynamic graph embedding models and has satisfactory prediction performance in multiple influence diffusion models.
  arXiv  Detail & Related papers  (2023-08-21T03:28:34Z)
• Improving Multi-Interest Network with Stable Learning [13.514488368734776]
  We propose a novel multi-interest network, named DEep Stable Multi-Interest Learning (DESMIL) DESMIL tries to eliminate the influence of subtle dependencies among captured interests via learning weights for training samples. We conduct extensive experiments on public recommendation datasets, a large-scale industrial dataset and the synthetic datasets.
  arXiv  Detail & Related papers  (2022-07-14T07:49:28Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Preference Enhanced Social Influence Modeling for Network-Aware Cascade Prediction [59.221668173521884]
  We propose a novel framework to promote cascade size prediction by enhancing the user preference modeling. Our end-to-end method makes the user activating process of information diffusion more adaptive and accurate.
  arXiv  Detail & Related papers  (2022-04-18T09:25:06Z)
• Information Interaction Profile of Choice Adoption [2.9972063833424216]
  We introduce an efficient method to infer the entities interaction network and its evolution according to the temporal distance separating interacting entities. The interaction profile allows characterizing the mechanisms of the interaction processes. We show that the effect of a combination of exposures on a user is more than the sum of each exposure's independent effect--there is an interaction.
  arXiv  Detail & Related papers  (2021-04-28T10:42:25Z)
• Deep Archimedean Copulas [98.96141706464425]
  ACNet is a novel differentiable neural network architecture that enforces structural properties. We show that ACNet is able to both approximate common Archimedean Copulas and generate new copulas which may provide better fits to data.
  arXiv  Detail & Related papers  (2020-12-05T22:58:37Z)
• Distributed Learning via Filtered Hyperinterpolation on Manifolds [2.2046162792653017]
  This paper studies the problem of learning real-valued functions on manifold. Motivated by the problem of handling large data sets, it presents a parallel data processing approach. We prove quantitative relations between the approximation quality of the learned function over the entire manifold.
  arXiv  Detail & Related papers  (2020-07-18T10:05:18Z)
• Causal Discovery in Physical Systems from Videos [123.79211190669821]
  Causal discovery is at the core of human cognition. We consider the task of causal discovery from videos in an end-to-end fashion without supervision on the ground-truth graph structure.
  arXiv  Detail & Related papers  (2020-07-01T17:29:57Z)
• Influence Functions in Deep Learning Are Fragile [52.31375893260445]
  influence functions approximate the effect of samples in test-time predictions. influence estimates are fairly accurate for shallow networks. Hessian regularization is important to get highquality influence estimates.
  arXiv  Detail & Related papers  (2020-06-25T18:25:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.