NDLI: Maximizing the spread of influence through a social network

Please wait, while we are loading the content...

On-line science: the world-wide telescope as a prototype for the new computational science

Towards systematic design of distance functions for data mining applications

Golden Path Analyzer: using divide-and-conquer to cluster Web clickstreams

Style mining of electronic messages for multiple authorship discrimination: first results

An adaptive nearest neighbor search for a parts acquisition ePortal

Statistical learning from relational data

Generative model-based clustering of directional data

Empirical Bayesian data mining for discovering patterns in post-marketing drug safety

Mining high dimensional data for classifier knowledge

Architecting a knowledge discovery engine for military commanders utilizing massive runs of simulations

Analyzing customer behavior at Amazon.com

Mining distance-based outliers in near linear time with randomization and a simple pruning rule

Mining hepatitis data with temporal abstraction

Finding recent frequent itemsets adaptively over online data streams

Data quality through knowledge engineering

Adaptive duplicate detection using learnable string similarity measures

Information awareness: a prospective technical assessment

Probabilistic discovery of time series motifs

Similarity analysis on government regulations

An iterative hypothesis-testing strategy for pattern discovery

The data mining approach to automated software testing

Understanding captions in biomedical publications

Experimental design for solicitation campaigns

Efficient data reduction with EASE

Passenger-based predictive modeling of airline no-show rates

Using randomized response techniques for privacy-preserving data mining

Towards NIC-based intrusion detection

Extracting semantics from data cubes using cube transversals and closures

Capturing best practice for microarray gene expression data analysis

Applications of sampling and fractional factorial designs to model-free data squashing

Data-driven validation, completion and construction of event relationship networks

Translation-invariant mixture models for curve clustering

Clinical and financial outcomes analysis with existing hospital patient records

Experiments with random projections for machine learning

Visualizing concept drift

Information-theoretic co-clustering

Critical event prediction for proactive management in large-scale computer clusters

Accurate decision trees for mining high-speed data streams

Experimental study of discovering essential information from customer inquiry

SEWeP: using site semantics and a taxonomy to enhance the Web personalization process

Frequent-subsequence-based prediction of outer membrane proteins

Correlating synchronous and asynchronous data streams

Applying data mining in investigating money laundering crimes

Inverted matrix: efficient discovery of frequent items in large datasets in the context of interactive mining

Discovery of climate indices using clustering

A Web page prediction model based on click-stream tree representation of user behavior

To buy or not to buy: mining airfare data to minimize ticket purchase price

Knowledge-based data mining

Natural communities in large linked networks

Fragments of order

The anatomy of a multimodal information filter

Navigating massive data sets via local clustering

Maximizing the spread of influence through a social network

Mining viewpoint patterns in image databases

PROXIMUS: a framework for analyzing very high dimensional discrete-attributed datasets

Playing hide-and-seek with correlations

Visualizing changes in the structure of data for exploratory feature selection

Interactive exploration of coherent patterns in time-series gene expression data

Aggregation-based feature invention and relational concept classes

Efficient decision tree construction on streaming data

Cross-training: learning probabilistic mappings between topics

A bag of paths model for measuring structural similarity in Web documents

Generating English summaries of time series data using the Gricean maxims

Nantonac collaborative filtering: recommendation based on order responses

Assessment and pruning of hierarchical model based clustering

A two-way visualization method for clustered data

Privacy-preserving k-means clustering over vertically partitioned data

Empirical comparisons of various voting methods in bagging

Indexing multi-dimensional time-series with support for multiple distance measures

Mining data records in Web pages

Mining concept-drifting data streams using ensemble classifiers

On computing, storing and querying frequent patterns

CLOSET+: searching for the best strategies for mining frequent closed itemsets

Online novelty detection on temporal sequences

Mining unexpected rules by pushing user dynamics

Distributed cooperative mining for information consortia

On detecting differences between groups

Learning relational probability trees

Algorithms for estimating relative importance in networks

Graph-based anomaly detection

Screening and interpreting multi-item associations based on log-linear modeling

Carpenter: finding closed patterns in long biological datasets

CloseGraph: mining closed frequent graph patterns

New unsupervised clustering algorithm for large datasets

Eliminating noisy information in Web pages for data mining

Improving spatial locality of programs via data mining

Classifying large data sets using SVMs with hierarchical clusters

Mining phenotypes and informative genes from gene expression data

XRules: an effective structural classifier for XML data

Weighted Association Rule Mining using weighted support and significance framework

Fast vertical mining using diffsets

PaintingClass: interactive construction, visualization and exploration of decision trees

Efficient elastic burst detection in data streams

Time and sample efficient discovery of Markov blankets and direct causal relations

Distributed multivariate regression based on influential observations

Efficiently handling feature redundancy in high-dimensional data

Maximizing the spread of influence through a social network

Content Provider	ACM Digital Library
Author	Kleinberg, Jon Kempe, David Tardos, Éva
Abstract	Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of "word of mouth" in the promotion of new products. Recently, motivated by the design of viral marketing strategies, Domingos and Richardson posed a fundamental algorithmic problem for such social network processes: if we can try to convince a subset of individuals to adopt a new product or innovation, and the goal is to trigger a large cascade of further adoptions, which set of individuals should we target?We consider this problem in several of the most widely studied models in social network analysis. The optimization problem of selecting the most influential nodes is NP-hard here, and we provide the first provable approximation guarantees for efficient algorithms. Using an analysis framework based on submodular functions, we show that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models; our framework suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.We also provide computational experiments on large collaboration networks, showing that in addition to their provable guarantees, our approximation algorithms significantly out-perform node-selection heuristics based on the well-studied notions of degree centrality and distance centrality from the field of social networks.
Starting Page	137
Ending Page	146
Page Count	10
File Format	PDF
ISBN	1581137370
DOI	10.1145/956750.956769
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-08-24
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Diffusion of innovations Viral marketing Approximation algorithms Social networks
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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