Discovering accurate and interesting classification rules is a significant task in the post-processing stage of a data mining (DM) process. Therefore, an optimization problem exis...
GRD is an algorithm for k-most interesting rule discovery. In contrast to association rule discovery, GRD does not require the use of a minimum support constraint. Rather, the user...
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
— This paper introduces a novel approach to social behaviour recognition governed by the exchange of non-verbal cues between people. We conduct experiments to try and deduce dist...
Dumebi Okwechime, Eng-Jon Ong, Andrew Gilbert, Ric...
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...