Publication
Title
Mining frequent binary expressions
Author
Abstract
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type of patterns, binary expressions. Based on the properties of a specified binary test, such as reflexivity, transitivity and symmetry, we construct a generic algorithm that mines all frequent binary expressions. We present three applications of this new type of expressions: mining for rules, for horizontal decompositions, and in intensional database relations. Since the number of binary expressions can become exponentially large, we use data mining techniques to avoid exponential execution times. We present results of the algorithm that show an exponential gain in time due to a well chosen pruning technique.
Language
English
Source (journal)
Lecture notes in computer science. - Berlin, 1973, currens
Publication
Berlin : 2000
ISSN
0302-9743 [print]
1611-3349 [online]
Volume/pages
1874(2000), p. 399-408
ISI
000174538800040
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 08.10.2008
Last edited 02.09.2017
To cite this reference