scientific article; zbMATH DE number 6378115

MaRDI QIDQ2934043zbMATH OpenFDO

Authors Mingkui Tan, Ivor W. Tsang, Li Wang

Publication date 8 December 2014

Full work available at URL https://arxiv.org/abs/1209.5260, http://jmlr.csail.mit.edu/papers/v15/tan14a.html

zbMATH Keywords

big datafeature generationfeature selectionmultiple kernel learningnonlinear feature selectionultrahigh dimensionality

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Applications of mathematical programming (90C90)

Recommendations

• Ultrahigh dimensional feature selection: beyond the linear model
• A selective overview of feature screening for ultrahigh-dimensional data
• Feature selection for high-dimensional data
• A greedy feature selection algorithm for big data of high dimensionality
• Feature subset selection in large dimensionality domains
• Overview of feature screening methods for ultra-high dimensional data
• Unsupervised feature selection for efficient exploration of high dimensional data
• Feature screening for ultrahigh dimensional binary data
• Near-optimal feature selection for large databases

Cited in

(19)

• Evolutionary feature selection for big data classification: a MapReduce approach
• Budget constrained non-monotonic feature selection
• Finding the best not the most: regularized loss minimization subgraph selection for graph classification
• Recent contributions to linear semi-infinite optimization
• Recent contributions to linear semi-infinite optimization: an update
• Multiple Bayesian discriminant functions for high-dimensional massive data classification
• Towards scalable fuzzy-rough feature selection
• Quick and robust feature selection: the strength of energy-efficient sparse training for autoencoders
• A semi-parallel framework for greedy information-theoretic feature selection
• Dimension reduction big data using recognition of data features based on copula function and principal component analysis
• Feature selection for high-dimensional data
• A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics
• Smart sampling and incremental function learning for very large high dimensional data
• Making decision trees feasible in ultrahigh feature and label dimensions
• A detailed study of the distributed rough set based locality sensitive hashing feature selection technique
• Feature selection: from the past to the future
• A greedy feature selection algorithm for big data of high dimensionality
• A two-way accelerator for feature selection using a monotonic fuzzy conditional entropy
• Feature subset selection in large dimensionality domains

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934043)