Community-based greedy algorithm for mining top-K influential nodes in mobile social networks

@article{Wang2010CommunitybasedGA,
  title={Community-based greedy algorithm for mining top-K influential nodes in mobile social networks},
  author={Yu Wang and G. Cong and Guojie Song and Kunqing Xie},
  journal={Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining},
  year={2010}
}
  • Yu Wang, G. Cong, +1 author Kunqing Xie
  • Published 25 July 2010
  • Computer Science
  • Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
With the proliferation of mobile devices and wireless technologies, mobile social network systems are increasingly available. [...] Key Method The proposed algorithm encompasses two components: 1) an algorithm for detecting communities in a social network by taking into account information diffusion; and 2) a dynamic programming algorithm for selecting communities to find influential nodes. We also provide provable approximation guarantees for our algorithm. Empirical studies on a large real-world mobile social…Expand
Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method
TLDR
A divide-and-conquer strategy with parallel computing mechanism has been adopted and an algorithm called Community-based Greedy algorithm for mining top-K influential nodes and precision analysis is given to show approximation guarantees of the models. Expand
Influence Maximization on Mobile Social Network using Location based Community Greedy Algorithm
TLDR
Experiments result on real large-scale mobile social networks show that the proposed location based greedy algorithm has higher efficiency than previous community greedy algorithm. Expand
A Greedy Algorithm Approach for Mobile Social Network
TLDR
Experiments on real large-scale mobile social networks show that the proposed algorithm is quicker than previous algorithms, and greedy rule with demonstrable approximation guarantees will provide smart approximation. Expand
Mining Mechanism of Top-k Influential Nodes Based on Voting Algorithm in Mobile Social Networks
  • Sancheng Peng, Guojun Wang, Shui Yu
  • Computer Science
  • 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing
  • 2013
TLDR
The complex network theory is introduced to build a social relation graph, which is used to reveal the relationship among people's social contacts and messages sending and intimacy degree is also introduced to characterize social frequency among nodes. Expand
Preference-based mining of top-K influential nodes in social networks
TLDR
A two-stage mining algorithm to mine the most influential nodes in a network on a given topic, which shows that GAUP performs better than the state-of-the-art greedy algorithm, SVD-based collaborative filtering, and HITS. Expand
Preference-Based Top-K Influential Nodes Mining in Social Networks
  • Yunlong Zhang, J. Zhou, Jia Cheng
  • Computer Science
  • 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications
  • 2011
TLDR
This work proposes a two-stage mining algorithm (GAUP) for mining most influential nodes on a specific topic, which uses a collaborative filtering technique to determine user preferences on a topic and adopts a greedy algorithm to find top-K nodes in the network. Expand
An Efficient Influence Maximization Algorithm Based on Social Relationship Priority in Mobile Social Networks
TLDR
This paper model the mobile social network as the topological graph based on social priority topological to study the social influence and innovatively propose a scheme which integrates ITO algorithm into PSO algorithm to solve the problem of maximizing the influence in MSNs. Expand
A Hierarchy Based Influence Maximization Algorithm in Social Networks
TLDR
A new approach called Hierarchy based Influence Maximization algorithm (HBIM in short) to mine top-K influential nodes is proposed, a two-phase method: an algorithm for detecting information diffusion levels based on the first-order and second-order proximity between social nodes and a dynamic programming algorithm for selecting levels to find influential nodes. Expand
An Efficient Influence Maximization Algorithm to Discover Influential Users in Micro-blog
TLDR
The Candidates-Based Greedy (CBG) algorithm is proposed, which selects SS from the candidates with a greedy algorithm to maximize the influence in micro-blogging and achieves much better running time, almost 70% less, and does not lose any accuracy. Expand
Dynamic social feature-based diffusion in mobile social networks
  • Xiao Chen, Kaiqi Xiong
  • Computer Science
  • 2015 IEEE/CIC International Conference on Communications in China (ICCC)
  • 2015
TLDR
This paper defines dynamic social features to capture nodes' dynamic contact behavior and use social similarity metrics to measure their social closeness in MSNs and proposes novel diffusion node selection algorithms based on these new features to minimize the diffusion time. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Extracting Influential Nodes for Information Diffusion on a Social Network
TLDR
This paper proposes a method of efficiently estimating all those quantities on the basis of bond percolation and graph theory, and applies it to approximately solving the optimization problem under the greedy algorithm, and demonstrates that it can outperform the conventional method, and achieve a large reduction in computational cost. Expand
Tractable Models for Information Diffusion in Social Networks
TLDR
This paper proposes two natural special cases of the Independent Cascade Model such that a good estimate of this quantity can be efficiently computed and experimentally demonstrates 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. Expand
Maximizing the spread of influence through a social network
TLDR
An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks. Expand
Efficient influence maximization in social networks
TLDR
Based on the results, it is believed that fine-tuned heuristics may provide truly scalable solutions to the influence maximization problem with satisfying influence spread and blazingly fast running time. Expand
Near linear time algorithm to detect community structures in large-scale networks.
TLDR
This paper investigates a simple label propagation algorithm that uses the network structure alone as its guide and requires neither optimization of a predefined objective function nor prior information about the communities. Expand
Influential Nodes in a Diffusion Model for Social Networks
TLDR
A natural and general model of influence propagation that is generalizing models used in the sociology and economics communities, and shows that in the decreasing cascade model, a natural greedy algorithm is a 1-1/ e-e approximation for selecting a target set of size k. Expand
Detecting Communities in Social Networks Using Max-Min Modularity
TLDR
A new community mining measure, Max-Min Modularity, which considers both connected pairs and criteria defined by domain experts in finding communities, and then specifies a hierarchical clustering algorithm to detect communities in networks shows improvement over previous algorithms. Expand
Mining social networks using heat diffusion processes for marketing candidates selection
TLDR
This work represents a novel approach to the analysis of social network marketing, and is the first work to propose how to defend against negative comments within social networks. Expand
SCAN: a structural clustering algorithm for networks
TLDR
A novel algorithm called SCAN (Structural Clustering Algorithm for Networks), which detects clusters, hubs and outliers in networks and clusters vertices based on a structural similarity measure is proposed. Expand
Finding community structure in very large networks.
TLDR
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure. Expand
...
1
2
3
...