Multiple ant colony system for substructure discovery

Authors:
Oscar Cordón;Arnaud Quirin;Rocío Romero-Zaliz
Affiliations:
European Centre for Soft Computing, Mieres (Asturias), Spain;European Centre for Soft Computing, Mieres (Asturias), Spain;Dept. of Computer Science and Artificial Intelligence, University of Granada, Granada, Spain
Venue:
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Year:
2010

Citing 8
Cited 0

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Graph-Based Data Mining

IEEE Intelligent Systems
Empirical and theoretical analysis of relational concept learning using a graph-based representation

Empirical and theoretical analysis of relational concept learning using a graph-based representation
State of the art of graph-based data mining

ACM SIGKDD Explorations Newsletter
Ant Colony Optimization

Ant Colony Optimization
Mining Graph Data

Mining Graph Data
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Pareto-Based Multiobjective Machine Learning: An Overview and Case Studies

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Quantified Score

Hi-index	0.00

Visualization

Abstract

A system based on the adaptation of the search principle used in ant colony optimization (ACO) for multiobjective graph-based data mining (GBDM) is introduced in this paper. Our multiobjective ACO algorithm is designed to retrieve the best substructures in a graph database by jointly considering two criteria, support and complexity. The experimental comparison performed with a classical GBDM method shows the good performance of the new proposal on three datasets.