arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.06566cs.AIcs.LGstat.ML
收藏

在文档集合上交互式讲故事

Interactive Storytelling over Document Collections

Virginia Tech(弗吉尼亚理工大学)

Dipayan Maiti, Mohammad Raihanul Islam, Scotland Leman, Naren Ramakrishnan

摘要:

讲故事算法的目标是通过一系列中间文档链接开始和结束文档,从而在不同文档之间“连接点”。现有的讲故事算法是基于连贯性和连通性的概念,因此用户可以引导故事构建的主要方式是通过设计合适的相似性函数。我们提出了一种替代的方法来讲故事,其中用户可以交互式和迭代地提供“必须使用”的约束,优先支持建设的一些故事超过其他。在我们的方法中的三个创新是基于(推断)主题分布的距离测量,使用约束来定义路径上的线性不等式集,以及引入松弛和盈余变量来调节主题分布,以优先强调所需的术语。我们描述的实验结果来说明我们的互动讲故事的方法在多个文本数据集的有效性。

英文摘要:

Storytelling algorithms aim to 'connect the dots' between disparate documents by linking starting and ending documents through a series of intermediate documents. Existing storytelling algorithms are based on notions of coherence and connectivity, and thus the primary way by which users can steer the story construction is via design of suitable similarity functions. We present an alternative approach to storytelling wherein the user can interactively and iteratively provide 'must use' constraints to preferentially support the construction of some stories over others. The three innovations in our approach are distance measures based on (inferred) topic distributions, the use of constraints to define sets of linear inequalities over paths, and the introduction of slack and surplus variables to condition the topic distribution to preferentially emphasize desired terms over others. We describe experimental results to illustrate the effectiveness of our interactive storytelling approach over multiple text datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑