Anthony Doan's repositories

timeseries_meetup

Using the fpp2 book and library examples.

Language:RStargazers:1Issues:2Issues:0

thesis_cerp_guide_forest

Rewrite code that is data agnostic for building cerp guide forest.

Language:RStargazers:0Issues:2Issues:1
Language:RStargazers:0Issues:2Issues:0

edgarWebR

R package for interacting with the SEC's EDGAR filing search and retrieval system

Language:RLicense:NOASSERTIONStargazers:0Issues:1Issues:0
Language:ElixirStargazers:0Issues:2Issues:0

Financial-Statements-Text-Analysis

Documentation and code for downloading, cleaning, munging, and analyzing financial statements filed by publicly traded companies with the SEC

Stargazers:0Issues:1Issues:0

flexible_imputation_of_missing_data_Burren

Codes for the book Flexible Imputation of Missing Data by Stef van Buuren

Language:RStargazers:0Issues:2Issues:0
Language:ElixirStargazers:0Issues:1Issues:273
Language:RStargazers:0Issues:0Issues:0

master_thesis

Random Forest is one of the widely used tree-based ensemble classification algorithms. Many aspects of building tree ensembles are introduced to reduce correlation among decision trees within the forest. Bootstrap is used in Random Forest to reduce bias decision tree and to decide splits in every decision tree. Classification by Ensembles from Random Partitions (CERP) is a different algorithm to create an ensemble. CERP randomly partitions the data instead of using bootstrap and creates multiple ensembles instead of one. A forest consists of several decision trees, an ensemble of trees. While Random Forest builds a forest, CERP builds an ensemble of forests. A base classifier in Random Forest uses an exhaustive search to find a split. On the other hand, the Generalized, Unbiased, Interaction Detection and Estimation (GUIDE) algorithm uses statistical hypothesis testing, which is faster than exhaustively search algorithms and is able to detect interaction using a statistical method. This thesis investigated tree-based ensemble classification algorithms that include the CERP, GUIDE, and Random Forest for genetic data.

Stargazers:0Issues:2Issues:0
Language:HTMLStargazers:0Issues:1Issues:0
Language:PythonStargazers:0Issues:0Issues:0
Language:RStargazers:0Issues:2Issues:0

riff_admin

BaubleBox's Internal Admin Tool

Language:JavaScriptStargazers:0Issues:0Issues:0

Taex

Technical Analysis library for Elixir

Language:ElixirLicense:MITStargazers:0Issues:1Issues:0
Stargazers:0Issues:2Issues:0
Language:ElixirStargazers:0Issues:2Issues:0
Language:RStargazers:0Issues:0Issues:0
Language:RStargazers:0Issues:2Issues:0
Language:RStargazers:0Issues:2Issues:0

thesis_prostate_cancer_CERP_GUIDE_pruned_vs_no_prune

Code to create graph about pruned and unpruned data. Check out the pdf. Optimal partition number for pruned CERP-GUIDE forest is 825. For optimal number of partitions for unpruned CERP-GUIDE forest is 833.

Language:RStargazers:0Issues:2Issues:0
Language:RStargazers:0Issues:2Issues:0
Language:RStargazers:0Issues:2Issues:0
Language:RStargazers:0Issues:2Issues:0

tulipindicators

Technical Analysis Indicator Function Library in C

Language:CLicense:LGPL-3.0Stargazers:0Issues:1Issues:0