Links

Tools

Export citation

Search in Google Scholar

Large Candidate Branch-Based Method for Mining Concurrent Branch Patterns

Journal article published in 2005 by Jing Lu, Osei Adjei, Weiru Chen, Fiaz Hussain, R. Dumitru
This paper was not found in any repository; the policy of its publisher is unknown or unclear.
This paper was not found in any repository; the policy of its publisher is unknown or unclear.

Full text: Unavailable

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown

Abstract

This paper presents a novel data mining technique, known as Post Sequential Patterns Mining. The technique can be used to discover structural patterns that are composed of sequential patterns, branch pat- terns or iterative patterns. The concurrent branch pattern is one of the main forms of structural patterns and plays an important role in event-based data modelling. To discover concurrent branch patterns e-ciently, a concurrent group is deflned and this is used roughly to discover candidate branch pat- terns. Our technique accomplishes this by using an algorithm to determine concurrent branch patterns given a customer database. The computation of