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.
top-k core members poly-relational networks importance weight sequential quadratic programming