• Home
  • Search
  • Feature screening algorithm for high dimensional data
  • https://doi.org/10.23939/mmc2023.03.703Copy DOI Icon

Feature screening algorithm for high dimensional data

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

Currently, feature screening is becoming an important topic in the fields of machine learning and high-dimensional data analysis. Filtering out irrelevant features from a set of variables is considered to be an important preliminary step that should be performed before any data analysis. Many approaches have been proposed to the same topic after the work of Fan and Lv (J. Royal Stat. Soc., Ser. B. 70 (5), 849–911 (2008)), who introduced the sure screening property. However, the performance of these methods differs from one paper to another. In this work, we aim to add to this list a new algorithm performing feature screening inspired by the Kendall interaction filter (J. Appl. Stat. 50 (7), 1496–1514 (2020)) when the response variable is continuous. The good behavior of our algorithm is proved through a comparison with an existing method, proposed in this work under several simulation scenarios.

Similar Papers
  • Research Article
  • Citations15

High-dimensional data analysis with subspace comparison using matrix visualization

  • Oct 14, 2017
  • Information Visualization
  • Junpeng Wang +2
  • Research Article
  • Citations1

Distributed Dimensionality Reconstruction Algorithm for High Dimensional Data in Internet of Brain Things

  • Jan 01, 2018
  • IEEE Access
  • Yimin Zhou +2
  • Research Article
  • Citations15

Integrated constraint based clustering algorithm for high dimensional data

  • May 20, 2014
  • Neurocomputing
  • Xinyue Liu +1
  • Peer Review Report

Decision letter: Applying causal discovery to single-cell analyses using CausalCell

  • Aug 14, 2022
  • Babak Momeni
  • Research Article
  • Citations5

Robust feature screening for high-dimensional survival data

  • Oct 04, 2018
  • Journal of Applied Statistics
  • Meiling Hao +3
  • Book Chapter
  • Citations2

Outlier Robust Geodesic K-means Algorithm for High Dimensional Data

  • Jan 01, 2016
  • Aidin Hassanzadeh +2
  • Research Article
  • Citations74

Optimizing Data Stream Representation: An Extensive Survey on Stream Clustering Algorithms

  • Jan 21, 2019
  • Business & Information Systems Engineering
  • Matthias Carnein +1
  • Research Article
  • Citations20

Robust feature screening for elliptical copula regression model

  • May 24, 2019
  • Journal of Multivariate Analysis
  • Yong He +3
  • Research Article
  • Citations256

Quantile-adaptive model-free variable screening for high-dimensional heterogeneous data

  • Feb 01, 2013
  • The Annals of Statistics
  • Xuming He +2
  • Book Chapter
  • Citations1

A Gaussian Process Model for Unsupervised Analysis of High Dimensional Shape Data

  • Jan 01, 2021
  • Wenzheng Tao +2
  • PDF
  • Research Article
  • Citations18

Recursive Random Lasso (RRLasso) for Identifying Anti-Cancer Drug Targets

  • Nov 06, 2015
  • PLoS ONE
  • Heewon Park +2
  • Conference Article
  • Citations4

Robustness of Visualization Methods in Preserving the Continuous and Discrete Latent Structures of High-Dimensional Single-Cell Data

  • Oct 13, 2021
  • Tamasha Malepathirana +3
  • Research Article

Feature screening for case-cohort studies in the presence of interval censoring

  • Nov 20, 2024
  • Journal of Nonparametric Statistics
  • Zhimiao Cao +3
  • Book Chapter
  • Citations17

Multivariate Statistical Methods for High-Dimensional Multiset Omics Data Analysis

  • Nov 01, 2019
  • Attila Csala +1
  • PDF
  • Research Article
  • Citations7

A forest-based feature screening approach for large-scale genome data with complex structures

  • Dec 01, 2015
  • BMC Genetics
  • Gang Wang +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.