NDLI: Inferring the Underlying Structure of Information Cascades

Content Provider	IEEE Xplore Digital Library
Author	Bo Zong Yinghui Wu Singh, A.K. Xifeng Yan
Copyright Year	2012
Abstract	In social networks, information and influence diffuse among users as cascades. While the importance of studying cascades has been recognized in various applications, it is difficult to observe the complete structure of cascades in practice. In this paper we study the cascade inference problem following the independent cascade model, and provide a full treatment from complexity to algorithms: (a) we propose the idea of consistent trees as the inferred structures for cascades, these trees connect source nodes and observed nodes with paths satisfying the constraints from the observed temporal information. (b) We introduce metrics to measure the likelihood of consistent trees as inferred cascades, as well as several optimization problems for finding them. (c) We show that the decision problems for consistent trees are in general NP-complete, and that the optimization problems are hard to approximate. (d) We provide approximation algorithms with performance guarantees on the quality of the inferred cascades, as well as heuristics. We experimentally verify the efficiency and effectiveness of our inference algorithms, using real and synthetic data.
Starting Page	1218
Ending Page	1223
File Size	324470
Page Count	6
File Format	PDF
ISBN	9781467346498
ISSN	15504786
DOI	10.1109/ICDM.2012.100
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-12-10
Publisher Place	Belgium
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vegetation Approximation methods Approximation algorithms Inference algorithms Measurement Uncertainty Steiner trees cascade prediction information diffusion
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Online Node-Weighted Steiner Tree and Related Problems

Inferring the underlying structure of information cascades.

Inferring the Underlying Structure of Information Cascades

Tighter Bounds for Graph Steiner Tree Approximation

Can cascades be predicted?

Fast reoptimization of Steiner trees

A lightweight method to investigate unknown social network structure

Efficient construction of directed Redundant Steiner trees

Split and Join: Strong Partitions and Universal Steiner Trees for Graphs

Inferring the Underlying Structure of Information Cascades

Similar Documents

Online Node-Weighted Steiner Tree and Related Problems

Inferring the underlying structure of information cascades.

Inferring the Underlying Structure of Information Cascades

Tighter Bounds for Graph Steiner Tree Approximation

Can cascades be predicted?

Fast reoptimization of Steiner trees

A lightweight method to investigate unknown social network structure

Efficient construction of directed Redundant Steiner trees

Split and Join: Strong Partitions and Universal Steiner Trees for Graphs

Inferring the Underlying Structure of Information Cascades