The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Accelerated PSO Swarm Search Feature Selection for Data Stream Mining Big Data
Abstract
Big Data though it is a hype up-springing many technical challenges that confront both academic research communities and commercial IT deployment, the root sources of Big Data are founded on data streams and the curse of dimensionality. It is generally known that data which are sourced from data streams accumulate continuously making traditional batch-based model induction algorithms infeasible for real-time data mining. Feature selection has been popularly used to lighten the processing load in inducing a data mining model. However, when it comes to mining over high dimensional data the search space from which an optimal feature subset is derived grows exponentially in size, leading to an intractable demand in computation. In order to tackle this problem which is mainly based on the high-dimensionality and streaming format of data feeds in Big Data, a novel lightweight feature selection is proposed. The feature selection is designed particularly for mining streaming data on the fly, by using accelerated particle swarm optimization (APSO) type of swarm search that achieves enhanced analytical accuracy within reasonable processing time. In this paper, a collection of Big Data with exceptionally large degree of dimensionality are put under test of our new feature selection algorithm for performance evaluation.
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
Mining big data: current status, and forecast to the future
Fan, W., & Bifet, A. (2013) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2481244.2481246 · Cited by 677
Cited by
Recent advancements and challenges of Internet of Things in smart agriculture: A survey
Sinha, B. B., & Dhanalakshmi, R. (2022) · Future Generation Computer Systems · doi:10.1016/j.future.2021.08.006 · Cited by 589
A survey on swarm intelligence approaches to feature selection in data mining
Nguyen, B. H., Xue, B., & Zhang, M. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100663 · Cited by 403
Big data privacy: a technological perspective and review
Jain, P., Gyanchandani, M., & Khare, N. (2016) · Journal of Big Data · doi:10.1186/s40537-016-0059-y · Cited by 392
Swarm Intelligence Algorithms for Feature Selection: A Review
Brezočnik, L., Fister, I., & Podgorelec, V. (2018) · Applied Sciences · doi:10.3390/app8091521 · Cited by 374
Feature selection for high-dimensional classification using a competitive swarm optimizer
Gu, S., Cheng, R., & Jin, Y. (2018) · Soft Computing · doi:10.1007/s00500-016-2385-6 · Cited by 360
Metadata
- Authors
- Fong, S., Wong, R., & Vasilakos, A. V.
- Venue
- IEEE Transactions on Services Computing
- Published
- 2016-01-01
- Volume
- 9
- Issue
- 1
- Pages
- 33-45
- ISSN
- 1939-1374 (ISSN-L)
- 2372-0204
- OpenAlex
- W2282752563
- Cited by
- 240
- References
- 1
- FWCI
- 25.34
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Accelerated PSO Swarm Search Feature Selection for Data Stream Mining Big Data. https://app.cochat.ai/papers/10.1109/tsc.2015.2439695
- The paper
- Fong, S., Wong, R., & Vasilakos, A. V. (2016). Accelerated PSO Swarm Search Feature Selection for Data Stream Mining Big Data. IEEE Transactions on Services Computing. https://doi.org/10.1109/tsc.2015.2439695
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.