MOSubdue incorporates the NSGA-II's crowding selection mechanism in order to retrieve a well distributed Pareto optimal set of meaningful subgraphs showing ...

In this work we propose a Pareto-based multi-objective search strategy for subgraph mining in structural databases. The method is an extension of Subdue, ...

The method is an extension of Subdue, a classical graph-based knowledge discovery algorithm, and it is thus called MultiObjective Subdue (MOSubdue), ...

Abstract This work proposes multiobjective subgraph mining in graph-based data using multiobjective evolutionary programming (MOEP). A mined subgraph is defined ...

MOSubdue incorporates the NSGA-II's crowding selection mechanism in order to retrieve a well distributed Pareto optimal set of meaningful subgraphs showing ...

Apr 25, 2024 · A multiobjective variant of the Subdue graph mining algorithm based on the NSGA-II selection mechanism. IEEE Congress on Evolutionary ...

Quirin, Ó. Cordón, A multiobjective variant of the Subdue graph mining algorithm based on the NSGA-II selection mechanism, in: Proc. IEEE Conf. Evolutionary ...

A multiobjective variant of the Subdue graph mining algorithm based on the NSGA-II selection mechanism. P Shelokar, A Quirin, O Cordón. IEEE Congress on ...

This study proposes a graph decomposition algorithm using the non-dominance criterion to identify important subgraphs based on two characteristics: edge ...

This work proposes multiobjective subgraph mining in graph-based data using multiobjective evolutionary program- ming (MOEP). A mined subgraph is defined by ...