首页> 外文期刊>SIGKDD explorations >Integrating Meta-Path Selection with User-Guided Object Clustering in Heterogeneous Information Networks
【24h】

Integrating Meta-Path Selection with User-Guided Object Clustering in Heterogeneous Information Networks

机译:在异构信息网络中将元路径选择与用户指导的对象聚类集成

获取原文
获取原文并翻译 | 示例
       

摘要

Real-world, multiple-typed objects are often interconnected, forming heterogeneous information networks. A major challenge for link-based clustering in such networks is its potential to generate many different results, carrying rather diverse semantic meanings. In order to generate desired clustering, we propose to use meta-path, a path that connects object types via a sequence of relations, to control clustering with distinct semantics. Nevertheless, it is easier for a user to provide a few examples ("seeds") than a weighted combination of sophisticated meta-paths to specify her clustering preference. Thus, we propose to integrate meta-path selection with user-guided clustering to cluster objects in networks, where a user first provides a small set of object seeds for each cluster as guidance. Then the system learns the weights for each meta-path that are consistent with the clustering result implied by the guidance, and generates clusters under the learned weights of meta-paths. A probabilistic approach is proposed to solve the problem, and an effective and efficient iterative algorithm, PathSelClus, is proposed to learn the model, where the clustering quality and the meta-path weights are mutually enhancing each other. Our experiments with several clustering tasks in two real networks demonstrate the power of the algorithm in comparison with the baselines.
机译:现实世界中,多种类型的对象通常相互连接,形成异构信息网络。在这样的网络中,基于链接的聚类的主要挑战是其产生许多不同结果的潜力,这些结果带有相当多样的语义。为了生成所需的聚类,我们建议使用元路径(通过一系列关系连接对象类型的路径)来控制具有不同语义的聚类。不过,与提供复杂元路径的加权组合以指定其聚类偏好相比,用户提供一些示例(“种子”)更容易。因此,我们建议将元路径选择与用户引导的聚类集成在一起,以聚类网络中的对象,其中用户首先为每个聚类提供一小组对象种子作为指导。然后,系统学习与指导所暗示的聚类结果一致的每个元路径的权重,并在学习的元路径权重下生成聚类。提出了一种概率方法来解决该问题,并提出了一种有效且高效的迭代算法PathSelClus来学习该模型,其中聚类质量和元路径权重相互增强。我们在两个实际网络中对几个聚类任务进行的实验证明了与基准相比,该算法的功能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号