mirror of
https://github.com/rmontanana/mdlp.git
synced 2025-08-16 07:55:58 +00:00
feat: 🎨 Refactor algorithm to accept 3 types of computation
This commit is contained in:
11
CPPFImdlp.h
11
CPPFImdlp.h
@@ -6,7 +6,7 @@
|
||||
namespace mdlp {
|
||||
class CPPFImdlp {
|
||||
protected:
|
||||
bool proposal;
|
||||
int proposal;
|
||||
indices_t indices; // sorted indices to use with X and y
|
||||
samples_t X;
|
||||
labels_t y;
|
||||
@@ -15,16 +15,13 @@ namespace mdlp {
|
||||
|
||||
static indices_t sortIndices(samples_t&);
|
||||
void computeCutPoints(size_t, size_t);
|
||||
long int getCandidate(size_t, size_t);
|
||||
bool mdlp(size_t, size_t, size_t);
|
||||
|
||||
// Original algorithm
|
||||
void computeCutPointsOriginal(size_t, size_t);
|
||||
bool goodCut(size_t, size_t, size_t);
|
||||
long int getCandidate(size_t, size_t);
|
||||
void computeCutPointsAlternative(size_t, size_t);
|
||||
void computeCutPointsProposal();
|
||||
|
||||
public:
|
||||
CPPFImdlp(bool);
|
||||
CPPFImdlp(int);
|
||||
~CPPFImdlp();
|
||||
CPPFImdlp& fit(samples_t&, labels_t&);
|
||||
samples_t getCutPoints();
|
||||
|
Reference in New Issue
Block a user