返回
Tree pattern mining with tree automata constraints
DOI:10.1016/j.is.2009.09.001.png)
摘要
En 中文
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chemical compounds, protein structures, XML and Web log databases and social networks, require much more sophisticated data structures such as trees and graphs. In these contexts, interesting patterns involve not only frequent object values (labels) appearing in the graphs (or trees) but also frequent specific topologies found in these structures. Recently, several techniques for tree and graph mining have been proposed in the literature. In this paper, we focus on constraint-based tree pattern mining. We propose to use tree automata as a mechanism to specify user constraints over tree patterns. We present the algorithm CoBMiner which allows user constraints specified by a tree automata to be incorporated in the mining process. An extensive set of experiments executed over synthetic and real data (XML documents and Web usage logs) allows us to conclude that incorporating constraints during the mining process is far more effective than filtering the interesting patterns after the mining process. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Frequent Pattern Discovery
Tree Pattern Mining
Tree automata
Constraint-based mining
XML Mining
Web Mining
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
引用论文
Hugo Chavez and President Bush's Credibility Gap: The Struggle Against US Democracy Promotion查韦斯与布什总统的信誉差距:对抗美国民主推广的斗争
In the Middle of Something: Reflections on Multimodal Inquiry as Artful Bricolage《正忙于某事:关于多模态探究作为艺术性拼凑的思考》
Relationships, instruction, understandings: one district’s implementation of rounds关系、指导、理解:一个学区轮换制的实施

