Integer and combinatorial optimization
Integer and combinatorial optimization
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Mining knowledge-sharing sites for viral marketing
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Information diffusion through blogspace
Proceedings of the 13th international conference on World Wide Web
Link analysis, eigenvectors and stability
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Topic and role discovery in social networks
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Patterns of influence in a recommendation network
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Efficient influence maximization in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Community-based greedy algorithm for mining top-K influential nodes in mobile social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
CELF++: optimizing the greedy algorithm for influence maximization in social networks
Proceedings of the 20th international conference companion on World wide web
ECODE: event-based community detection from social networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
A data-based approach to social influence maximization
Proceedings of the VLDB Endowment
Topic correlation and individual influence analysis in online forums
Expert Systems with Applications: An International Journal
Estimate on expectation for influence maximization in social networks
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Influence maximizing and local influenced community detection based on multiple spread model
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
Controlling infection by blocking nodes and links simultaneously
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Spread of information in a social network using influential nodes
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Interest-matching information propagation in multiple online social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Influence spread in large-scale social networks --- a belief propagation approach
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
On approximation of real-world influence spread
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Viral marketing for product cross-sell through social networks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Discovering influential nodes from trust network
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Finding influencers in networks using social capital
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Hierarchical influence maximization for advertising in multi-agent markets
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
StaticGreedy: solving the scalability-accuracy dilemma in influence maximization
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Personalized influence maximization on social networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Content coverage maximization on word networks for hierarchical topic summarization
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Content-centric flow mining for influence analysis in social streams
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Probabilistic solutions of influence propagation on social networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
A probability based algorithm for influence maximization in social networks
Proceedings of the 5th Asia-Pacific Symposium on Internetware
Pagerank with priors: an influence propagation perspective
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Don't count the number of friends when you are spreading information in social networks
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
Preference-based mining of top-K influential nodes in social networks
Future Generation Computer Systems
| Hi-index | 0.00 |
When we consider the problem of finding influential nodes for information diffusion in a large-scale social network based on the Independent Cascade Model (ICM), we need to compute the expected number of nodes influenced by a given set of nodes. However, a good estimate of this quantity needs a large amount of computation in the ICM. In this paper, we propose two natural special cases of the ICM such that a good estimate of this quantity can be efficiently computed. Using real large-scale social networks, we experimentally demonstrate that for extracting influential nodes, the proposed models can provide novel ranking methods that are different from the ICM, typical methods of social network analysis, and “PageRank” method. Moreover, we experimentally demonstrate that when the propagation probabilities through links are small, they can give good approximations to the ICM for finding sets of influential nodes.