Mining predecessor-successor rules from DAG data

Yen Liang Chen, Chih Hao Ye, Shin Yi Wu

研究成果: 雜誌貢獻期刊論文同行評審

摘要

Data mining extracts implicit, previously unknown, and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most important ones is finding association rules. Although a large amount of research has been devoted to this subject, none of it finds association rules from directed acyclic graph (DAG) data. Without such a mining method, the hidden knowledge, if any, cannot be discovered from the databases storing DAG data such as family genealogy profiles, product structures, XML documents, task precedence relations, and course structures. In this article, we define a new kind of association rule in DAG databases called the predecessor-successor rule, where a node x is a predecessor of another node y if we can find a path in DAG where x appears before y. The predecessor-successor rules enable us to observe how the characteristics of the predecessors influence the successors. An approach containing four stages is proposed to discover the predecessor-successor rules.

原文???core.languages.en_GB???
頁(從 - 到)621-637
頁數17
期刊International Journal of Intelligent Systems
21
發行號6
DOIs
出版狀態已出版 - 6月 2006

指紋

深入研究「Mining predecessor-successor rules from DAG data」主題。共同形成了獨特的指紋。

引用此