A more efficient algorithm to compute the Rand Index for change-point problems
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909653112193024 |
|---|---|
| author | Prates, Lucas de Oliveira |
| author_facet | Prates, Lucas de Oliveira |
| contents | We provide a more efficient algorithm for computing the Rand Index when the data cluster comes from a change-point detection problem. Given $N$ data points and two clusterings of size $r$ and $s$, the algorithm runs on $O(r+s)$ time complexity and $O(1)$ memory complexity. The traditional algorithm, in contrast, runs on $O(rs+N)$ time complexity and $O(rs)$ memory complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_03738 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | A more efficient algorithm to compute the Rand Index for change-point problems Prates, Lucas de Oliveira Data Structures and Algorithms Computation We provide a more efficient algorithm for computing the Rand Index when the data cluster comes from a change-point detection problem. Given $N$ data points and two clusterings of size $r$ and $s$, the algorithm runs on $O(r+s)$ time complexity and $O(1)$ memory complexity. The traditional algorithm, in contrast, runs on $O(rs+N)$ time complexity and $O(rs)$ memory complexity. |
| title | A more efficient algorithm to compute the Rand Index for change-point problems |
| topic | Data Structures and Algorithms Computation |
| url | https://arxiv.org/abs/2112.03738 |