AMBIENTUM BIOETHICA BIOLOGIA CHEMIA DIGITALIA DRAMATICA EDUCATIO ARTIS GYMNAST. ENGINEERING EPHEMERIDES EUROPAEA GEOGRAPHIA GEOLOGIA HISTORIA HISTORIA ARTIUM INFORMATICA IURISPRUDENTIA MATHEMATICA MUSICA NEGOTIA OECONOMICA PHILOLOGIA PHILOSOPHIA PHYSICA POLITICA PSYCHOLOGIA-PAEDAGOGIA SOCIOLOGIA THEOLOGIA CATHOLICA THEOLOGIA CATHOLICA LATIN THEOLOGIA GR.-CATH. VARAD THEOLOGIA ORTHODOXA THEOLOGIA REF. TRANSYLVAN
|
|||||||
The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name. |
|||||||
STUDIA INFORMATICA - Issue no. 1 / 2005 | |||||||
Article: |
LARGE CANDIDATE BRANCH-BASED METHOD FOR MINING CONCURRENT BRANCH PATTERNS. Authors: JING LU, OSEI ADJEI, WEIRU CHEN, FIAZ HUSSAIN, CĂLIN ENĂCHESCU, DUMITRU RĂDOIU. |
||||||
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 eficiently, a concurrent group is defined 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 the support for such patterns is also discussed. | |||||||