Abstract

In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition (maximizing a social welfare) of a set of entities involved in a system. The solution of the CSG problem finds applications in many fields such as Machine Learning (set covering machines, clustering), Data Mining (decision tree, discretization), Graph Theory, Natural Language Processing (aggregation), Semantic Web (service composition), and Bioinformatics. The problem of finding the optimal coalition structure is NP-complete. In this paper we present a greedy adaptive search procedure (GRASP) with path-relinking to efficiently search the space of coalition structures. Experiments and comparisons to other algorithms prove the validity of the proposed method in solving this hard combinatorial problem.

Autore Pugliese

• Di Mauro Nicola , Ferilli Stefano , Basile Teresa Maria

Tutti gli autori

• ESPOSITO F.;DI MAURO N.;FERILLI S.;BASILE T.M.

Titolo volume/Rivista

Non Disponibile

Anno di pubblicazione

2014

ISSN

0169-2968

ISBN

Non Disponibile

Numero di citazioni Wos

1

Ultimo Aggiornamento Citazioni

Non Disponibile

Numero di citazioni Scopus

1

Ultimo Aggiornamento Citazioni

Non Disponibile

Settori ERC

Non Disponibile

Codici ASJC

Non Disponibile