Efficient Incremental Breadth-Depth XML Event Mining

Details Efficient Incremental Breadth-Depth XML Event Mining Efficient Incremental Breadth-Depth XML Event Mining

2011-10-14

arxiv.org/abs/1110.3158v1

15th International Database Engineering and Applications Symposium (IDEAS 2011), Lisbon : Portugal (2011)

Computer Science

Databases

Scientific paper

Many applications log a large amount of events continuously. Extracting interesting knowledge from logged events is an emerging active research area in data mining. In this context, we propose an approach for mining frequent events and association rules from logged events in XML format. This approach is composed of two-main phases: I) constructing a novel tree structure called Frequency XML-based Tree (FXT), which contains the frequency of events to be mined; II) querying the constructed FXT using XQuery to discover frequent itemsets and association rules. The FXT is constructed with a single-pass over logged data. We implement the proposed algorithm and study various performance issues. The performance study shows that the algorithm is efficient, for both constructing the FXT and discovering association rules.

Affiliated with

Also associated with

No associations

Rating

Efficient Incremental Breadth-Depth XML Event Mining does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Incremental Breadth-Depth XML Event Mining, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Incremental Breadth-Depth XML Event Mining will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522394