Ding-Zhu Du
Biographic Data
| ID | 1850716 |
|---|---|
| NAME | Ding-Zhu Du |
| GIVEN NAMES | Ding-Zhu |
| FAMILY NAME | Du |
| SIGNATURE | DU D |
| AFFILIATIONS | The University of Texas at Dallas |
| VERIFIED | No |
| TOTAL WORKS | 4 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 4 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2014 |
| LATEST PUBLICATION YEAR | 2024 |
| H-INDEX | 0 |
Co-Activity Maximization in Online Social Networks
Social media with online social networks has risen to be a prevalent force in information diffusion and public discourse. Despite its popularity and convenience, social media has been criticized for contributing to societal and ideological polarization as the result of trapping users in an echo chamber and filter bubbles. An emerging line of research focuses on ways to redesign content or link recommendation algorithms to mitigate the polarizatio…
Two-Phase Multidocument Summarization Through Content-Attention-Based Subtopic Detection
Multidocument summarization problem deals with extracting main information and ideas from a set of related documents. Solution to this problem is to find an extraction strategy that aims at finding a small subset of sentences that is able to cover the most important information about the whole document set. Although a large number of machine-learning-based methods have shown great promise, the lack of high-quality training data poses an inherent …
Distributed Rumor Blocking With Multiple Positive Cascades
Misinformation and rumor can spread rapidly and widely through online social networks and therefore rumor controlling has become a critical issue. It is assumed in the existing works that there is a single authority whose goal is to minimize the spread of rumor by generating a positive cascade. In this paper, we study a more realistic scenario when there is multiple positive cascades generated by different agents. For the multiple-cascade diffusi…
Maximizing rumor containment in social networks with constrained time
No prominent works on this page.
Maximizing rumor containment in social networks with constrained time
Distributed Rumor Blocking With Multiple Positive Cascades
Misinformation and rumor can spread rapidly and widely through online social networks and therefore rumor controlling has become a critical issue. It is assumed in the existing works that there is a single authority whose goal is to minimize the spread of rumor by generating a positive cascade. In this paper, we study a more realistic scenario when there is multiple positive cascades generated by different agents. For the multiple-cascade diffusi…
Two-Phase Multidocument Summarization Through Content-Attention-Based Subtopic Detection
Multidocument summarization problem deals with extracting main information and ideas from a set of related documents. Solution to this problem is to find an extraction strategy that aims at finding a small subset of sentences that is able to cover the most important information about the whole document set. Although a large number of machine-learning-based methods have shown great promise, the lack of high-quality training data poses an inherent …
Co-Activity Maximization in Online Social Networks
Social media with online social networks has risen to be a prevalent force in information diffusion and public discourse. Despite its popularity and convenience, social media has been criticized for contributing to societal and ideological polarization as the result of trapping users in an echo chamber and filter bubbles. An emerging line of research focuses on ways to redesign content or link recommendation algorithms to mitigate the polarizatio…
Computer Science (4 works) · Complex Network Analysis Techniques (3 works) · Mathematics (3 works) · Opinion Dynamics and Social Influence (3 works) · Algorithm (2 works) · Approximation algorithm (2 works) · Computer security (2 works) · Game Theory and Applications (2 works) · Mathematical optimization (2 works) · Misinformation (2 works)