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

作者：

Highlights：

• 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.

摘要

•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,Top-k core members,Importance weight,Sequential quadratic programming

论文评审过程：Available online 13 April 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.04.001