DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks
The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Abstract
With the soaring development of large scale online social networks, online information sharing is becoming ubiquitous everyday. Various information is propagating through online social networks including both the positive and negative. In this paper, we focus on the negative information problems such as the online rumors. Rumor blocking is a serious problem in large-scale social networks. Malicious rumors could cause chaos in society and hence need to be blocked as soon as possible after being detected. In this paper, we propose a model of dynamic rumor influence minimization with user experience (DRIMUX). Our goal is to minimize the influence of the rumor (i.e., the number of users that have accepted and sent the rumor) by blocking a certain subset of nodes. A dynamic Ising propagation model considering both the global popularity and individual attraction of the rumor is presented based on a realistic scenario. In addition, different from existing problems of influence minimization, we take into account the constraint of user experience utility. Specifically, each node is assigned a tolerance time threshold. If the blocking time of each user exceeds that threshold, the utility of the network will decrease. Under this constraint, we then formulate the problem as a network inference problem with survival theory, and propose solutions based on maximum likelihood principle. Experiments are implemented based on large-scale real world networks and validate the effectiveness of our method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1999) · Cited by 12,854
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
An Approximate Distribution of Estimates of Variance Components
Satterthwaite, F. E. (1946) · Biometrics Bulletin · doi:10.2307/3002019 · Cited by 4,373
Measuring user influence in twitter: The million follower fallacy
Cha, M., Haddadi, H., Benevenuto, F., & Gummadi, K. (2010) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v4i1.14033 · Cited by 3,022
Chi-Square Tests with One Degree of Freedom; Extensions of the Mantel-Haenszel Procedure
Mantel, N. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500879 · Cited by 2,897
Dowsland, K. A., & Thompson, J. M. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_49 · Cited by 2,432
Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
Lee, T. D., & Yang, C. N. (1952) · Physical Review · doi:10.1103/physrev.87.410 · Cited by 2,228
Efficient influence maximization in social networks
Chen, W., Wang, Y., & Yang, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557047 · Cited by 2,156
The psychology of human-computer interaction
Rogers, Y. (1984) · Applied Ergonomics · doi:10.1016/0003-6870(84)90205-9 · Cited by 1,970
Cited by
Beyond Text: Multimodal Credibility Assessment Approaches for Online User-Generated Content
Choudhary, M., Chouhan, S. S., & Rathore, S. S. (2024) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3673236 · Cited by 20
Metadata
- Authors
- Wang, B., Chen, G., Fu, L., Song, L., & Wang, X.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2017-10-01
- Volume
- 29
- Issue
- 10
- Pages
- 2168-2181
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2735984347
- Cited by
- 178
- References
- 40
- FWCI
- 9.99
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.