Algorithms for the optimal identification of segment neighborhoods
From MaRDI portal
(Redirected from Publication:1111966)
Recommendations
- An algorithm for segment approximation
- Fixed-radius near neighbors search algorithms for points and segments
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
- Algorithm for finding k-nearest neighbors based on octree segmentation in space
- An optimal algorithm for the maximum-density segment problem
- An Optimal Algorithm for the Maximum-Density Segment Problem
- scientific article; zbMATH DE number 1157042
- Combinatorial Pattern Matching
- scientific article; zbMATH DE number 4133523
Cites work
- scientific article; zbMATH DE number 3647917 (Why is no real title available?)
- scientific article; zbMATH DE number 3551729 (Why is no real title available?)
- A New Approach to Estimating Switching Regressions
- A new look at the statistical model identification
- An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
- Curve fitting by segmented straight lines
- General methods of sequence comparison
- Inference in Two-Phase Regression
- Maximal success durations for a semi-Markov process
- Mean Square Error of Prediction as a Criterion for Selecting Variables
- On asymptotic distribution theory in segmented regression problems - identified case
- Relation between the shape of population distribution and the robustness of four simple test statistics
- Robustness to non-normality of regression tests
- Some Comments on C P
- Statistical predictor identification
- Testing for a Two-Phase Multiple Regression
- The Fourier transform of a coiled-coil
- The log likelihood ratio in segmented regression
Cited in
(60)- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
- Detecting multiple generalized change-points by isolating single ones
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
- Constrained dynamic programming and supervised penalty learning algorithms for peak detection in genomic data
- On optimal segmentation and parameter tuning for multiple change-point detection and inference
- New efficient algorithms for multiple change-point detection with reproducing kernels
- A kernel multiple change-point algorithm via model selection
- Optimal detection of changepoints with a linear computational cost
- The revisited knockoffs method for variable selection in L1-penalized regressions
- Analyzing growth components in trees
- A comparison of single and multiple changepoint techniques for time series data
- Generalized multiple change-point detection in the structure of multivariate, possibly high-dimensional, data sequences
- Multi-channel Potts-based reconstruction for multi-spectral computed tomography
- Change-point estimation in the multivariate model taking into account the dependence: application to the vegetative development of oilseed rape
- A computationally efficient nonparametric approach for changepoint detection
- Variable importance assessment in sliced inverse regression for variable selection
- On efficient calculations for Bayesian variable selection
- Greedy Segmentation for a Functional Data Sequence
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
- Cross-validation for change-point regression: pitfalls and solutions
- A pruned recursive solution to the multiple change point problem
- An exact approach to Bayesian sequential change point detection
- Computational Outlier Detection Methods in Sliced Inverse Regression
- Exploring the latent segmentation space for the assessment of multiple change-point models
- Jump-penalized least absolute values estimation of scalar or circle-valued signals
- Parametric methodologies for detecting changes in maximum temperature of Tlaxco, Tlaxcala, México
- Multiple‐Changepoint Testing for an Alternating Segments Model of a Binary Sequence
- Inference for a change-point problem under a generalised Ornstein-Uhlenbeck setting
- Supervised homogeneity fusion: a combinatorial approach
- A nonparametric approach to detecting changes in variance in locally stationary time series
- Optimized variable selection via repeated data splitting
- A sequential multiple change-point detection procedure via VIF regression
- Exact spike train inference via \(\ell_{0}\) optimization
- On regime changes of COVID-19 outbreak
- Smoothing for signals with discontinuities using higher order Mumford-Shah models
- A Segmentation/Clustering Model for the Analysis of Array CGH Data
- Wild binary segmentation for multiple change-point detection
- Inferring switched nonlinear dynamical systems
- Detection of multiple change points for linear processes under negatively super-additive dependence
- On optimal multiple changepoint algorithms for large data
- scientific article; zbMATH DE number 432982 (Why is no real title available?)
- Consistent selection of the number of change-points via sample-splitting
- FDR-control in multiscale change-point segmentation
- scientific article; zbMATH DE number 7255138 (Why is no real title available?)
- Narrowest-Over-Threshold Detection of Multiple Change Points and Change-Point-Like Features
- Comparative evaluation of various frequentist and Bayesian non-homogeneous Poisson counting models
- A breakpoint detection in the mean model with heterogeneous variance on fixed time intervals
- Exact Bayesian inference for off-line change-point detection in tree-structured graphical models
- Optimal nonlinear signal approximations based on piecewise constant functions
- Labeled Optimal Partitioning
- Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory
- Mining events with declassified diplomatic documents
- scientific article; zbMATH DE number 5371223 (Why is no real title available?)
- Relating and comparing methods for detecting changes in mean
- Heterogeneity in DNA multiple alignments: modeling, inference, and applications in motif finding
- Statistical methods for DNA sequence segmentation
- A dynamic programming segmentation procedure for hydrological and environmental time series
- Linear Time Dynamic Programming for Computing Breakpoints in the Regularization Path of Models Selected From a Finite Set
- Characterization and Automation of Matching-Based Neighborhoods
- Tail-greedy bottom-up data decompositions and fast multiple change-point detection
This page was built for publication: Algorithms for the optimal identification of segment neighborhoods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111966)
