Skip to content

FinancialComputingUCL/MFCF

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
fast-MFCF
fast-MFCF
 
 
README.md
README.md
 
 
gain_functions.py
gain_functions.py
 
 
gain_table.py
gain_table.py
 
 
mfcf.py
mfcf.py
 
 
test_01_TMFG_like.py
test_01_TMFG_like.py
 
 
test_02_TMFG_reuse_separators.py
test_02_TMFG_reuse_separators.py
 
 
test_03_mc_cl_reuse_separators_threshold.py
test_03_mc_cl_reuse_separators_threshold.py
 
 
test_04_tree_reuse_separators_threshold.py
test_04_tree_reuse_separators_threshold.py
 
 
test_05_tree_drop_separators_threshold.py
test_05_tree_drop_separators_threshold.py
 
 
test_06_forest_drop_separators_threshold.py
test_06_forest_drop_separators_threshold.py
 
 
test_07_higher_dimension_threshold.py
test_07_higher_dimension_threshold.py
 
 
test_08_with_LoGo.py
test_08_with_LoGo.py
 
 
test_09_with_LoGo.py
test_09_with_LoGo.py
 
 

Repository files navigation

Fast_MFCF is an ultra-fast implementation of the Maximally Filtered Clique Forest (MFCF). It is based on the work by Guido Previde Massara and is fully implemented Hongyu (Eric) Lin. This repository contains both the legacy code for MFCF and the folder for fast-MFCF.

About

No description, website, or topics provided.

Resources

Readme
Activity
Custom properties

Stars

1 star

Watchers

0 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages