English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Change-point analysis is thriving in this Big Data era to address problems arising in many fields where massive data sequences are collected to study complicated phenomena over time. It plays an important role in processing these data by segmenting a long sequence into homogeneous parts for follow-up studies. The task requires the method to be able to process large datasets quickly and deal with various types of changes for high-dimensional data. We propose a new approach making use of approximate <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula>-nearest neighbor information from the observations, and derive an analytic formula to control the type I error. The time complexity of our proposed method is <inline-formula><tex-math notation="LaTeX">$O(dn(\log n+k \log d)+nk^{2})$</tex-math></inline-formula> for an <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula>-length sequence of <inline-formula><tex-math notation="LaTeX">$d$</tex-math></inline-formula>-dimensional data. The test statistic we consider incorporates a useful pattern for moderate- to high- dimensional data so that the proposed method could detect various types of changes in the sequence. The new approach is also asymptotic distribution free, facilitating its usage for a broader community. We apply our method to fMRI datasets and Neuropixels datasets to illustrate its effectiveness.

ieee transactions on signal processing

A Fast and Efficient Change-Point Detection Framework Based on Approximate <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula>-Nearest Neighbor Graphs

A Fast and Efficient Change-Point Detection Framework Based on Approximate $k$-Nearest Neighbor Graphs