期刊名称：Proceedings of the National Academy of Sciences
印刷版ISSN：0027-8424
电子版ISSN：1091-6490
出版年度：2018
卷号：115
期号：23
页码：5914-5919
DOI：10.1073/pnas.1804649115
语种：English
出版社：The National Academy of Sciences of the United States of America
摘要：The change-point detection has been carried out in terms of the Euclidean minimum spanning tree (MST) and shortest Hamiltonian path (SHP), with successful applications in the determination of authorship of a classic novel, the detection of change in a network over time, the detection of cell divisions, etc. However, these Euclidean graph-based tests may fail if a dataset contains random interferences. To solve this problem, we present a powerful non-Euclidean SHP-based test, which is consistent and distribution-free. The simulation shows that the test is more powerful than both Euclidean MST- and SHP-based tests and the non-Euclidean MST-based test. Its applicability in detecting both landing and departure times in video data of bees’ flower visits is illustrated.
关键词：non-Euclidean distance ; shortest Hamilton path ; minimum spanning tree ; change-point ; distribution-free
Loading...
