On the public citation graph

Pdf-Stwii-An Efficient Parallel Deep Forest Algorithm for Big Data Environment

0 signed · 17 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/cpe.7618openalex-snapshot
Hybrid optimization enabled deep learning and spark architecture using big data analytics for stock market forecasting
inferredcites →https://doi.org/10.1002/for.2891openalex-snapshot
Deep learning meets decision trees: An application of a heterogeneous deep forest approach in credit scoring for online consumer lending
inferredcites →https://doi.org/10.1007/s11063-021-10720-6openalex-snapshot
A Feature Selection Algorithm Based on Equal Interval Division and Conditional Mutual Information
inferredcites →https://doi.org/10.1007/s13042-023-01897-4openalex-snapshot
Feature selection using symmetric uncertainty and hybrid optimization for high-dimensional data
inferredcites →https://doi.org/10.1007/s41870-022-01115-4openalex-snapshot
A supervised machine learning-based solution for efficient network intrusion detection using ensemble learning based on hyperparameter optimization
inferredcites →https://doi.org/10.1016/j.bdr.2022.100353openalex-snapshot
A Facial Expression Recognition Approach for Social IoT Frameworks
inferredcites →https://doi.org/10.1016/j.eswa.2022.116889openalex-snapshot
Assessing credit risk of commercial customers using hybrid machine learning algorithms
inferredcites →https://doi.org/10.1016/j.ins.2022.02.024openalex-snapshot
Feature-specific mutual information variation for multi-label feature selection
inferredcites →https://doi.org/10.1016/j.neucom.2022.11.037openalex-snapshot
Optimal binning for a variance based alternative of mutual information in pattern recognition
inferredcites →https://doi.org/10.1016/j.patcog.2023.109378openalex-snapshot
MFSJMI: Multi-label feature selection considering join mutual information and interaction weight
inferredcites →https://doi.org/10.1088/1741-2552/acbe1dopenalex-snapshot
Beyond linear neural envelope tracking: a mutual information approach
inferredcites →https://doi.org/10.1093/nsr/nwy108openalex-snapshot
Deep forest
inferredcites →https://doi.org/10.1109/jbhi.2020.2995767openalex-snapshot
Emotion Recognition From Multi-Channel EEG via Deep Forest
inferredcites →https://doi.org/10.1109/tevc.2023.3238420openalex-snapshot
SFE: A Simple, Fast, and Efficient Feature Selection Algorithm for High-Dimensional Data
inferredcites →https://doi.org/10.1109/tpds.2023.3324911openalex-snapshot
CERT-DF: A Computing-Efficient and Robust Distributed Deep Forest Framework With Low Communication Overhead
inferredcites →https://doi.org/10.1111/coin.12433openalex-snapshot
An adapting soft computing model for intrusion detection system
inferredcites →https://doi.org/10.3390/electronics8090968openalex-snapshot
Dynamic Deep Forest: An Ensemble Classification Method for Network Intrusion Detection
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.