| 光谱学与光谱分析 |
|
|
|
|
|
| SKLOF: A New Algorithm to Reduce the Range of Supernova Candidates |
| TU Liang-ping1, 2, WEI Hui-ming1, WEI Peng2, PAN Jing-chang3, LUO A-li2, ZHAO Yong-heng2 |
1. School of Science, University of Science and Technology Liaoning, Anshan 114051, China
2. Key Laboratory of Optical Astronomy, National Astronomical Observatories, Chinese Academy of Sciences, Beijing 100012, China
3. School of Mechanical, Electrical & Information Engineering, Shandong University, Weihai, Weihai 264209, China |
|
|
|
|
Abstract Supernova (SN) is called the “standard candles” in the cosmology, the probability of outbreak in the galaxy is very low and is a kind of special, rare astronomical objects. Only in a large number of galaxies, we have a chance to find the supernova. The supernova which is in the midst of explosion will illuminate the entire galaxy, so the spectra of galaxies we obtained have obvious features of supernova. But the number of supernova have been found is very small relative to the large number of astronomical objects. The time computation that search the supernova be the key to weather the follow-up observations, therefore it needs to look for an efficient method. The time complexity of the density-based outlier detecting algorithm (LOF) is not ideal, which effects its application in large datasets. Through the improvement of LOF algorithm, a new algorithm that reduces the searching range of supernova candidates in a flood of spectra of galaxies is introduced and named SKLOF. Firstly, the spectra datasets are pruned and we can get rid of most objects are impossible to be the outliers. Secondly, we use the improved LOF algorithm to calculate the local outlier factors (LOF) of the spectra datasets remained and all LOFs are arranged in descending order. Finally, we can get the smaller searching range of the supernova candidates for the subsequent identification. The experimental results show that the algorithm is very effective, not only improved in accuracy, but also reduce the operation time compared with LOF algorithm with the guarantee of the accuracy of detection.
|
|
Received: 2013-12-10
Accepted: 2014-03-21
|
|
|
|
Corresponding Authors:
TU Liang-ping
E-mail: tlp_kd@163.com
|
|
[1] JI Pei-wen, HU Jing-yao(汲培文，胡景耀). Science Foundation in China(中国科学基金), 1997, 11(3): 175.
[2] Frieman J A, Bassett, Becker A, et al. The Astronomical Journal, 2008, 135(1): 338.
[3] Masao Sako, Bruce Bassett, Andrew Becker, et al. The Astronomical Journal, 2008, 135(1): 348.
[4] Li W D, Filippenko A V, Treffers R R, et al. AIP Conf. Proc., 2000, 522: 103.
[5] Mario Humay, Gastn Folatelli, Nidia I, et al. Publication of Astronomical Society of the Pacific, 2006, 118(839): 2.
[6] Alderinga G, Adamb G, Antilogus P, et al. Proc. SPIE, 2002, 4836: 61.
[7] LI Wei-dong, ZHAO Zhao-wang, QIU Yu-lei, et al(李卫东，赵昭旺，裘予雷，等). Science in China(Seriss A)(中国科学A辑)，1998, 41(3): 283.
[8] TU Liang-ping，LUO A-li, WU Fu-chao, et al(屠良平，罗阿里，吴福朝，等). SCIENTIA SINICA Physica, Mechanica & Astronomica(中国科学：物理学 力学 天文学), 2010, 40(10)：1282.
[9] Markus M Breuning, Hans-Peter Kriegel, Raymond T Ng, et al. Proceeding of the ACM SIGMOD International Conference, on Management of Data, 2000, 93.
[10] Jiang F, Sui Y F, Cao C G. Pattern Recognition Letters, 2011, 32: 1860.
[11] Salman Ahmed Shaikh, Hiroyuki Kitagawa. Lecture Notes in Computer Science, 2012, 7235: 109. |
|
|
|
