gSeg (version 1.1)

Graph-Based Change-Point Detection (g-Segmentation)

Description

Uses similarity graphs to estimate change-points and their p-values. The default data-level interface constructs a k-MST with k=floor(sqrt(N)) and reports the max-type scan. The generalized, original, and weighted scans remain available explicitly.

Copy Link

Version

Install

install.packages('gSeg')

Monthly Downloads

205

Version

1.1

License

GPL (>= 2)

Maintainer

Hao Chen

Last Published

September 9th, 2026

Functions in gSeg (1.1)

An edge matrix representing a similarity graph

gseg1_discrete

Graph-Based Change-Point Detection for Single Change-Point for Data with Repeated Observations

gseg1_data

Single-Change Graph Scan from Data or Dissimilarities

An edge matrix representing a similiarity graph

gSeg

Graph-Based Change-Point Detection

An edge matrix representing a similarity graph

gseg2

Graph-Based Change-Point Detection for Changed Interval

An edge matrix representing a similarity graph

gseg1

Graph-Based Change-Point Detection for Single Change-Point

The Number of Observations in the Sequence

nnl

Construct the Nearest Neighbor Link (NNL)

gseg2_discrete

Graph-Based Change-Point Detection for Changed Interval for Data with Repeated Observations

An edge matrix representing a similiarity graph

gseg2_data

Changed-Interval Graph Scan from Data or Dissimilarities

gseg_kmst

Construct a k-MST Similarity Graph