Community partition is of great importance in social networks because of the rapid
increasing network scale, data and applications. We consider the community partition …

Community partition is an important problem in many areas, such as biology networks and
social networks. The objective of this problem is to analyze the relationships among data via …

In this paper, we study the location aware influence maximization problem, which finds a
seed set to maximize the influence spread on targeted users for a given query. In particular …

Adaptation of a film is the transfer of a novel to its visual medium. The characters of a story or
its adapted film are connected and form two different social networks. The underlying theme …

Bharathi et al.(WINE, pp 306–311, 2007) conjectured that the influence maximization
problem is NP-hard for arborescence directed into a root. In this note, we show that this …

Literature network analysis is an emerging area in the computational research domain.
Literature network is a type of social network with various distinct features. The analysis …

We propose an online deterministic annealing algorithm for progressive graph partitioning
based on the spectral information of the underlying graph Laplacian matrix. Online …

Community deception is about protecting users of a community from being discovered by
community detection algorithms. This paper studies community deception in directed …

The problem of detecting communities is one of the essential problems in the study of social
networks. To devise the algorithms of community detection, one should first define high …

This paper studies the novel problem of influence-based community deception. Tackling this
problem amounts to devising tools to protect the users of a community from being …