Timeline for Fixed-length decision-tree-like feature selection to minimize average search performance
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2017 at 6:14 | answer | added | Andrew Dalke | timeline score: 1 | |
| Jan 6, 2016 at 10:46 | history | edited | Kaveh | edited tags | |
| Nov 20, 2012 at 20:01 | comment | added | Anton | Is your data fixed-are you going to add more examples? If not- better try building descision tree by starting with the subquery with highest information entropy.You can also choose some minimum entropy where to stop the tree based descisions and search with |S|.t time when S is small enough. | |
| Nov 19, 2012 at 10:49 | history | tweeted | twitter.com/#!/StackCompSci/status/270479085300510721 | ||
| Nov 19, 2012 at 9:34 | review | First posts | |||
| Nov 19, 2012 at 9:58 | |||||
| Nov 19, 2012 at 9:26 | history | edited | A.Schulz | CC BY-SA 3.0 | latexifed |
| Nov 19, 2012 at 9:17 | history | asked | Andrew Dalke | CC BY-SA 3.0 |