arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.02074cs.DBcs.AI
收藏

一种有效的带交错的单次出现正则表达式学习算法

An Effective Algorithm for Learning Single Occurrence Regular Expressions with Interleaving

Institute of Software, Chinese Academy of Sciences(中国科学院软件研究所);University of Chinese Academy of Sciences(中国科学院大学);Beijing University of Technology(北京工业大学)

Yeting Li, Haiming Chen, Xiaolan Zhang, Lingqi Zhang

摘要:

模式的存在所提供的优点是多方面的。然而,在实践中,许多XML文档并不伴随着一个(有效的)模式,使模式推理一个有吸引力的研究问题。XML模式学习的基本任务是推断正则表达式的受限子类。大多数以前的工作要么缺乏对交织的支持,要么只有有限的支持交织。在本文中,我们首先提出了一个新的子类单次出现的正则表达式与交织(SOIRE),它具有无限制的支持交织。然后,基于单次出现自动机和最大独立集,我们提出了一个算法iSOIRE推断SOIRE。最后,我们在真实数据集上进行了一系列实验,并与学术界的学习算法和工业界的工具进行了比较,以评估我们工作的有效性。实验结果验证了SOIRE的实用性和iSOIRE的有效性,表明了我们工作的高度精确性和简洁性。

英文摘要:

The advantages offered by the presence of a schema are numerous. However, many XML documents in practice are not accompanied by a (valid) schema, making schema inference an attractive research problem. The fundamental task in XML schema learning is inferring restricted subclasses of regular expressions. Most previous work either lacks support for interleaving or only has limited support for interleaving. In this paper, we first propose a new subclass Single Occurrence Regular Expressions with Interleaving (SOIRE), which has unrestricted support for interleaving. Then, based on single occurrence automaton and maximum independent set, we propose an algorithm iSOIRE to infer SOIREs. Finally, we further conduct a series of experiments on real datasets to evaluate the effectiveness of our work, comparing with both ongoing learning algorithms in academia and industrial tools in real-world. The results reveal the practicability of SOIRE and the effectiveness of iSOIRE, showing the high preciseness and conciseness of our work.

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

↑