International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 111 - Issue 16 |
Published: February 2015 |
Authors: Smita Bhosale, Dhanshree Kulkarni |
![]() |
Smita Bhosale, Dhanshree Kulkarni . A Greedy Algorithm Approach for Mobile Social Network. International Journal of Computer Applications. 111, 16 (February 2015), 1-3. DOI=10.5120/19619-1139
@article{ 10.5120/19619-1139, author = { Smita Bhosale,Dhanshree Kulkarni }, title = { A Greedy Algorithm Approach for Mobile Social Network }, journal = { International Journal of Computer Applications }, year = { 2015 }, volume = { 111 }, number = { 16 }, pages = { 1-3 }, doi = { 10.5120/19619-1139 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2015 %A Smita Bhosale %A Dhanshree Kulkarni %T A Greedy Algorithm Approach for Mobile Social Network%T %J International Journal of Computer Applications %V 111 %N 16 %P 1-3 %R 10.5120/19619-1139 %I Foundation of Computer Science (FCS), NY, USA
With the proliferation of mobile devices and wireless technologies, mobile social network systems used more. A mobile social network has important role in social network. The Process of ?nding in?uential nodes is NP-hard. Greedy rule with demonstrable approximation guarantees will provide smart approximation. A divide-and-conquer method with parallel computing mechanism has been used. Community-based Greedy rule for mining top-K in?uential nodes is used first. It has two parts: dividing the large- scale mobile social network into many communities by taking under consideration data diffusion. Communities select in?uential nodes by a dynamic programming. Performance is to be increased by considering the in?uence propagation supported communities and take into account the in?uence propagation crossing communities. Experiments on real large-scale mobile social networks show that the proposed algorithm is quicker than previous algorithms.