Mining predecessor-successor rules from DAG data

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of intelligent systems Jg. 21; H. 6; S. 621 - 637
Hauptverfasser: Chen, Yen-Liang, Ye, Chih-Hao, Wu, Shin-Yi
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.06.2006
Wiley
Schlagworte:
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Data processing. List processing. Character string processing
Exact sciences and technology
Learning and adaptive systems
Logical, boolean and switching functions
Memory organisation. Data processing
Software
Theoretical computing
Data analysis
Genealogy
Modular design
Useful information
Association rule
XML language
Statistical association
Information extraction
Data mining
Product structure
Document structure
Database
Acyclic graph
Directed graph
ISSN:0884-8173, 1098-111X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. © 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 621–637, 2006.
Bibliographie:MOE Program for Promoting Academic Excellence of Universities - No. 91-H-FA07-1-4
istex:049B9D4706F7F4978E115DDE8D84BE16D5A592FA
ark:/67375/WNG-P9J2G30F-W
ArticleID:INT20151
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0884-8173
1098-111X
DOI:10.1002/int.20151