Pruned Exact Linear Time

Pruned Exact Linear Time is a change-point detection algorithm that belongs to the class of exact search methods and distinguishes itself by reducing computational complexity through dynamic pruning of candidate changepoints, thereby achieving linear time complexity without sacrificing optimality.

6

Publications

366

Citations

20

Authors

8

Institutions

Publications per year

2017–2026

4

Authors

20

  1. NM
    Nitin M.V.S.

    1 publications · 18 citations

    1

    h-index

  2. IA
    Idris A. Eckley

    Lancaster University, United Kingdom

    1 publications · 146 citations

    1

    h-index

  3. CF
    Chaoyang Fang

    Jiangxi Normal University, China

    1 publications · 30 citations

    1

    h-index

  4. AK
    Akash Kumar G.

    1 publications · 18 citations

    1

    h-index

  5. PM
    Peifeng Ma

    Chinese University of Hong Kong, Hong Kong SAR China

    1 publications · 30 citations

    1

    h-index

1–5 of 20

Venues

  1. E3S Web of Conferences

    1 publications · 18 citations

    1

    h-index

  2. 1

    h-index

  3. Hydrological Sciences Journal

    1 publications · 26 citations

    1

    h-index

  4. IEEE Access

    1 publications · 27 citations

    1

    h-index

  5. 1

    h-index

1–5