A Greedy Algorithm Approach for Mobile Social Network

Abstract

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. Communitybased 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. Performance is to be increased by considering the influence propagation supported communities and take into account the influence propagation crossing communities. Experiments on real large-scale mobile social networks show that the proposed algorithm is quicker than previous algorithms. General TermsMobile social network, influence maximization, PCA greedy algorithm,

Vehicle’s Driver Face Recognition using Viola Jones and Support Vector Machine

“…ISSN: 2278-0181 http://www.ijert.org called a bunch graph. An efficient algorithm was used that recognized the novel faces by first localizing a set of landmark features, approximates the landmark features, and then measuring similarity between these features [9]. The two classical methods and a typical face image database for standard testing were described.…”

Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path

“…Bhosale et al in his research states that the Greedy algorithm can be close to the optimum to approach the factor (1-1e). However, this algorithm is quite expensive to overcome the problem maximization effect on large scale networks [1]. Zhenhuan in his research explained, the greedy algorithm can reach a good solution in a short time, the experimental data shows that it is quite effective [2].…”