用递归网络自动学惩罚参数，提升变点检测精度
Learning Penalty for Optimal Partitioning via Automatic Feature Extraction
- 用循环网络直接从原始序列中自动提取特征
- 在20个基因组数据集上准确率优于传统方法
- 适合需要高精度变点检测的生物医学研究
变点检测可识别数据序列中的显著变化，在金融、基因和医疗等领域具有重要意义。最优分割算法通过惩罚参数控制变点数量，高效实现检测，但该参数的最优值难以确定。传统方法依赖人工提取序列长度、方差等统计特征进行预测。本文提出新方法，利用循环神经网络直接从原始序列学习惩罚参数，自动完成特征提取。在20个基准基因组数据集上的实验表明，该方法在变点检测准确率上普遍优于传统方法。
原文摘要 · Abstract (English)
Changepoint detection identifies significant shifts in data sequences, making it important in areas like finance, genetics, and healthcare. The Optimal Partitioning algorithms efficiently detect these changes, using a penalty parameter to limit the changepoints count. Determining the optimal value for this penalty can be challenging. Traditionally, this process involved manually extracting statistical features, such as sequence length or variance to make the prediction. This study proposes a novel approach that uses recurrent networks to learn this penalty directly from raw sequences by automatically extracting features. Experiments conducted on 20 benchmark genomic datasets show that this novel method generally outperforms traditional ones in changepoint detection accuracy.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。