ABSTRACT Traditional frequent pattern mining algorithms often report an overwhelming number of patterns in large datasets, many of which are redundant. To address this issue, Minimum Description Length (MDL)‐based methods have been employed, which use data compression to capture a smaller yet significant set of patterns. However, finding a good set of patterns according to MDL involves a very large search space, and current MDL‐based techniques often suffer from long runtimes and find suboptimal solutions. To discover better sets of patterns in less time, this paper introduces GRIMP (a Genetic algoRIthm for coMpression‐based descriptive Pattern mining), a novel framework that combines a genetic algorithm with MDL‐based pattern selection. Multiple genetic algorithm variants are explored within the GRIMP framework, and their effectiveness is compared using a large number of datasets. Experimental results demonstrate that GRIMP consistently outperforms previous methods by achieving higher compression ratios, generating more representative itemsets, and requiring less time. Additionally, the extracted patterns improve downstream classification tasks, highlighting the ability of GRIMP to find more representative patterns within the data.

Data mining methods extract knowledge from huge amounts of data. Recently with the explosion of mobile technologies, a new type of data appeared. The resulting databases can be described as spatiotemporal data in which spatial information (e.g., the location of an event) and temporal information (e .g., the date of the event) are included. In this article, we focus on spatiotemporal patterns extraction from this kind of databases. These patterns can be considered as sequences representing changes of events localized in areas and its near surrounding over time. Two algorithms are proposed to tackle this problem: the first one uses \emph{a priori} strategy and the second one is based on pattern-growth approach. We have applied our generic method on two different real datasets related to: 1) pollution of rivers in France; and 2) monitoring of dengue epidemics in New Caledonia. Additionally, experiments on synthetic data have been conducted to measure the performance of the proposed algorithms.

To support knowledge discovery from data, many pattern mining techniques have been proposed. One of the bottlenecks for their dissemination is the number of computed patterns that appear to be either trivial or uninteresting with respect to available knowledge. Integration of domain knowledge in constraint-based data mining is limited. Relevant patterns still miss because methods partly fail in assessing their subjective interestingness. However, in practice, we often have in the literature mathematical models defined by experts based on their domain knowledge. We propose here to exploit such models to derive constraints that can be used during the data mining phase to improve both pattern relevancy and computational efficiency. Even though the approach is generic, it is illustrated on pattern set discovery from real data for studying soil erosion.

Our work aims at analyzing satellites images time series using a pattern based data mining approach. We consider structures formed by a collection of regions sharing similar pixel properties in images. Such structure enable to discover hidden relations between disconnected regions corresponding to similar objects. The approach has been applied to the analysis of an area in New Caledonia and we present an example of pattern corresponding to several regions having an eroded soil.

Extraction of interesting colocations in geo-referenced data is one of the major tasks in spatial pattern mining. The goal is to find sets of spatial object-types with instances located in the same neighborhood. In this context, the main drawback is the visualization and interpretation of extracted patterns by domain experts. Indeed, common textual representation of colocations loses important spatial information such as the position, the orientation or the spatial distribution of the patterns. To overcome this problem, we propose a new clustering-based visualization technique deeply integrated in the colocation mining algorithm. This new simple, concise and intuitive cartographic visualization considers both spatial information and expert practices. This proposition has been integrated in a Geographic Information System and experimented on a real-world geological data set. Domain experts confirm the added-value of this visualization approach.