Details

Autor(en) / Beteiligte

• Shelokar, Prakash
• Quirin, Arnaud
• Cordón, Óscar

Titel

Three-objective subgraph mining using multiobjective evolutionary programming

Ist Teil von

• Journal of computer and system sciences, 2014-02, Vol.80 (1), p.16-26

Ort / Verlag

Elsevier Inc

Erscheinungsjahr

2014

Quelle

Access via ScienceDirect (Elsevier)

Beschreibungen/Notizen

• The existing methods for graph-based data mining (GBDM) follow the basic approach of applying a single-objective search with a user-defined threshold to discover interesting subgraphs. This obliges the user to deal with simple thresholds and impedes her/him from evaluating the mined subgraphs by defining different “goodness” (i.e., multiobjective) criteria regarding the characteristics of the subgraphs. In previous papers, we defined a multiobjective GBDM framework to perform bi-objective graph mining in terms of subgraph support and size maximization. Two different search methods were considered with this aim, a multiobjective beam search and a multiobjective evolutionary programming (MOEP). In this contribution, we extend the latter formulation to a three-objective framework by incorporating another classical graph mining objective, the subgraph diameter. The proposed MOEP method for multiobjective GBDM is tested on five synthetic and real-world datasets and its performance is compared against single and multiobjective subgraph mining approaches based on the classical Subdue technique in GBDM. The results highlight the application of multiobjective subgraph mining allows us to discover more diversified subgraphs in the objective space. •Formulation of a three-objective graph-based data mining (GBDM) problem.•Multiobjective evolutionary programming for GBDM.•Diversified solution selection through summation of objectives method.•Pareto-based dominance criteria.•Use of crowding distance method to maintain external archive.