Meta-features for meta-learning

Autor: Adriano Rivolli, Luís P.F. Garcia, Carlos Soares, Joaquin Vanschoren, André C.P.L.F. de Carvalho

Publikováno v: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Knowledge-Based Systems, 240:108101. Elsevier

Meta-learning is increasingly used to support the recommendation of machine learning algorithms and their configurations. These recommendations are made based on meta-data, consisting of performance evaluations of algorithms and characterizations on

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::081f49e5821f5e47cb9b3a26f2f2919e

Generalized enhanced suffix array construction in external memory

Autor: Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri, Steve Hoffmann, Felipe A. Louza

Publikováno v: Algorithms for Molecular Biology, Vol 12, Iss 1, Pp 1-16 (2017)
Algorithms for Molecular Biology : AMB
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Algorithms for molecular biology, 12:26

Background Suffix arrays, augmented by additional data structures, allow solving efficiently many string processing problems. The external memory construction of the generalized suffix array for a string collection is a fundamental task when the size

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b62ae3d04fbbd8500e302785fa59d0b2
http://link.springer.com/article/10.1186/s13015-017-0117-9

Clustering consensual para a detecção eficiente de comunidades em redes pela modularidade ajustada

Autor: Santos, Camila Pereira dos, Nascimento, Mariá Cristina Vasconcelos

Publikováno v: Revista Eletrônica de Iniciação Científica em Computação; v. 16, n. 1 (2018): REIC-Edição Especial-Artigos do CTIC 2013

A maximização da modularidade é a abordagem mais utilizada para detectar comunidades em redes. Contudo, ela pode falhar em encontrar comunidades pequenas, devido a um problema de escala. Para superar esse problema, uma versão ajustada da modulari

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=seer___ufrgs::2f489849a7e33bb5863374b6db4a67d5
http://seer.ufrgs.br/reic/article/view/47205

An efficient bitwise algorithm for intra-procedural data-flow testing coverage

Autor: Marcos Lordello Chaim, Roberto Paulo Andrioli de Araujo

Publikováno v: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP

Data-flow (DF) testing was introduced to achieve more comprehensive structural evaluation of programs. It requires tests that traverse a path in which the definition of a variable and its subsequent use, i.e., a definition-use association (dua), is e

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c782ca5d309e247f5baba70811da8b6
https://doi.org/10.1016/j.ipl.2013.02.007

Parallel transitive closure algorithm

Autor: Jayme Luiz Szwarcfiter, A. A. de Castro, Siang Wun Song, Carlos Eduardo Rodrigues Alves, Edson Norberto Cáceres

Publikováno v: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP

Using the BSP/CGM model, with $$p$$ processors, where $$p \ll n$$ , we present a parallel algorithm to compute the transitive closure of a digraph $$D$$ with $$n$$ vertices and $$m$$ edges. Our algorithm uses $$\log p + 1$$ communication rounds if th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76b09d31bbcfd1c83133fe19f0a37a3a
https://doi.org/10.1007/s13173-012-0089-z