In the last two decades several approaches to indexing problems have appeared in the literature. Such interest on indexing was deeply renovated by the emergence of WEB technologies and by the subsequent need of algorithmic tools for indexing, clustering, and/or classifying a very large amount of data. In this paper we consider the problem of classifying a set of documents against a set of colors (e.g., keywords or predefined categories), and we develop distributedalgorithms for its solution. In particular, seek efficient algorithms for the problem of assigning documents to a set of agents (connected according to, e.g., a ring topology) in such a way that eachagent achieves the maximum possible specialization, i.e., it holds documents associated with the minimum number of different colors.

Distributed Algorithms for Certain Assigment Problems / B., Codenotti; G., De Marco; Leoncini, Mauro; Montangero, Manuela. - STAMPA. - Special Issue Vol 2 HS 2:(2001), pp. 91-112. ((Intervento presentato al convegno 5th International Conference on Principles of Distributed Systems. OPODIS 2001 tenutosi a Manzanillo (Messico) nel 10 - 12 Dicembre 2001.

Distributed Algorithms for Certain Assigment Problems

LEONCINI, Mauro;MONTANGERO, Manuela
2001

Abstract

In the last two decades several approaches to indexing problems have appeared in the literature. Such interest on indexing was deeply renovated by the emergence of WEB technologies and by the subsequent need of algorithmic tools for indexing, clustering, and/or classifying a very large amount of data. In this paper we consider the problem of classifying a set of documents against a set of colors (e.g., keywords or predefined categories), and we develop distributedalgorithms for its solution. In particular, seek efficient algorithms for the problem of assigning documents to a set of agents (connected according to, e.g., a ring topology) in such a way that eachagent achieves the maximum possible specialization, i.e., it holds documents associated with the minimum number of different colors.
5th International Conference on Principles of Distributed Systems. OPODIS 2001
Manzanillo (Messico)
10 - 12 Dicembre 2001
Special Issue Vol 2 HS 2
91
112
B., Codenotti; G., De Marco; Leoncini, Mauro; Montangero, Manuela
Distributed Algorithms for Certain Assigment Problems / B., Codenotti; G., De Marco; Leoncini, Mauro; Montangero, Manuela. - STAMPA. - Special Issue Vol 2 HS 2:(2001), pp. 91-112. ((Intervento presentato al convegno 5th International Conference on Principles of Distributed Systems. OPODIS 2001 tenutosi a Manzanillo (Messico) nel 10 - 12 Dicembre 2001.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/465769
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact