Information Search Algorithm Based on Markov Model in the Mobile Social Network
preprint
OA: closed
CC-BY-4.0
Abstract
In the era of big data, how to find the source of information diffusion from massive social media and predict the future trend of information diffusion has become a hot issue that people are very concerned about, which presents new challenges for the application of data mining in hot issues. The most influential information mining methods can be divided into static and dynamic. The static method is only specific to a point in time, and has its one-sided views. There are four kinds of dynamic methods commonly used, all of which have their limitations. The independent cascading model and the linear threshold model are the most widely used, both of which require the activation process to be placed in a discrete cycle and are discontinuous. This paper independently studies a model based on continuous time Markov process to simulate the information diffusion in the real world, and predicts the information diffusion ability of each node in the future according to the information diffusion situation, so as to achieve the purpose of judging the future trend.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-29T02:00:03.542394+00:00
License: CC-BY-4.0