A greedy feature selection algorithm for Big Data of high dimensionality

We present the Parallel, Forward–Backward with Pruning (PFBP) algorithm for feature selection (FS) for Big Data of high dimensionality. PFBP partitions the data matrix both in terms of rows as well as columns. By employing the concepts of p -values of conditional independence tests and meta-analysis...

Full description

Saved in:

Bibliographic Details
Published in:	Machine learning Vol. 108; no. 2; pp. 149 - 202
Main Authors:	Tsamardinos, Ioannis, Borboudakis, Giorgos, Katsogridakis, Pavlos, Pratikakis, Polyvios, Christophides, Vassilis
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2019 Springer Nature B.V Springer Verlag
Subjects:	Algorithms Artificial Intelligence Bayesian analysis Big Data Computer Science Computer simulation Control Data management Empirical analysis Greedy algorithms Iterative methods Machine Learning Mechatronics Natural Language Processing (NLP) Parallel processing Partitions Polymorphism Pruning Robotics Simulation and Modeling Big Data Feature selection Data analytics Forward selection Variable selection
ISSN:	0885-6125, 1573-0565
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!