An Efficient potential member promotion algorithm in social networks via skyline

Abstract

With the development of skyline queries and social networks, the idea of combining member promotion with skyline queries attracts people’s attention. Some algorithms have been proposed to deal with this problem so far, such as skyline boundary algorithms in unequal-weighted social networks. In this paper, we propose an improved member promotion algorithm by presenting reputation level based on eigenvectors as well as in/out-degrees and providing skyline distance and sort-projection operations. The added reputation level helps a lot to describe the importance of a member, the skyline distance and sort-projection operations help us to obtain the necessary situations for not being dominated so that some meaningless plans can be pruned. Then we verify some promotion plans in minimum time cost based on dominance. Experiments on the DBLP dataset verify the effectiveness and efficiency of our proposed algorithm.