Work

A more efficient algorithm to compute the Rand Index for change-point problems

Year: 2021

Type: preprint

Abstract: We provide a more efficient algorithm for computing the Rand Index when the data clusters come from a change-point detection problem. Given the number of data points $N$ and two change-point sets of size $r$ and $s$, the algorithm runs on $O(r+s)$ time complexity and $O(1)$ memory complexity. The Rand Index computation for the general clustering problem, in contrast, requires the $N$ cluster memberships and has a $O(N)$ complexity in both time and memory.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2112.03738

Author: Prates, Lucas de Oliveira

Language: English

Topic: Advanced Clustering Algorithms Research

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

OpenAlex ID: W4200632741

Cites:

Cited by: 2

Related to: 10