arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.05561cs.AIcs.DS
收藏

Lexis:一个发现序列数据层次结构的优化框架

Lexis: An Optimization Framework for Discovering the Hierarchical Structure of Sequential Data

GeorgiaTech(佐治亚理工学院)

Payam Siyari, Bistra Dilkina, Constantine Dovrolis

摘要:

表示为字符串的数据在生物学、语言学、文档挖掘、网络搜索和许多其他领域中大量存在。这样的数据通常具有层次结构,要么是因为它们是人工设计的,并以层次结构的方式组成,要么是因为存在一个潜在的进化过程,从简单的子字符串重复创建更复杂的字符串。我们提出了一个框架,称为“词汇”,产生一个优化的层次表示的一组给定的“目标”字符串。生成的层次结构“LIGHT-DAG”展示了如何通过连接中间子字符串来构造每个目标,从而最小化此类连接或DAG边的总数。Lexis优化问题与最小文法问题有关。在证明了两种代价公式的NP-困难性之后,我们提出了一种有效的贪心算法来构造LSD-DAG。我们还考虑了识别集体形成LSD-DAG的“核心”的中间结点(子串)的集合的问题,这在LSD-DAG的分析中是重要的。我们表明,Lexis框架可以应用于不同的应用程序,如优化合成的DNA片段在基因组文库中,层次结构发现蛋白质序列,基于字典的文本压缩,和特征提取从一组文件。

英文摘要:

Data represented as strings abounds in biology, linguistics, document mining, web search and many other fields. Such data often have a hierarchical structure, either because they were artificially designed and composed in a hierarchical manner or because there is an underlying evolutionary process that creates repeatedly more complex strings from simpler substrings. We propose a framework, referred to as "Lexis", that produces an optimized hierarchical representation of a given set of "target" strings. The resulting hierarchy, "Lexis-DAG", shows how to construct each target through the concatenation of intermediate substrings, minimizing the total number of such concatenations or DAG edges. The Lexis optimization problem is related to the smallest grammar problem. After we prove its NP-Hardness for two cost formulations, we propose an efficient greedy algorithm for the construction of Lexis-DAGs. We also consider the problem of identifying the set of intermediate nodes (substrings) that collectively form the "core" of a Lexis-DAG, which is important in the analysis of Lexis-DAGs. We show that the Lexis framework can be applied in diverse applications such as optimized synthesis of DNA fragments in genomic libraries, hierarchical structure discovery in protein sequences, dictionary-based text compression, and feature extraction from a set of documents.

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

↑