Machine learningTime-series monitoring

Detekcija promene tačke (PELT)

Detekcija promene tačke identifikuje vremenske tačke u kojima se statistička svojstva sekvence — kao što su srednja vrednost, varijansa ili distribucija — naglo menjaju. Algoritam Pruned Exact Linear Time (PELT), koji su predstavili Killick, Fearnhead i Eckley (2012), tačno rešava problem penalizovane segmentacije uz postizanje očekivanog linearnog računskog troška, što ga čini praktičnim za duge vremenske serije koje se sreću u genomici, finansijama, klimatologiji i obradi signala.

Primenite uz StatMindUskoroVideoUskoroDownload slides

Pročitajte celu metodu

Samo za članove

Prijavite se besplatnim nalogom da biste pročitali ovaj odeljak.

Prijavite se

Method map

The neighbourhood of related methods — select a node to explore.

Izvori

  1. Killick, R., Fearnhead, P., & Eckley, I. A. (2012). Optimal detection of changepoints with a linear computational cost. Journal of the American Statistical Association, 107(500), 1590–1598. DOI: 10.1080/01621459.2012.737745

Kako citirati ovu stranicu

ScholarGate. (2026, June 2). Change-Point Detection (PELT). ScholarGate. https://scholargate.app/sr/statistics/change-point-detection

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side
ScholarGateChange-Point Detection (Change-Point Detection (PELT)). Preuzeto 2026-06-15 sa https://scholargate.app/sr/statistics/change-point-detection · Skup podataka: https://doi.org/10.5281/zenodo.20539026