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
Parents
6
1–5 of 6
20
1 publications · 18 citations
1
h-index
1
h-index
1
h-index
1 publications · 18 citations
1
h-index
1
h-index
1–5 of 20
8
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
1 publications
30 citations
Fudan University
Shanghai, China
1 h-index
2 publications
60 citations
Guangdong University of Technology
Guangzhou, China
1 h-index
5 publications
135 citations
Jomo Kenyatta University of Agriculture and Technology
Nairobi, Kenya
1 h-index
1 publications
119 citations
Lancaster University
Lancaster, United Kingdom
1 h-index
3 publications
438 citations
Jiangxi Normal University
Nanchang, China
1 h-index
1 publications
30 citations

Universidade Federal do Ceará
Fortaleza, Brazil
1 h-index
2 publications
52 citations
Chinese University of Hong Kong, Shenzhen
Shenzhen, China
1 h-index
1 publications
30 citations
1–8 of 8
1 publications · 18 citations
1
h-index
1 publications · 30 citations
1
h-index
1 publications · 26 citations
1
h-index
1 publications · 27 citations
1
h-index
1 publications · 119 citations
1
h-index
1–5