Fetching the paper…
Reading the bibliography…
Several statistical approaches based on reproducing kernels have been proposed to detect abrupt changes arising in the full distribution of the observations and not only in the mean or variance.
Bellman, R., 1961. On the approximation of curves by line segments using dynamic programming. Communications of the ACM 4 (6), 284
1961
Earlier work this paper cites.
Berg, C., Christensen, J. P. R., Ressel, P., 1984. Harmonic Analysis on Semigroups. Springer, New-York
1984
Earlier work this paper cites.
Ledoux, M., Talagrand, M., 1991. Probability in Banach spaces. Vol. 23 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)]. Springer-Verlag, Berlin, isoperimetry and processes
1991
Earlier work this paper cites.
Smola, A. J., Schölkopf, B., 2000. Sparse greedy matrix approximation for machine learning. In: Proceedings of the Seventeenth International Conference on Machine Learning. ICML ’00. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 911–918. URL http://dl.acm.org/citation.cfm?id=645529.657980
2000
Earlier work this paper cites.
Fine, S., Scheinberg, K., Cristianini, N., Shawe-Taylor, J., Williamson, B., 2001. Efficient svm training using low-rank kernel representations. Journal of Machine Learning Research 2, 243–264
2001
Earlier work this paper cites.
Williams, C., Seeger, M., 2001. Using the Nyström method to speed up kernel machines. In: Advances in Neural Information Processing Systems 13. MIT Press, pp. 682–688
2001
Earlier work this paper cites.
Hautaniemi, A. R., Kauraniemi, S., Yli-Harja, P., Astola, O., Wolf, J., Kallioniemi, M., 2003. A cgh-plotter: Matlab toolbox for cgh-data analysis. Bioinformatics 13 (1714–1715)
2003
Earlier work this paper cites.
Jong, K., Marchiori, E., van der Vaart, A., Ylstra, B., Weiss, M., Meijer, G., 2003. Applications of evolutionary computing. In: EvoWorkshops 2003: Proceedings. Vol. 2611 of chap. chromosomal breakpoint detection in human cancer. Springer-Verlag Heidelberg, pp. 54–65
2003
Earlier work this paper cites.
Berlinet, A., Thomas-Agnan, C., 2004. Reproducing kernel Hilbert spaces in probability and statistics. Kluwer Academic Publishers, Boston, MA, with a preface by Persi Diaconis. URL http://dx.doi.org/10.1007/978-1-4419-9096-9
2004
Earlier work this paper cites.
Lebarbier, E., Apr. 2005. Detecting multiple change-points in the mean of gaussian process by model selection. Signal Process. 85 (4), 717–736. URL http://dx.doi.org/10.1016/j.sigpro.2004.11.012
2004
Earlier work this paper cites.
Olshen, A. B., Venkatraman, E. S., Lucito, R., Wigler, M., 2004. Circular binary segmentation for the analysis of array-based DNA copy number data. Biostatistics 5 (4), 557–572
2004
Earlier work this paper cites.
Drineas, P., Mahoney, M. W., 2005. On the nyström method for approximating a gram matrix for improved kernel-based learning. Journal of Machine Learning Research 6, 2153–2175
2005
Earlier work this paper cites.
Picard, F., Robin, S., Lavielle, M., Vaisse, C., Daudin, J.-J., Jan. 2005. A statistical approach for array-CGH data analysis. BMC bioinformatics 6, 27. URL http://www.ncbi.nlm.nih.gov/pubmed/15705208
2005
Earlier work this paper cites.
Birgé, L., Massart, P., 2007. Minimal penalties for Gaussian model selection. Probab. Theory Related Fields 138 (1-2), 33–73
2007
Earlier work this paper cites.
Harchaoui, Z., Cappé, O., 2007. Retrospective mutiple change-point estimation with kernels. In: Statistical Signal Processing, 2007. SSP’07. IEEE/SP 14th Workshop on. IEEE, pp. 768–772
2007
Earlier work this paper cites.
Gartner, T., 2008. Kernels for structured data. Vol. 72. World Scientific
2008
Cited alongside, same era.
Gey, S., Lebarbier, E., 2008. Using cart to detect multiple change points in the mean for large sample. Tech. rep., HAL. URL https://hal.inria.fr/file/index/docid/327146/filename/article_CART.pdf
2008
Cited alongside, same era.
Staaf, J., Lindgren, D., Vallon-Christersson, J., Isaksson, A., et al., Oct. 2008. Segmentation-based detection of allelic imbalance and loss-of-heterozygosity in cancer cells using whole genome SNP arrays. Genome Biol 9 (9), R136
2008
Cited alongside, same era.
Cormen, T. H., 2009. Introduction to algorithms. MIT press
2009
Cited alongside, same era.
Christmann, A., Steinwart, I., 2010. Universal kernels on non-standard input spaces. In: Advances in neural information processing systems. pp. 406–414
2010
Bach, F., 2013. Sharp analysis of low-rank kernel matrix approximations. In: In Proc. COLT, 2013. pp. 185–209
2013
Later among the works it cites.
Brodsky, E., Darkhovsky, B. S., 2013. Nonparametric methods in change point problems. Vol. 243. Springer Science & Business Media
2013
Later among the works it cites.
Hocking, T., Schleiermacher, G., Janoueix-Lerosey, I., Boeva, V., Cappo, J., Delattre, O., Bach, F., Vert, J.-P., 2013. Learning smoothing models of copy number profiles using breakpoint annotations. BMC Bioinformatics 14 (1), 164
2013
Later among the works it cites.
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Sriperumbudur, B. K., Fukumizu, K., Lanckriet, G. R., 2010. On the relation between universality, characteristic kernels and rkhs embedding of measures. In: Proc. of 13th International Conference on Artificial Intelligence and Statistics. pp. 773–780
2010
Cited alongside, same era.
Arlot, S., Celisse, A., 2011. Segmentation of the mean of heteroscedastic data via cross-validation. Stat. Comput. 21 (4), 613–632
2011
Cited alongside, same era.
Hanahan, D., Weinberg, R. A., 2011. Hallmarks of cancer: the next generation. Cell 144 (5), 646–674
2011
Cited alongside, same era.
Neuvial, P., Bengtsson, H., Speed, T. P., Mar. 2011. Statistical analysis of single nucleotide polymorphism microarrays in cancer studies. In: Handbook of Statistical Bioinformatics, 1st Edition. Springer Handbooks of Computational Statistics. Springer, pp. 225–255
2011
Cited alongside, same era.
Gretton, A., Sejdinovic, D., Strathmann, H., Balakrishnan, S., Pontil, M., Fukumizu, K., Sriperumbudur, B. K., 2012. Optimal kernel choice for large-scale two-sample tests. In: Advances in neural information processing systems. pp. 1205–1213
2012
Cited alongside, same era.
Killick, R., Fearnhead, P., Eckley, I., 2012. Optimal detection of changepoints with a linear computational cost. Journal of the American Statistical Association 107 (500), 1590–1598
2012
Cited alongside, same era.
Lai, Y., Jun. 2012. Change-Point analysis of paired Allele-Specific copy number variation data. Journal of Computational Biology 19 (6), 679–693
2012
Cited alongside, same era.
2013
Later among the works it cites.
Cleynen, A., Lebarbier, E., 2014. Segmentation of the poisson and negative binomial rate models: a penalized estimator. ESAIM: Probability and Statistics 18, 750–769
2014
Later among the works it cites.
Fryzlewicz, P., 2014. Wild binary segmentation for multiple change-point detection. The Annals of Statistics 42 (6), 2243–2281
2014
Later among the works it cites.
Lajugie, R., Bach, F., Arlot, S., 2014. Large-margin metric learning for constrained partitioning problems. In: International Conference on Machine Learning. pp. 297–305
2014
Later among the works it cites.
Pierre-Jean, M., Rigaill, G., Neuvial, P., 2014. Performance evaluation of DNA copy number segmentation methods. Briefings in Bioinformatics. URL http://bib.oxfordjournals.org/content/early/2014/09/08/bib.bbu026.abstract
2014
Later among the works it cites.
Rigaill, G., 2015. A pruned dynamic programming algorithm to recover the best segmentations with 1 to k_max change-points. Journal de la Société Française de Statistique 156 (4), 180–205
2015
Later among the works it cites.
Dieuleveut, A., Bach, F., 2016. Nonparametric stochastic approximation with large step-sizes. The Annals of Statistics 44 (4), 1363–1399
2016
Later among the works it cites.
2016
Later among the works it cites.
Haynes, K., Eckley, I. A., Fearnhead, P., 2017. Computationally efficient changepoint detection for a range of penalties. Journal of Computational and Graphical Statistics 26 (1), 134–143
2017
Closest in time.
Maidstone, R., Hocking, T., Rigaill, G., Fearnhead, P., 2017. On optimal multiple changepoint algorithms for large data. Statistics and Computing 27 (2), 519–533
2017
Closest in time.