Three-objective subgraph mining using multiobjective evolutionary programming

DOI10.1016/j.jcss.2013.03.005zbMath1311.68142OpenAlexW2028260614WikidataQ62608427 ScholiaQ62608427MaRDI QIDQ394981

Prakash Shelokar, Arnaud Quirin, Oscar Cordón

Publication date: 28 January 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.03.005

zbMATH Keywords

multiobjective optimizationfrequent subgraph mininggraph-based data miningmultiobjective evolutionary programmingmultiobjective graph miningsubdue

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

A technique for the concept-based detection of functional modules in an interaction network ⋮ Connectedness of graphs and its application to connected matroids through covering-based rough sets ⋮ Global exponential stability of general \(A\)-monotone implicit fuzzy proximal dynamical systems in Banach spaces

Uses Software

• gSpan

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Multicriteria decision making: advances in MCDM models, algorithms, theory, and applications
• Managing and mining graph data
• Mining frequent trajectory patterns in spatial-temporal databases
• Mining Graph Data
• Evolutionary Algorithms for Solving Multi-Objective Problems

This page was built for publication: Three-objective subgraph mining using multiobjective evolutionary programming