International Journal of Computer Applications
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 finding influential 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 influential 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 influential nodes by a dynamic programming.