The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Comparison of decision tree methods for finding active objects
Open accessAbstract
Abstract The automated classification of objects from large catalogs or survey projects is an important task in many astronomical surveys. Faced with various classification algorithms, astronomers should select the method according to their requirements. Here we describe several kinds of decision trees for finding active objects by multi-wavelength data, such as REPTree, Random Tree, Decision Stump, Random Forest, J48, NBTree, AdTree. All decision tree approaches investigated are in the WEKA package. The classification performance of the methods is presented. In the process of classification by decision tree methods, the classification rules are easily obtained, moreover these rules are clear and easy to understand for astronomers. As a result, astronomers are inclined to prefer and apply them, thus know which attributes are important to discriminate celestial objects. The experimental results show that when various decision trees are applied in discriminating active objects (quasars, BL Lac objects and active galaxies) from non-active objects (stars and galaxies), ADTree is the best only in terms of accuracy, Decision Stump is the best only considering speed, J48 is the optimal choice considering both accuracy and speed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Witten, I. H. (2008) · Cited by 9,143
Data mining: practical machine learning tools and techniques with Java implementations
Witten, I. H., & Frank, E. (2002) · ACM SIGMOD Record · doi:10.1145/507338.507355 · Cited by 5,137
Scaling Up the Accuracy of Naive-Bayes Classifiers : a Decision-Tree Hybrid
Kohavi, R. (1996) · Knowledge Discovery and Data Mining · Cited by 1,414
The Alternating Decision Tree Learning Algorithm
Freund, Y., & Mason, L. (1999) · Cited by 773
Morphological Classification of galaxies by Artificial Neural Networks
Storrie‐Lombardi, M. C., Lahav, O., Junior, L. S., & Storrie‐Lombardi, L. J. (1992) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/259.1.8p · Cited by 152
Estimating Photometric Redshifts Using Support Vector Machines
Wadadekar, Y. G. (2005) · Publications of the Astronomical Society of the Pacific · doi:10.1086/427710 · Cited by 119
Ball, N. M., Brunner, R. J., Myers, A. D., & Tcheng, D. (2006) · The Astrophysical Journal · doi:10.1086/507440 · Cited by 101
Cited by
Classification Based on Decision Tree Algorithm for Machine Learning
Charbuty, B., & Abdulazeez, A. (2021) · Journal of Applied Science and Technology Trends · doi:10.38094/jastt20165 · Cited by 1,871
How Many Trees in a Random Forest?
Oshiro, T. M., Perez, P. S., & Baranauskas, J. A. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-31537-4_13 · Cited by 912
Tien Bui, D., Pradhan, B., Lofman, O., & Revhaug, I. (2012) · Mathematical Problems in Engineering · doi:10.1155/2012/974638 · Cited by 574
Hong, H., Liu, J., Bui, D. T., Pradhan, B., Acharya, T. D., Pham, B. T., Zhu, A.-X., Chen, W., & Ahmad, B. B. (2018) · CATENA · doi:10.1016/j.catena.2018.01.005 · Cited by 491
Data mining and machine learning in astronomy
BALL, N. M., & BRUNNER, R. J. (2010) · International Journal of Modern Physics D · doi:10.1142/s0218271810017160 · Cited by 383
Metadata
- Authors
- Zhao, Y., & Zhang, Y.
- Venue
- Advances in Space Research
- Publisher
- Elsevier BV
- Published
- 2008
- Volume
- 41
- Issue
- 12
- Pages
- 1955-1959
- ISSN
- 0273-1177 (ISSN-L)
- OpenAlex
- W2062611449
- Cited by
- 347
- References
- 21
- FWCI
- 2.01
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Comparison of decision tree methods for finding active objects. https://app.cochat.ai/papers/10.1016/j.asr.2007.07.020
- The paper
- Zhao, Y., & Zhang, Y. (2008). Comparison of decision tree methods for finding active objects. Advances in Space Research. https://doi.org/10.1016/j.asr.2007.07.020
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.