Szczegóły publikacji
Opis bibliograficzny
Strategies for improving performance of evolutionary biclustering algorithm EBIC / Patryk ORZECHOWSKI, Jason H. Moore // W: GECCO 2019 [Dokument elektroniczny] : the Genetic and Evolutionary Computation Conference : a recombination of the 28th International Conference on Genetic Algorithms (ICGA) and the 24rd Annual Genetic Programming Conference (GP) : July 13th–17th 2019, Prague, Czech Republic. — Wersja do Windows. — Dane tekstowe. — USA : ACM, cop. 2019. — e-ISBN: 978-1-4503-6748-6. — S. 185–186. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: https://dl.acm.org/ft_gateway.cfm?id=3322046=2070965 [2019-09-18]. — Bibliogr. s. 186, Abstr. — P. Orzechowski – dod. afiliacja: University of Pennsylvania
Autorzy (2)
- AGHOrzechowski Patryk
- Moore Jason H.
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 124344 |
|---|---|
| Data dodania do BaDAP | 2019-10-09 |
| DOI | 10.1145/3319619.3322046 |
| Rok publikacji | 2019 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Wydawca | Association for Computing Machinery (ACM) |
| Konferencja | Genetic and Evolutionary Computation Conference |
Abstract
Biclustering is a growing in popularity machine learning technique which searches for patterns in subsets of rows and subsets of columns. One of the recent advances in biclustering was the development of EBIC, a multi-GPU method based on evolutionary computation, which was demonstrated to outperform some of the leading methods in the field. In this short paper, we evaluate a couple of potential improvements to the method.