mlpulsarsreport
The report for my Physics Project 1 unit on the topic of "Using Machine Learning to Find New Pulsars".
Science Score: 31.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
○.zenodo.json file
-
○DOI references
-
○Academic links in README
-
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (1.9%) to scientific vocabulary
Last synced: 10 months ago
·
JSON representation
·
Repository
The report for my Physics Project 1 unit on the topic of "Using Machine Learning to Find New Pulsars".
Basic Info
- Host: GitHub
- Owner: jacob-ian
- Language: TeX
- Default Branch: master
- Size: 11 MB
Statistics
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
- Releases: 0
Created about 6 years ago
· Last pushed about 6 years ago
Metadata Files
Citation
Owner
- Name: Jacob Ian Matthews
- Login: jacob-ian
- Kind: user
- Location: Sydney
- Website: https://jacobmatthe.ws
- Repositories: 38
- Profile: https://github.com/jacob-ian
Citation (citations-20200506T115244.bibtex)
@article{10.1093/mnras/stw656,
author = {Lyon, R. J. and Stappers, B. W. and Cooper, S. and Brooke, J. M. and Knowles, J. D.},
title = "{Fifty years of pulsar candidate selection: from simple filters to a new principled real-time classification approach}",
journal = {Monthly Notices of the Royal Astronomical Society},
volume = {459},
number = {1},
pages = {1104-1123},
year = {2016},
month = {04},
abstract = "{Improving survey specifications are causing an exponential rise in pulsar candidate numbers and data volumes. We study the candidate filters used to mitigate these problems during the past 50 years. We find that some existing methods such as applying constraints on the total number of candidates collected per observation, may have detrimental effects on the success of pulsar searches. Those methods immune to such effects are found to be ill-equipped to deal with the problems associated with increasing data volumes and candidate numbers, motivating the development of new approaches. We therefore present a new method designed for online operation. It selects promising candidates using a purpose-built tree-based machine learning classifier, the Gaussian Hellinger Very Fast Decision Tree, and a new set of features for describing candidates. The features have been chosen so as to (i) maximize the separation between candidates arising from noise and those of probable astrophysical origin, and (ii) be as survey-independent as possible. Using these features our new approach can process millions of candidates in seconds (∼1 million every 15 s), with high levels of pulsar recall (90 per cent+). This technique is therefore applicable to the large volumes of data expected to be produced by the Square Kilometre Array. Use of this approach has assisted in the discovery of 20 new pulsars in data obtained during the Low-Frequency Array Tied-Array All-Sky Survey.}",
issn = {0035-8711},
doi = {10.1093/mnras/stw656},
url = {https://doi.org/10.1093/mnras/stw656},
eprint = {https://academic.oup.com/mnras/article-pdf/459/1/1104/8115310/stw656.pdf},
}
GitHub Events
Total
Last Year
Issues and Pull Requests
Last synced: about 1 year ago
All Time
- Total issues: 0
- Total pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Total issue authors: 0
- Total pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0
Past Year
- Issues: 0
- Pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Issue authors: 0
- Pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0