855 citations · 983 across the 5 of their papers we have counts for
6 papers
Combating Fake News: A Survey on Identification and Mitigation Techniques
Karishma Sharma, Feng Qian, He Jiang +3
The proliferation of fake news on social media has opened up new directions of research for timely identification and containment of fake news, and mitigation of its widespread imp…
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano +2
We study the problem of extracting a selective connector for a given set of query vertices in a graph . A selective connector is a subgraph of which…
Matrix completion with queries
Natali Ruchansky, Mark Crovella, Evimaria Terzi
In many applications, e.g., recommender systems and traffic monitoring, the data comes in the form of a matrix that is only partially observed and low rank. A fundamental data-anal…
Targeted matrix completion
Natali Ruchansky, Mark Crovella, Evimaria Terzi
Matrix completion is a problem that arises in many data-analysis settings where the input consists of a partially-observed matrix (e.g., recommender systems, traffic matrix analysi…
CSI: A Hybrid Deep Model for Fake News Detection
Natali Ruchansky, Sungyong Seo, Yan Liu
The topic of fake news has drawn attention both from the public and the academic communities. Such misinformation has the potential of affecting public opinion, providing an opport…
The Minimum Wiener Connector
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano +2
The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector:…