Scholarlink

<p>We present a novel description of random walks in a hypergraph using a labeled multidigraph. This is based on a special decomposition of the frequency matrix of relations. This decomposition enables intrinsic analysis and control of the random walker’s behavior at the matrix level, incorporating memory and modifying its behavior based on additional walk restrictions. As an aspect to highlight about this new vision, we will point out that it allows the non-back-tracking restriction to be generalized, facilitating the use of this tool in multiple applications. This article includes an application in the field of linguistics for documents summarization and the extraction of significant phrases from them.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Matrix-based pagerank control in hypergraphs for semantic text summaries

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年12月15日

查看全文
  • David Aleja,
  • Regino Criado,
  • Ángeles Criado-Alonso,
  • Guillermo Vera de Salas

摘要

We present a novel description of random walks in a hypergraph using a labeled multidigraph. This is based on a special decomposition of the frequency matrix of relations. This decomposition enables intrinsic analysis and control of the random walker’s behavior at the matrix level, incorporating memory and modifying its behavior based on additional walk restrictions. As an aspect to highlight about this new vision, we will point out that it allows the non-back-tracking restriction to be generalized, facilitating the use of this tool in multiple applications. This article includes an application in the field of linguistics for documents summarization and the extraction of significant phrases from them.