• Aucun résultat trouvé

Tractable Interesting Pattern Mining in Large Networks

N/A
N/A
Protected

Academic year: 2022

Partager "Tractable Interesting Pattern Mining in Large Networks"

Copied!
1
0
0

Texte intégral

(1)

Tractable Interesting Pattern Mining in Large Networks

Jan Ramon

University of Leuven – INRIA, Leuven, Belgium

Abstract.Pattern mining is an important data mining task. While the simplest set- ting, itemset mining, has been thoroughly studied real-world data is getting increas- ingly complex and network structured, e.g. in the context of social networks, economic networks, traffic networks, administrative networks, chemical interaction networks and biological regulatory networks.

This presentation will first provide an overview of graph pattern mining work, and will then discuss two important questions. First, what is an interesting concept, and can we obtain suitable mathematical properties to order concepts in some way, obtaining a lattice or other exploitable structure?

Second, how can we extract collections of interesting patterns from network-structured data in a computationally tractable way? In the case of graphs, having a lattice on the class of patterns turns out to be insufficient for computational tractability. We will discuss difficulties related to pattern matching and related to enumeration, and additional difficulties arising when considering condensed pattern mining variants.

Références

Documents relatifs

A direct approach would be to com- pute a concise representation for each measure m ∈ M , but this is generally not possible because some measures, such as area or length, are

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

We discuss how entropy on pattern sets can be defined and how it can be incorporated into different stages of mining, from computing candidates to interesting patterns to

We compare pattern sets computed by Krimp, where candidate sets are frequent closed patterns with usage-based estimates, and the proposed approach, where the candidate set

In this paper, we present an approach for analyzing sequential datasets within the framework of pattern structures, an extension of FCA dealing with complex (non binary) data..

In this paper we presented a new approach to numerical Pattern Mining that returns a small subset of patterns with short description, thus providing a compression tech- nique.

Indeed, contextual sequential pattern mining does not only aim to mine sequences that are specific to one class, but to extract all sequential patterns in a whole sequence database,

What MDL can bring to Pattern Mining Tatiana Makhalova, Sergei Kuznetsov, Amedeo Napoli.. To cite this version: Tatiana Makhalova, Sergei Kuznetsov,