We give a sufficient condition for two operators to be disjointly frequently hypercyclic. apply this criterion composition acting on H(D) or the Hardy space H2(D). simplify result disjoint frequent hypercyclicity of pseudo shifts recent paper Martin et al. and we exhibit hypercyclic weighted shifts.

Cubes and association rules discover frequent patterns in a data set, most of which are not significant. Thus previous research has introduced search constraints and statistical metrics to discover significant patterns and reduce processing time. We introduce cube pairs (comparing cube groups based on a parametric statistical test) and rule pairs (based on two similar association rules), which ...

Proefschrift voorgelegd tot het behalen van de graad van Doctor in de Wetenschappen, richting Informatica te verdedigen door Acknowledgements Many people have contributed to the realization of this thesis. First an foremost, I am grateful to my advisor Jan Van den Bussche for his guidance throughout my doctoral studies and all the time and effort he put in the development of me and my work. The...

Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjacency relationships between these cells. In particular, they can be used to model the topology of plane graphs. In this paper, we describe an algorithm, called mSpan, for extracting patterns which occur frequently in a...

Data mining-based analysis methods are increasingly being applied to datasets derived from science and engineering domains that model various physical phenomena and objects. In many of these datasets, a key requirement for their effective analysis is the ability to capture the relational and geometric characteristics of the underlying entities and objects. Geometric graphs, by modeling the vari...

A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness measure δ (called δ-cluster), and select a representative pattern for each cluster. The problem of finding a minimum set of representative patterns is shown NP-Hard. We develop two greedy methods, RPglobal and RPlocal. ...