Top-k similarity search in heterogeneous information networks with x-star network schema

作者：

Highlights：

• The efficiency improvement is evident for similarity computation.

• The effectiveness of returned result is good for similarity search.

• The pruning algorithm is presented for supporting fast online query processing.

• The accuracy loss of pruning algorithm can be controlled by setting thresholds.

摘要

•The efficiency improvement is evident for similarity computation.•The effectiveness of returned result is good for similarity search.•The pruning algorithm is presented for supporting fast online query processing.•The accuracy loss of pruning algorithm can be controlled by setting thresholds.

论文关键词：Similarity search,Information network,x-star network schema

论文评审过程：Available online 10 September 2014.

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