The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Granular ball computing classifiers for efficient, scalable and robust learning
Abstract
Abstract Granular computing is an efficient and scalable computing method. Most of the existing granular computing-based classifiers treat the granules as a preliminary feature procession method, without revising the mathematical model and improving the main performance of the classifiers themselves. So far, only few methods, such as the G-svm and WLMSVM, have been combined with specific classifiers. Because of the complete symmetry of the ball and its simple mathematical expression, it is relatively easy to be combined with the other classifiers’ mathematical models. Therefore, this paper uses a ball to represent the grain, namely the granular ball, and not only the granular balls’ labels but also the distance between a pair of balls is defined. Based on that, this paper attempts to propose a new granular classifier framework by replacing the point inputs with the granular balls. We derive the basic model of both the granular ball support vector machine and granular ball k-nearest neighbor algorithm (GBkNN). In addition, the GBkNN is compared with the k-means tree based kNN, which is the most efficient and effective kNN as far as we known, on both public and artificial data sets. The Experimental results demonstrate the effectiveness and efficiency of the proposed framework.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Pawlak, Z. (1982) · International Journal of Computer & Information Sciences · doi:10.1007/bf01001956 · Cited by 12,322
Clustering by fast search and find of density peaks
Rodriguez, A., & Laio, A. (2014) · Science · doi:10.1126/science.1242072 · Cited by 4,942
Fuzzy logic = computing with words
Zadeh, L. A. (1996) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.493904 · Cited by 3,227
Zadeh, L. A. (1997) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(97)00077-8 · Cited by 2,897
Scalable Nearest Neighbor Algorithms for High Dimensional Data
Muja, M., & Lowe, D. G. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2321376 · Cited by 1,407
Efficient kNN classification with different numbers of nearest neighbors
Zhang, S., Li, X., Zong, M., Zhu, X., & Wang, R. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2673241 · Cited by 1,378
Searching for exotic particles in high-energy physics with deep learning
Baldi, P., Sadowski, P., & Whiteson, D. (2014) · Nature Communications · doi:10.1038/ncomms5308 · Cited by 1,164
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
Fukunaga, K., & Narendra, P. M. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224297 · Cited by 736
Five Balltree Construction Algorithms
Omohundro, S. M. (2009) · Cited by 422
Refinements to nearest-neighbor searching ink-dimensional trees
Sproull, R. F. (1991) · Algorithmica · doi:10.1007/bf01759061 · Cited by 349
A simple algorithm for nearest neighbor search in high dimensions
Nene, S. A., & Nayar, S. K. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.615448 · Cited by 311
Parallel granular neural networks for fast credit card fraud detection
Syeda, M. K., Zhang, Y., & Pan, Y. F. (2003) · Proceedings of ... IEEE International Conference on Fuzzy Systems · doi:10.1109/fuzz.2002.1005055 · Cited by 155
2015 IEEE International Conference on Cluster Computing
(2015) · doi:10.1109/cluster34361.2015 · Cited by 143
Evolving granular neural networks from fuzzy data streams
Leite, D. F., Costa, P., & Gomide, F. A. C. (2012) · Neural Networks · doi:10.1016/j.neunet.2012.10.006 · Cited by 142
A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
Kim, B. S., & Park, S. B. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767859 · Cited by 110
Xia, S., Wang, G., Chen, Z., Duan, Y., & Liu, Q. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2873791 · Cited by 96
Self-citationDing, S., Zhang, X., An, Y., & Xue, Y. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.02.011 · Cited by 78
Granular computing for data mining
Yao, Y. Y. (2006) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.669023 · Cited by 71
Two fast nearest neighbor searching algorithms for image vector quantization
Tai, S., Lai, C. C., & Lin, Y. C. (1996) · IEEE Transactions on Communications · doi:10.1109/26.545888 · Cited by 69
Fast and Accurate Support Vector Machines on Large Scale Systems
Vishnu, A., Narasimhan, J., Holder, L. B., Kerbyson, D. J., & Hoisie, A. (2015) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster.2015.26 · Cited by 15
Cited by
GBNRS: A Novel Rough Set Algorithm for Fast Adaptive Attribute Reduction in Classification
Xia, S., Zhang, H., Li, W., Wang, G., Giem, E., & Chen, Z. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2997039 · Cited by 273
Self-citationA Fast Adaptive k-means with No Bounds
Xia, S., Peng, D., Meng, D., Zhang, C., Wang, G., Giem, E., Wei, W., & Chen, Z. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3008694 · Cited by 149
Self-citation
Metadata
- Authors
- Xia, S., Liu, Y., Ding, X., Wang, G., Yu, H., & Luo, Y.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2019-05
- Volume
- 483
- Pages
- 136-152
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2908436867
- Cited by
- 341
- References
- 22
- FWCI
- 7.37
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.