scientific article; zbMATH DE number 6276111
From MaRDI portal
Publication:5405109
zbMath1283.68283MaRDI QIDQ5405109
Mikel Luján, Ming-Jie Zhao, Adam Pocock, Gavin Brown
Publication date: 1 April 2014
Full work available at URL: http://www.jmlr.org/papers/v13/brown12a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Statistical ranking and selection procedures (62F07)
Related Items
On bandwidth selection using minimal spanning tree for kernel density estimation ⋮ Locality preserving score for joint feature weights learning ⋮ Dealing with under-reported variables: an information theoretic solution ⋮ Multiple testing of conditional independence hypotheses using information-theoretic approach ⋮ Can high-order dependencies improve mutual information based feature selection? ⋮ Using the “Hidden” genome to improve classification of cancer types ⋮ Feature selection based on fuzzy combination entropy considering global and local feature correlation ⋮ Data poisoning against information-theoretic feature selection ⋮ Cost-constrained group feature selection using information theory ⋮ A neurodynamic optimization approach to supervised feature selection via fractional programming ⋮ A fuzzy set based approach for effective feature selection ⋮ Competence-aware systems ⋮ Squared error-based shrinkage estimators of discrete probabilities and their application to variable selection ⋮ Unnamed Item ⋮ AFNFS: adaptive fuzzy neighborhood-based feature selection with adaptive synthetic over-sampling for imbalanced data ⋮ Online streaming feature selection using rough sets ⋮ Cost-based Feature Selection for Network Model Choice ⋮ Streaming feature-based causal structure learning algorithm with symmetrical uncertainty ⋮ Fuzzy information-theoretic feature selection via relevance, redundancy, and complementarity criteria ⋮ Simple strategies for semi-supervised feature selection ⋮ Concomitance of inverse stochastic resonance and stochastic resonance in a minimal bistable spiking neural circuit ⋮ A semi-parallel framework for greedy information-theoretic feature selection ⋮ Scalable Semisupervised Functional Neurocartography Reveals Canonical Neurons in Behavioral Networks ⋮ Recurrent Information Optimization with Local, Metaplastic Synaptic Dynamics ⋮ An adaptive heuristic for feature selection based on complementarity ⋮ An instance voting approach to feature selection ⋮ From Supervised Instance and Feature Selection Algorithms to Dual Selection: A Review ⋮ New perspectives on multilocus ancestry informativeness ⋮ A greedy feature selection algorithm for big data of high dimensionality ⋮ A set-cover-based approach for the test-cost-sensitive attribute reduction problem ⋮ Solving a class of feature selection problems via fractional 0--1 programming ⋮ Asymptotic distributions of empirical interaction information ⋮ A factor graph model for unsupervised feature selection ⋮ Benchmark for filter methods for feature selection in high-dimensional classification data ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Generalized feature similarity measure ⋮ Forward-Backward Selection with Early Dropping ⋮ Evaluating and selecting features via information theoretic lower bounds of feature inner correlations for high-dimensional data ⋮ Extending greedy feature selection algorithms to multiple solutions ⋮ An efficient semi-supervised representatives feature selection algorithm based on information theory ⋮ Structure learning of Bayesian networks by continuous particle swarm optimization algorithms ⋮ Maximum relevance minimum common redundancy feature selection for nonlinear data ⋮ Predicting 72-hour reattendance in emergency departments using discriminant analysis via mixed integer programming with electronic medical records ⋮ Adaptive Information-Theoretical Feature Selection for Pattern Classification ⋮ Efficient feature selection using shrinkage estimators ⋮ Regularized target encoding outperforms traditional methods in supervised machine learning with high cardinality features ⋮ Regression with adaptive Lasso and correlation based penalty
This page was built for publication: