A novel cooperative algorithm for clustering large databases with sampling
Nenhuma Miniatura disponível
Arquivos
Data
2012-07-30
Autores
Fabris, Fábio
Título da Revista
ISSN da Revista
Título de Volume
Editor
Universidade Federal do Espírito Santo
Resumo
Clustering is a recurrent task in data mining. The application of traditional heuristics techniques in large sets of data is not easy. They tend to have at least quadratic complexity with respect to the number of points, yielding prohibitive run times or low quality solutions. The most common approach to tackle this problem is to use weaker, more randomized algorithms with lower complexities to solve the clustering problem. This work proposes a novel approach for performing this task, allowing traditional, stronger algorithms to work on a sample of the data, chosen in such a way that the overall clustering is considered good.
Descrição
Palavras-chave
Citação
FABRIS, Fábio. A novel cooperative algorithm for clustering large databases with sampling. 2012. 99 f. Dissertação (Mestrado em Informática) - Universidade Federal do Espírito Santo, Centro Tecnológico, Vitória, 2012.