Unsupervised analysis of top-k core members in poly-relational networks

• Our PSQP identifies both top-k core members and their most important relations.
• The effectiveness of PSQP is well explained in theory and verified by experiments.
• We have fully discussed the different types of usages for PSQP in practice.

Poly-relational networks such as social networks are prevalent in the real world. The existing research on poly-relational networks focuses on community detection, aiming to find a global partition of nodes across relations. However, in some real cases, users may be not interested in such a global partition. For example, commercial analysts often care more about the top-k core members in business competitions, and relations among them that are more important to their competitions. Motivated by this, in this paper, we investigate an unsupervised analysis of the top-k core members in a poly-relational network and identify two complementary tasks, namely (1) detection of the top-k core members that are most tightly connected by relevant relations, and (2) identification of the relevant relations via analysis on the importance of each relation to the formation of the top-k core members. Towards this, we propose an optimization framework to jointly deal with the two tasks by maximizing the connectivity between the candidates of the top-k core members across all relations with a synchronously updated weight for each relation. The effectiveness of our framework is verified both theoretically and experimentally.