Proceedings of the 14th ACM International Conference on Information and Knowledge Management 2005
DOI: 10.1145/1099554.1099613
|View full text |Cite
|
Sign up to set email alerts
|

Relational computation for mining association rules from XML data

Abstract: We develop a fixpoint operator for computing large item sets and demonstrate three query paradigm solutions for association rule mining that use the idea of least fixpoint computation and indicates some optimisation issues. The results of our research provide theoretical foundation for relational computation of association rules and its application on XML mining.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2009
2009
2012
2012

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…More recently the problem has been investigated in the XML context [6], [31], [24], [8], [10], [19], [33]. In [31], Wan and Dobbie use XQuery [29] to extract association rules from simple XML documents.…”
Section: Comparison With Other Workmentioning
confidence: 99%
“…More recently the problem has been investigated in the XML context [6], [31], [24], [8], [10], [19], [33]. In [31], Wan and Dobbie use XQuery [29] to extract association rules from simple XML documents.…”
Section: Comparison With Other Workmentioning
confidence: 99%
“…The problem of association rule mining was initially proposed in [1] and many implementations of the algorithms, downloadable from [12], were developed in the database literature. More recently the problem has been investigated in the XML context [6], [31], [24], [8], [10], [19], [33]. In [31], Wan and Dobbie use XQuery [29] to extract association rules from simple XML documents.…”
Section: Comparison With Other Workmentioning
confidence: 99%