Centrality in heterogeneous social networks for lurkers detection: An approach based on hypergraphs

Nowadays, social networks provide users an interactive platform to create and share heterogeneous content for a lot of different purposes (eg, to comment events and facts, and express and share personal opinions on specific topics), allowing millions of individuals to create online profiles and share personal information with vast networks known and sometimes also unknown people. Knowledge about users, content, and relationships in a social network may be used for an adversary attack of some victims easily. Although a number of works have been done for data privacy preservation on relational data, they cannot be applied in social networks and in general for big data analytics. In this paper, we first propose a novel data model that integrates and combines information on users belonging to 1 or more heterogeneous online social networks, together with the content that is generated, shared, and used within the related environments, using an hypergraph data structure; then we implemented the most diffused centrality measures and also introduced a new centrality measure—based on the concept of “neighborhood” among users—that may be efficiently applied for a number of data privacy issues, such as lurkers and neighborhood attack prevention, especially in “interest-based” social networks. Some experiments using the Yelp dataset are discussed.