טוען...
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...
שמור ב:
| הוצא לאור ב: | Mach Learn |
|---|---|
| Main Authors: | , , , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Springer US
2018
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6399683/ https://ncbi.nlm.nih.gov/pubmed/30906113 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s10994-018-5748-7 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|