./readyDOS/ loading

float inhale_rate = 0.5;
float exhale_rate = 1.0;
while(1) { 
    // Inhale phase
    for(float i = 0; i <= 1; i += inhale_rate) {
        printf("\rInhaling... (%f%%)\n", i * 100);
        sleep(1); // Sleep for 1 second to simulate time passing
    }

    // Pause between inhale and exhale
    printf("\rPausing...\n");
    sleep(2);

    // Exhale phase
    for(float i = 1; i >= 0; i -= exhale_rate) {
                    printf("\rExhaling... (%f%%)\n", i * 100);
                    sleep(1); // Sleep for 1 second to simulate time passing
    }

    // Pause between exhale and inhale
    printf("\rPausing...\n");
    sleep(2);
}

double x_min = -2.0;
double y_min = -1.5;
double x_max = 1.0;
double y_max = 1.5;

for (int j = 0; j < height; ++j) {
    for (int i = 0; i < width; ++i) {
        std::complex<double> 
            c((x_min + (x_max - x_min) * i / (width - 1)), 
                ((y_min + (y_max - y_min)) * j) / (height - 1));

        int iter = 0;
        std::complex<double> z(0, 0);

        while (std::abs(z) <= 2 && iter < 255) {
                z = z * z + c;
                ++iter;
        }

        unsigned char color[] = {
            static_cast<unsigned char>(iter % 8 * 32),
            static_cast<unsigned char>(iter % 16 * 17),
            static_cast<unsigned char>(iter % 32 * 14)
        };
        file.write(reinterpret_cast<char*>(color), sizeof(color));
    }
}

using ll = long long;
const ll INF = (1LL<<62);
vector<ll> dist(n, INF);
priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<pair<ll,int>>> pq;

dist[s] = 0;
pq.push({0, s});
while (!pq.empty()) {
    auto [d, u] = pq.top(); pq.pop();
    if (d != dist[u]) continue;
    for (auto [v, w] : g[u]) {
        if (dist[v] > d + w) {
            dist[v] = d + w;
            pq.push({dist[v], v});
        }
    }
}

struct DSU {
    vector<int> p, r;
    DSU(int n): p(n), r(n,0) { iota(p.begin(), p.end(), 0); }
    int find(int a){ return p[a]==a? a : p[a]=find(p[a]); }
    bool unite(int a,int b){
        a=find(a); b=find(b);
        if(a==b) return false;
        if(r[a]<r[b]) swap(a,b);
        p[b]=a;
        if(r[a]==r[b]) r[a]++;
        return true;
    }
};

vector<int> pi(const string& s){
        int n=s.size();
        vector<int> p(n);
        for(int i=1;i<n;i++){
                int j=p[i-1];
                while(j>0 && s[i]!=s[j]) j=p[j-1];
                if(s[i]==s[j]) j++;
                p[i]=j;
        }
        return p;
}

struct BIT {
        int n; vector<long long> bit;
        BIT(int n): n(n), bit(n+1,0) {}
        void add(int i,long long v){ for(++i;i<=n;i+=i&-i) bit[i]+=v; }
        long long sum(int i){ long long r=0; for(++i;i>0;i-=i&-i) r+=bit[i]; return r; }
};

vector<int> nge(n, -1);
stack<int> st;
for(int i=0;i<n;i++){
        while(!st.empty() && a[st.top()] < a[i]){
                nge[st.top()] = i;
                st.pop();
        }
        st.push(i);
}

queue<int> q;
for(int i=0;i<n;i++) if(indeg[i]==0) q.push(i);
vector<int> order;
while(!q.empty()){
        int u=q.front(); q.pop();
        order.push_back(u);
        for(int v: adj[u]){
                if(--indeg[v]==0) q.push(v);
        }
}

struct Seg {
        int n; vector<long long> t;
        Seg(int n): n(n), t(4*n, INF) {}
        void upd(int v,int tl,int tr,int pos,ll val){
                if(tl==tr){ t[v]=val; return; }
                int tm=(tl+tr)/2;
                if(pos<=tm) upd(v*2,tl,tm,pos,val);
                else upd(v*2+1,tm+1,tr,pos,val);
                t[v]=min(t[v*2],t[v*2+1]);
        }
        ll qry(int v,int tl,int tr,int l,int r){
                if(l>r) return INF;
                if(l==tl && r==tr) return t[v];
                int tm=(tl+tr)/2;
                return min(qry(v*2,tl,tm,l,min(r,tm)),
                                      qry(v*2+1,tm+1,tr,max(l,tm+1),r));
        }
};;
                    
float inhale_rate = 0.5;
float exhale_rate = 1.0;
while(1) { 
    // Inhale phase
    for(float i = 0; i <= 1; i += inhale_rate) {
        printf("\rInhaling... (%f%%)\n", i * 100);
        sleep(1); // Sleep for 1 second to simulate time passing
    }

    // Pause between inhale and exhale
    printf("\rPausing...\n");
    sleep(2);

    // Exhale phase
    for(float i = 1; i >= 0; i -= exhale_rate) {
                    printf("\rExhaling... (%f%%)\n", i * 100);
                    sleep(1); // Sleep for 1 second to simulate time passing
    }

    // Pause between exhale and inhale
    printf("\rPausing...\n");
    sleep(2);
}

double x_min = -2.0;
double y_min = -1.5;
double x_max = 1.0;
double y_max = 1.5;

for (int j = 0; j < height; ++j) {
    for (int i = 0; i < width; ++i) {
        std::complex<double> 
            c((x_min + (x_max - x_min) * i / (width - 1)), 
                ((y_min + (y_max - y_min)) * j) / (height - 1));

        int iter = 0;
        std::complex<double> z(0, 0);

        while (std::abs(z) <= 2 && iter < 255) {
                z = z * z + c;
                ++iter;
        }

        unsigned char color[] = {
            static_cast<unsigned char>(iter % 8 * 32),
            static_cast<unsigned char>(iter % 16 * 17),
            static_cast<unsigned char>(iter % 32 * 14)
        };
        file.write(reinterpret_cast<char*>(color), sizeof(color));
    }
}

using ll = long long;
const ll INF = (1LL<<62);
vector<ll> dist(n, INF);
priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<pair<ll,int>>> pq;

dist[s] = 0;
pq.push({0, s});
while (!pq.empty()) {
    auto [d, u] = pq.top(); pq.pop();
    if (d != dist[u]) continue;
    for (auto [v, w] : g[u]) {
        if (dist[v] > d + w) {
            dist[v] = d + w;
            pq.push({dist[v], v});
        }
    }
}

struct DSU {
    vector<int> p, r;
    DSU(int n): p(n), r(n,0) { iota(p.begin(), p.end(), 0); }
    int find(int a){ return p[a]==a? a : p[a]=find(p[a]); }
    bool unite(int a,int b){
        a=find(a); b=find(b);
        if(a==b) return false;
        if(r[a]<r[b]) swap(a,b);
        p[b]=a;
        if(r[a]==r[b]) r[a]++;
        return true;
    }
};

vector<int> pi(const string& s){
        int n=s.size();
        vector<int> p(n);
        for(int i=1;i<n;i++){
                int j=p[i-1];
                while(j>0 && s[i]!=s[j]) j=p[j-1];
                if(s[i]==s[j]) j++;
                p[i]=j;
        }
        return p;
}

struct BIT {
        int n; vector<long long> bit;
        BIT(int n): n(n), bit(n+1,0) {}
        void add(int i,long long v){ for(++i;i<=n;i+=i&-i) bit[i]+=v; }
        long long sum(int i){ long long r=0; for(++i;i>0;i-=i&-i) r+=bit[i]; return r; }
};

vector<int> nge(n, -1);
stack<int> st;
for(int i=0;i<n;i++){
        while(!st.empty() && a[st.top()] < a[i]){
                nge[st.top()] = i;
                st.pop();
        }
        st.push(i);
}

queue<int> q;
for(int i=0;i<n;i++) if(indeg[i]==0) q.push(i);
vector<int> order;
while(!q.empty()){
        int u=q.front(); q.pop();
        order.push_back(u);
        for(int v: adj[u]){
                if(--indeg[v]==0) q.push(v);
        }
}

struct Seg {
        int n; vector<long long> t;
        Seg(int n): n(n), t(4*n, INF) {}
        void upd(int v,int tl,int tr,int pos,ll val){
                if(tl==tr){ t[v]=val; return; }
                int tm=(tl+tr)/2;
                if(pos<=tm) upd(v*2,tl,tm,pos,val);
                else upd(v*2+1,tm+1,tr,pos,val);
                t[v]=min(t[v*2],t[v*2+1]);
        }
        ll qry(int v,int tl,int tr,int l,int r){
                if(l>r) return INF;
                if(l==tl && r==tr) return t[v];
                int tm=(tl+tr)/2;
                return min(qry(v*2,tl,tm,l,min(r,tm)),
                                      qry(v*2+1,tm+1,tr,max(l,tm+1),r));
        }
};;
ReadyDOS
  • automationProductskeyboard_arrow_down

Ranked Models

Customer Intelligence

04/10/2026 05:34

run identifier

• 3f7c95d6-0151-4f67-aa99-5651595d7456

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9386F1 Score0.8629Precision • Recall0.8373 0.8901

Recommendations

04/10/2026 01:04

run identifier

• 7834ce69-d180-4f4d-bd0e-054793f014b2

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999994R.M.S.E • M.A.E • M.S.E.0.0004 0.0000 0.0013

Fraud Detection

04/09/2026 02:48

run identifier

• 38723737-feed-4c97-86d3-bab1cc952ac7

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9956F1 Score0.9773Precision • Recall1.0000 0.9557
Live Logs

🧬 Loading data ﹙≈ 3-8 mins; standby﹚

run identifier: bbe4856...

🌱 Generating stochastic, realistic synthetic users and activity events

run identifier: bbe4856...

📝 New client data not found

run identifier: bbe4856...

⌕ Checking for new training data

run identifier: bbe4856...

▶ Starting

run identifier: bbe4856...

✔ Completed

run identifier: 3f7c95d...

💾 Persisting model

run identifier: 3f7c95d...

🌢 Persisting metrics

run identifier: 3f7c95d...

ƒ(x) Evaluating

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.94

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.89

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.94

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.92

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.91

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.92

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.94

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.92

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.92

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.90

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.94

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.94

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.94

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.92

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.92

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.91

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.92

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.90

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.92

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.91

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.92

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.90

run identifier: 3f7c95d...

λ · ⚙️ L-BFGS Logistic Regression Binary · AUC (PR) 0.93

run identifier: 3f7c95d...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.91

run identifier: 3f7c95d...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.90

run identifier: 3f7c95d...

∈ New Customer Intelligence workflow

run identifier: 3f7c95d...

⧉ Training

run identifier: 3f7c95d...

∞ Building estimator chain

run identifier: 3f7c95d...

⧉ Training

run identifier: 3f7c95d...

← ▣ → Splitting data

run identifier: 3f7c95d...

✨ Segmenting

run identifier: 3f7c95d...

⚡ Data loaded

run identifier: 3f7c95d...

🧬 Loading data ﹙≈ 3-8 mins; standby﹚

run identifier: 3f7c95d...

🌱 Generating stochastic, realistic synthetic users and activity events

run identifier: 3f7c95d...

📝 New client data not found

run identifier: 3f7c95d...

⌕ Checking for new training data

run identifier: 3f7c95d...

▶ Starting

run identifier: 3f7c95d...

✔ Completed

run identifier: 25a4768...

💾 Persisting model

run identifier: 25a4768...

🌢 Persisting metrics

run identifier: 25a4768...

ƒ(x) Evaluating

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9941

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9941

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9941

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9947

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9957

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9945

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9941

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9960

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9949

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9951

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9945

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9958

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9941

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9956

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9956

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9956

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9955

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9956

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9956

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9956

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9956

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9947

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9962

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9955

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9941

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9961

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9936

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9953

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9963

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9952

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9965

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9965

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9965

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9947

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9965

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9947

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9965

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9965

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🍃.ೃ Fast Forest Binary · AUC (PR) 0.9959

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9964

run identifier: 25a4768...

λ · 🌳 Fast Tree Binary · AUC (PR) 0.9965

run identifier: 25a4768...

Workflow History

04/10/2026 05:34

Customer Intelligence • run identifier • 3f7c95d6-0151-4f67-aa99-5651595d7456

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9386F1 Score0.8629Precision • Recall0.8373 0.8901

04/10/2026 05:17

Fraud Detection • run identifier • 25a47687-6363-4824-b9f1-eebf4be884c6

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9965F1 Score0.9733Precision • Recall1.0000 0.9481

04/10/2026 05:10

Recommendations • run identifier • 4994e879-19a5-4938-9b8f-6282c38f1522

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.997067R.M.S.E • M.A.E • M.S.E.0.0198 0.0008 0.0283

04/10/2026 04:53

Customer Intelligence • run identifier • e2bf78c0-5c04-41e6-bc9c-4dcf75a5902a

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9371F1 Score0.8592Precision • Recall0.8337 0.8864

04/10/2026 04:36

Fraud Detection • run identifier • 6dc462e3-9ca9-4962-97b2-8d86bafadb72

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9953F1 Score0.9705Precision • Recall0.9949 0.9472

04/10/2026 04:29

Recommendations • run identifier • 76e6ff13-5aad-46b9-8c16-02dbc15580a1

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.985822R.M.S.E • M.A.E • M.S.E.0.0509 0.0039 0.0621

04/10/2026 04:12

Customer Intelligence • run identifier • c2c063c9-b92a-4a41-b03b-ea9af01a2209

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9372F1 Score0.8590Precision • Recall0.8306 0.8895

04/10/2026 03:55

Fraud Detection • run identifier • a315cf4a-119e-4207-a387-eb13cb187e12

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9962F1 Score0.9703Precision • Recall0.9953 0.9466

04/10/2026 03:48

Recommendations • run identifier • f2bafd6e-172c-46f9-9050-3debe87e8fb6

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999388R.M.S.E • M.A.E • M.S.E.0.0107 0.0002 0.0129

04/10/2026 03:31

Customer Intelligence • run identifier • d28c38a6-6529-43e9-825d-7e3846c286e8

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9355F1 Score0.8564Precision • Recall0.8289 0.8857

04/10/2026 03:14

Fraud Detection • run identifier • ddf998ce-6f34-417f-87dc-159c3c9ee999

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9952F1 Score0.9691Precision • Recall0.9994 0.9406

04/10/2026 03:07

Recommendations • run identifier • 78a25e63-f014-4b39-a0dd-39a0cf2a284f

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999809R.M.S.E • M.A.E • M.S.E.0.0045 0.0001 0.0072

04/10/2026 02:50

Customer Intelligence • run identifier • 743084d2-cefa-4cb4-9a0f-37ed1cae426d

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9341F1 Score0.8558Precision • Recall0.8355 0.8772

04/10/2026 02:34

Fraud Detection • run identifier • 6175369e-1b7a-4ff6-ac55-8ad5bad5c4a8

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9959F1 Score0.9678Precision • Recall0.9984 0.9390

04/10/2026 02:26

Recommendations • run identifier • ef420a12-2a00-4b01-8e12-69ea5ea9c1b4

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999959R.M.S.E • M.A.E • M.S.E.0.0014 0.0000 0.0033

04/10/2026 02:09

Customer Intelligence • run identifier • 0e543103-3189-4a9f-b9c2-8a7fe15bd980

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9359F1 Score0.8573Precision • Recall0.8281 0.8886

04/10/2026 01:53

Fraud Detection • run identifier • 6d489439-996a-47c6-9584-5b5cf8b20397

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9953F1 Score0.9673Precision • Recall0.9990 0.9376

04/10/2026 01:45

Recommendations • run identifier • 3331c990-60b9-4d6b-9d42-6fc3a34eec40

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999267R.M.S.E • M.A.E • M.S.E.0.0094 0.0002 0.0142

04/10/2026 01:28

Customer Intelligence • run identifier • fb1f01ea-41d9-4f9e-9281-b328993541aa

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9360F1 Score0.8573Precision • Recall0.8335 0.8825

04/10/2026 01:12

Fraud Detection • run identifier • 6fa2a571-129e-46b3-93d0-e757add1daac

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9954F1 Score0.9684Precision • Recall1.0000 0.9387

04/10/2026 01:04

Recommendations • run identifier • 7834ce69-d180-4f4d-bd0e-054793f014b2

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999994R.M.S.E • M.A.E • M.S.E.0.0004 0.0000 0.0013

04/10/2026 12:48

Customer Intelligence • run identifier • c4d58c36-dcf2-4818-aee7-96a306c99aa0

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9378F1 Score0.8609Precision • Recall0.8375 0.8857

04/10/2026 12:31

Fraud Detection • run identifier • 6ac36186-d882-4bce-8e83-c0d3ca68dca4

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9944F1 Score0.9656Precision • Recall0.9978 0.9354

04/10/2026 12:23

Recommendations • run identifier • 84e2563f-f2dc-4cc4-aa81-87dfaf62f60d

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999965R.M.S.E • M.A.E • M.S.E.0.0019 0.0000 0.0031

04/10/2026 12:07

Customer Intelligence • run identifier • 8fd3f0ba-3192-4b89-bfee-9e8cb73c4b9c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9348F1 Score0.8559Precision • Recall0.8330 0.8801

04/09/2026 11:50

Fraud Detection • run identifier • c4f24b8b-2827-4443-90d8-37a9ff504a1f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9960F1 Score0.9701Precision • Recall1.0000 0.9420

04/09/2026 11:42

Recommendations • run identifier • a4ff8686-c558-48d0-aeb6-b0c996ff72f1

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999991R.M.S.E • M.A.E • M.S.E.0.0003 0.0000 0.0015

04/09/2026 11:26

Customer Intelligence • run identifier • 27a46b28-9a64-4843-982b-6086b3a1a56a

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9363F1 Score0.8597Precision • Recall0.8281 0.8939

04/09/2026 11:09

Fraud Detection • run identifier • 1ec98471-25c9-487a-a17f-d8669329c8eb

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9964F1 Score0.9732Precision • Recall0.9856 0.9611

04/09/2026 11:02

Recommendations • run identifier • 052a5235-6837-4928-bec0-8fef92f07414

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999904R.M.S.E • M.A.E • M.S.E.0.0019 0.0000 0.0051

04/09/2026 10:45

Customer Intelligence • run identifier • 12a5214e-da69-408d-8882-2f636b3c8bd9

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9367F1 Score0.8608Precision • Recall0.8434 0.8788

04/09/2026 10:28

Fraud Detection • run identifier • e7685f64-f6ef-4f3a-a4d7-cdce6fb8e0c4

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9965F1 Score0.9742Precision • Recall1.0000 0.9497

04/09/2026 10:21

Recommendations • run identifier • 80c6b526-9c67-42d3-a5cd-b5704b212d06

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999889R.M.S.E • M.A.E • M.S.E.0.0021 0.0000 0.0055

04/09/2026 10:04

Customer Intelligence • run identifier • f4cc7fe0-e988-4ee0-a1da-39224834e3bb

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9342F1 Score0.8550Precision • Recall0.8287 0.8829

04/09/2026 09:47

Fraud Detection • run identifier • d9bcacf8-4652-422e-96ad-309349495498

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9963F1 Score0.9721Precision • Recall1.0000 0.9456

04/09/2026 09:40

Recommendations • run identifier • d9bb38fc-9350-41f3-a391-ae26dbcc47b1

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999989R.M.S.E • M.A.E • M.S.E.0.0004 0.0000 0.0017

04/09/2026 09:23

Customer Intelligence • run identifier • b08e095e-394f-49fd-a81d-8e1af0410dee

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9372F1 Score0.8569Precision • Recall0.8298 0.8859

04/09/2026 09:07

Fraud Detection • run identifier • 1f073db7-59ba-46e9-8310-582ca80efbc3

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9947F1 Score0.9666Precision • Recall1.0000 0.9354

04/09/2026 08:59

Recommendations • run identifier • 9c0f60c5-3f6f-44ed-9044-d47d570ee89d

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999900R.M.S.E • M.A.E • M.S.E.0.0024 0.0000 0.0052

04/09/2026 08:42

Customer Intelligence • run identifier • e0dab816-c3a5-4633-9274-c886b6aa08da

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9371F1 Score0.8577Precision • Recall0.8356 0.8810

04/09/2026 08:26

Fraud Detection • run identifier • 1a272680-a053-4958-9485-7eaaac6324b9

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9960F1 Score0.9733Precision • Recall0.9994 0.9485

04/09/2026 08:18

Recommendations • run identifier • 7ca05a61-6b2e-4675-86ab-9eb191c5246b

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999807R.M.S.E • M.A.E • M.S.E.0.0048 0.0001 0.0072

04/09/2026 08:02

Customer Intelligence • run identifier • 1782c585-23f1-4b98-85a0-1c424b36b20f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9363F1 Score0.8590Precision • Recall0.8334 0.8862

04/09/2026 07:45

Fraud Detection • run identifier • 27b8a986-c54b-4507-8d69-b5f444858bdd

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9966F1 Score0.9738Precision • Recall0.9948 0.9537

04/09/2026 07:37

Recommendations • run identifier • 83015f8f-0733-49b3-8ab2-d7a9cd8ebf58

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999946R.M.S.E • M.A.E • M.S.E.0.0016 0.0000 0.0038

04/09/2026 07:21

Customer Intelligence • run identifier • 570a5170-8ed1-478c-93d0-09bef026022c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9361F1 Score0.8590Precision • Recall0.8348 0.8846

04/09/2026 07:04

Fraud Detection • run identifier • da451bb4-bb71-4f74-9814-eead03fc376f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9949F1 Score0.9710Precision • Recall1.0000 0.9436

04/09/2026 06:56

Recommendations • run identifier • 75c214b8-836d-415b-86b4-d11f1f7cdaa8

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.998123R.M.S.E • M.A.E • M.S.E.0.0142 0.0005 0.0224

04/09/2026 06:40

Customer Intelligence • run identifier • eba202d2-e7c7-411e-b950-29075e8c5211

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9354F1 Score0.8590Precision • Recall0.8375 0.8816

04/09/2026 06:21

Fraud Detection • run identifier • bf310f46-01e7-47ef-ae85-4f2bc6cf5fb5

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9951F1 Score0.9674Precision • Recall1.0000 0.9368

04/09/2026 06:14

Recommendations • run identifier • 5e471053-47f3-40f8-a80d-13b9a21fbf81

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.998881R.M.S.E • M.A.E • M.S.E.0.0122 0.0003 0.0173

04/09/2026 05:57

Customer Intelligence • run identifier • fcca689b-fbde-46b0-9223-1e491295c735

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9344F1 Score0.8590Precision • Recall0.8321 0.8877

04/09/2026 05:25

Customer Intelligence • run identifier • 37e2a461-7a73-4cee-8b5e-65668d81e398

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9341F1 Score0.8590Precision • Recall0.8297 0.8904

04/09/2026 05:09

Fraud Detection • run identifier • a90a51e8-295c-439d-ab22-b7e9fcc63018

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9964F1 Score0.9734Precision • Recall1.0000 0.9482

04/09/2026 05:01

Recommendations • run identifier • 01ce8934-15d7-4685-9ac5-3b75cec663b0

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999911R.M.S.E • M.A.E • M.S.E.0.0016 0.0000 0.0049

04/09/2026 04:44

Customer Intelligence • run identifier • 250a80d0-28c2-4959-b69c-7e9c89220ad1

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9305F1 Score0.8539Precision • Recall0.8259 0.8838

04/09/2026 04:28

Fraud Detection • run identifier • a0137ef5-6f3b-41ef-9f8e-d8637bf23a28

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9957F1 Score0.9678Precision • Recall0.9957 0.9415

04/09/2026 04:20

Recommendations • run identifier • 5a9a89da-e045-4b54-a3e1-8d646273e410

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999926R.M.S.E • M.A.E • M.S.E.0.0016 0.0000 0.0045

04/09/2026 04:04

Customer Intelligence • run identifier • 27280b0c-257c-4f5b-9084-f018f56753ea

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9340F1 Score0.8574Precision • Recall0.8308 0.8857

04/09/2026 03:47

Fraud Detection • run identifier • da1cb228-f104-4275-90e6-4cd33c665f85

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9950F1 Score0.9700Precision • Recall1.0000 0.9417

04/09/2026 03:39

Recommendations • run identifier • b6b3fbef-0fc5-4b37-9a39-2a82138c0992

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999847R.M.S.E • M.A.E • M.S.E.0.0031 0.0000 0.0064

04/09/2026 03:23

Customer Intelligence • run identifier • 4fd83fdf-1ffa-4de9-8693-18c88e652bf1

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9369F1 Score0.8637Precision • Recall0.8343 0.8952

04/09/2026 03:06

Fraud Detection • run identifier • 51115bef-bbf0-4194-b63d-90e0dd800f10

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9960F1 Score0.9700Precision • Recall1.0000 0.9418

04/09/2026 02:58

Recommendations • run identifier • 4dbd085e-07fe-4dd0-ad5b-4f634b8db342

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.997882R.M.S.E • M.A.E • M.S.E.0.0175 0.0006 0.0239

04/09/2026 02:42

Customer Intelligence • run identifier • 5d9a2cb4-3a9d-4014-856f-f3d946f67a2d

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9355F1 Score0.8594Precision • Recall0.8271 0.8943

04/09/2026 02:25

Fraud Detection • run identifier • a41b456e-abce-4a7b-886f-19d8a7ffa0d1

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9966F1 Score0.9735Precision • Recall0.9985 0.9497

04/09/2026 02:17

Recommendations • run identifier • 188a7e45-1b57-488b-b624-b745289ee88f

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999866R.M.S.E • M.A.E • M.S.E.0.0028 0.0000 0.0060

04/09/2026 02:01

Customer Intelligence • run identifier • 258a8577-9e1e-4b92-a6ec-315dd841d5e6

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9363F1 Score0.8567Precision • Recall0.8329 0.8818

04/09/2026 01:44

Fraud Detection • run identifier • ae4dd49d-3d5a-4cf6-9af6-9073c205f12f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9954F1 Score0.9729Precision • Recall1.0000 0.9472

04/09/2026 01:37

Recommendations • run identifier • 89da677e-fced-4846-af3b-a3abfe44f19c

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.998658R.M.S.E • M.A.E • M.S.E.0.0136 0.0004 0.0190

04/09/2026 01:20

Customer Intelligence • run identifier • a7422a32-1ea3-4417-9e59-4069a8ca8c6c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9328F1 Score0.8589Precision • Recall0.8307 0.8890

04/09/2026 01:03

Fraud Detection • run identifier • 6a9835d3-5d53-42db-b42e-bc9d58b8bc8f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9955F1 Score0.9742Precision • Recall1.0000 0.9496

04/09/2026 12:56

Recommendations • run identifier • 71ae58cb-10f3-42bb-910c-e245a75dc69d

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999661R.M.S.E • M.A.E • M.S.E.0.0056 0.0001 0.0095

04/09/2026 12:39

Customer Intelligence • run identifier • bf636489-5ed1-40ef-951c-60bc87918758

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9383F1 Score0.8617Precision • Recall0.8349 0.8902

04/09/2026 12:22

Fraud Detection • run identifier • b4dcdf71-ba9f-4be0-b927-170657950711

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9953F1 Score0.9682Precision • Recall0.9940 0.9437

04/09/2026 12:15

Recommendations • run identifier • 29aef487-8019-471f-9049-71b02692d1ba

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999933R.M.S.E • M.A.E • M.S.E.0.0011 0.0000 0.0043

04/09/2026 11:58

Customer Intelligence • run identifier • 81387157-d559-4a71-8f04-2a2b3ea236e5

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9348F1 Score0.8575Precision • Recall0.8340 0.8824

04/09/2026 11:41

Fraud Detection • run identifier • 5d517de6-27a7-4bf2-ab92-0586db4bc78c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9956F1 Score0.9725Precision • Recall0.9978 0.9484

04/09/2026 11:34

Recommendations • run identifier • 716f1af3-7c41-4cb2-85c5-7f8fa1daf5b2

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999682R.M.S.E • M.A.E • M.S.E.0.0056 0.0001 0.0093

04/09/2026 11:17

Customer Intelligence • run identifier • 62534db4-62e3-42c0-b630-db5031a465c7

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9367F1 Score0.8563Precision • Recall0.8328 0.8810

04/09/2026 11:01

Fraud Detection • run identifier • 02f37e6a-10dc-44ee-9992-190310af28aa

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9951F1 Score0.9705Precision • Recall1.0000 0.9428

04/09/2026 10:53

Recommendations • run identifier • 23ce960b-febd-40cd-bca7-2717f78f45d0

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999882R.M.S.E • M.A.E • M.S.E.0.0024 0.0000 0.0056

04/09/2026 10:36

Customer Intelligence • run identifier • 01fa23cd-0bc9-4330-beb7-e8ae0a70a45f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9353F1 Score0.8582Precision • Recall0.8351 0.8827

04/09/2026 10:20

Fraud Detection • run identifier • 5dabe45d-eaab-4cab-a1cf-7efb71aac51b

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9954F1 Score0.9699Precision • Recall1.0000 0.9415

04/09/2026 10:12

Recommendations • run identifier • dc9b64e2-1270-4877-8dc5-a62687f6a901

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999905R.M.S.E • M.A.E • M.S.E.0.0017 0.0000 0.0051

04/09/2026 09:55

Customer Intelligence • run identifier • 1d90215e-7e4a-4425-88ee-aa31f03078c9

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9352F1 Score0.8586Precision • Recall0.8306 0.8885

04/09/2026 09:39

Fraud Detection • run identifier • db0d9013-da80-42a4-841d-a414086eaaec

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9940F1 Score0.9662Precision • Recall1.0000 0.9347

04/09/2026 09:31

Recommendations • run identifier • 0a1f4f6b-3740-43f9-951d-e98b5d791517

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999914R.M.S.E • M.A.E • M.S.E.0.0013 0.0000 0.0048

04/09/2026 09:15

Customer Intelligence • run identifier • fded0c1f-c751-40d3-bc07-b695d90d9f97

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9375F1 Score0.8606Precision • Recall0.8405 0.8817

04/09/2026 08:58

Fraud Detection • run identifier • 84feedf4-d7e9-47a5-a65a-3f313a18c734

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9950F1 Score0.9680Precision • Recall0.9976 0.9401

04/09/2026 08:50

Recommendations • run identifier • e3f09a46-4f18-48e9-856b-715011cad0f6

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999899R.M.S.E • M.A.E • M.S.E.0.0020 0.0000 0.0052

04/09/2026 08:34

Customer Intelligence • run identifier • ffb44b02-f373-4561-80b5-68e0eda91e91

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9364F1 Score0.8598Precision • Recall0.8342 0.8870

04/09/2026 08:17

Fraud Detection • run identifier • 6cdc58db-b475-41cc-985d-ce6911aeac4d

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9952F1 Score0.9684Precision • Recall1.0000 0.9388

04/09/2026 08:10

Recommendations • run identifier • 8290bea4-147c-49af-a026-5ae05c005ac3

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999920R.M.S.E • M.A.E • M.S.E.0.0024 0.0000 0.0046

04/09/2026 07:53

Customer Intelligence • run identifier • 56b67560-9a02-42e8-bf4e-38e6075f0ee0

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9367F1 Score0.8616Precision • Recall0.8356 0.8894

04/09/2026 07:36

Fraud Detection • run identifier • cac56141-95c5-44ac-81cd-bf02dbd7e7f8

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9964F1 Score0.9714Precision • Recall0.9965 0.9476

04/09/2026 07:29

Recommendations • run identifier • f4b04991-2344-4f7c-b8d8-d5a2bcf9d8d9

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.998014R.M.S.E • M.A.E • M.S.E.0.0167 0.0005 0.0232

04/09/2026 07:12

Customer Intelligence • run identifier • 48f36fa1-4d9e-406d-8de9-2948894352b3

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9361F1 Score0.8576Precision • Recall0.8361 0.8802

04/09/2026 06:55

Fraud Detection • run identifier • 1d5d353e-e207-4757-aa5e-c8d0fe958a16

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9962F1 Score0.9766Precision • Recall1.0000 0.9543

04/09/2026 06:48

Recommendations • run identifier • ccb19f14-a07b-44c6-8f03-6306a9919202

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999946R.M.S.E • M.A.E • M.S.E.0.0019 0.0000 0.0038

04/09/2026 06:31

Customer Intelligence • run identifier • e2fdb170-19c4-433f-8fb5-6eddee288fe4

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9340F1 Score0.8561Precision • Recall0.8307 0.8831

04/09/2026 06:15

Fraud Detection • run identifier • 6b62dfd4-145e-4983-90d3-6b3ba76d5e9b

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9957F1 Score0.9721Precision • Recall1.0000 0.9457

04/09/2026 06:07

Recommendations • run identifier • fb7b67c4-dfde-4b98-963f-7fe27e6b6c8e

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999953R.M.S.E • M.A.E • M.S.E.0.0017 0.0000 0.0036

04/09/2026 05:50

Customer Intelligence • run identifier • 6a9c170b-6d9f-4b41-8e1b-2d501c2294a2

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9350F1 Score0.8590Precision • Recall0.8322 0.8876

04/09/2026 05:34

Fraud Detection • run identifier • 8c37e14e-07ad-4c5b-9b98-bded232c4fee

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9968F1 Score0.9749Precision • Recall1.0000 0.9510

04/09/2026 05:26

Recommendations • run identifier • c0f3b0a7-73ef-41b8-a2da-019807674366

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999516R.M.S.E • M.A.E • M.S.E.0.0080 0.0001 0.0115

04/09/2026 05:09

Customer Intelligence • run identifier • 380c1039-22da-4308-bec8-850d55400893

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9378F1 Score0.8611Precision • Recall0.8347 0.8891

04/09/2026 04:53

Fraud Detection • run identifier • 0b8425f8-6f4c-4650-acda-e961bad86193

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9954F1 Score0.9681Precision • Recall1.0000 0.9382

04/09/2026 04:45

Recommendations • run identifier • 87644e44-bd13-413f-bf8c-a9486e445cf6

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.993214R.M.S.E • M.A.E • M.S.E.0.0314 0.0019 0.0432

04/09/2026 04:29

Customer Intelligence • run identifier • 85265dc5-17d1-4302-9b54-0c06b87c26c7

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9389F1 Score0.8595Precision • Recall0.8312 0.8897

04/09/2026 04:12

Fraud Detection • run identifier • f68bc411-2cd9-45db-b8e2-795a8280923f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9966F1 Score0.9735Precision • Recall0.9945 0.9534

04/09/2026 04:04

Recommendations • run identifier • 51214b9d-bedd-4ba0-8ae1-71f6f0b7ab87

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999887R.M.S.E • M.A.E • M.S.E.0.0018 0.0000 0.0056

04/09/2026 03:48

Customer Intelligence • run identifier • 5f20e9f3-3e9c-4333-9d58-ba1dedd793a2

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9346F1 Score0.8606Precision • Recall0.8284 0.8955

04/09/2026 03:31

Fraud Detection • run identifier • 92674d90-826a-46ce-922d-936bab12051d

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9947F1 Score0.9688Precision • Recall0.9995 0.9399

04/09/2026 03:23

Recommendations • run identifier • 049639d1-1cd0-420a-b5ba-299488a14248

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999196R.M.S.E • M.A.E • M.S.E.0.0094 0.0002 0.0148

04/09/2026 03:07

Customer Intelligence • run identifier • 94b4bf99-fc18-4144-a152-c93434336a99

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9368F1 Score0.8593Precision • Recall0.8379 0.8818

04/09/2026 02:48

Fraud Detection • run identifier • 38723737-feed-4c97-86d3-bab1cc952ac7

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9956F1 Score0.9773Precision • Recall1.0000 0.9557

04/09/2026 02:41

Recommendations • run identifier • 46b6f5c3-a38a-48be-9242-ae238e256a3d

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999752R.M.S.E • M.A.E • M.S.E.0.0050 0.0001 0.0082

04/09/2026 02:24

Customer Intelligence • run identifier • fd1eebd9-43c7-4447-bfb6-ad3da367cb39

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9374F1 Score0.8616Precision • Recall0.8352 0.8898

04/09/2026 01:48

Customer Intelligence • run identifier • daada5e9-9732-4d28-8f19-4e2cbfd1d07a

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9368F1 Score0.8608Precision • Recall0.8344 0.8890

04/09/2026 01:31

Fraud Detection • run identifier • 5c704b32-7a3c-4990-b5bd-8be3f3453e00

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9967F1 Score0.9745Precision • Recall1.0000 0.9503

04/09/2026 01:23

Recommendations • run identifier • 4875df8c-c867-4431-8961-0557d34b16b1

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999955R.M.S.E • M.A.E • M.S.E.0.0011 0.0000 0.0035

04/09/2026 01:07

Customer Intelligence • run identifier • 5d72609d-c8db-4e03-85c5-36496824df93

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9339F1 Score0.8571Precision • Recall0.8352 0.8803

04/09/2026 12:50

Fraud Detection • run identifier • c72f27fb-85b0-46f5-80ba-5353011732c0

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9959F1 Score0.9691Precision • Recall0.9908 0.9485

04/09/2026 12:42

Recommendations • run identifier • 7937e85b-c51d-4d90-a3ca-10808aee0bc4

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999839R.M.S.E • M.A.E • M.S.E.0.0042 0.0000 0.0066

04/09/2026 12:26

Customer Intelligence • run identifier • e2f83b1e-ce9c-48e7-9669-65f5d177d2cc

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9369F1 Score0.8588Precision • Recall0.8374 0.8814

04/09/2026 12:09

Fraud Detection • run identifier • ab5c7ee3-2f03-40c3-bccd-f51dfe04eda2

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9942F1 Score0.9707Precision • Recall1.0000 0.9431

04/09/2026 12:02

Recommendations • run identifier • 63685f58-5380-4175-94c4-370f6a18f5c4

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.998975R.M.S.E • M.A.E • M.S.E.0.0112 0.0003 0.0165

04/08/2026 11:45

Customer Intelligence • run identifier • f371390f-2733-4b77-9258-4ddb605b8ef5

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9387F1 Score0.8614Precision • Recall0.8415 0.8823

04/08/2026 11:28

Fraud Detection • run identifier • 2209ee6e-bc80-4e18-99a7-33878c5b6985

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9957F1 Score0.9724Precision • Recall0.9981 0.9480

04/08/2026 11:20

Recommendations • run identifier • d872de90-f494-40ee-9cf1-00be473e93c8

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.998242R.M.S.E • M.A.E • M.S.E.0.0157 0.0005 0.0217

04/08/2026 11:03

Customer Intelligence • run identifier • 355eaf93-84f6-4c51-987d-4ee30e27b455

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)L-BFGS Logistic Regression BinaryK-Means++A.U.C.0.9255F1 Score0.8499Precision • Recall0.8050 0.9001

04/08/2026 10:47

Fraud Detection • run identifier • f18b3d93-c8e1-441e-af1b-584ff3f29dae

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9967F1 Score0.9749Precision • Recall1.0000 0.9510

04/08/2026 10:39

Recommendations • run identifier • 23e276ac-94e6-4709-969c-61ba0c4639d4

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999880R.M.S.E • M.A.E • M.S.E.0.0034 0.0000 0.0056

04/08/2026 10:23

Customer Intelligence • run identifier • af561b91-29cd-45db-a3d1-f18ca0741ae0

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9341F1 Score0.8545Precision • Recall0.8280 0.8827

04/08/2026 10:06

Fraud Detection • run identifier • c9d2904e-d6cc-48ee-977e-221f6c42ad76

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9955F1 Score0.9745Precision • Recall1.0000 0.9503

04/08/2026 09:58

Recommendations • run identifier • a772ba41-f72d-4117-9a20-13d141d005b3

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999951R.M.S.E • M.A.E • M.S.E.0.0006 0.0000 0.0036

04/08/2026 09:42

Customer Intelligence • run identifier • fe62fcd6-1adb-4cf1-8b85-4fc0efdd5e8c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9373F1 Score0.8614Precision • Recall0.8294 0.8959

04/08/2026 09:25

Fraud Detection • run identifier • 676121e6-bd74-468d-9148-c8009a8b763e

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9941F1 Score0.9668Precision • Recall1.0000 0.9357

04/08/2026 09:17

Recommendations • run identifier • b5fee91e-69f3-46ab-96ab-b98ba44e43e0

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999962R.M.S.E • M.A.E • M.S.E.0.0012 0.0000 0.0032

04/08/2026 09:01

Customer Intelligence • run identifier • 82d673d2-e2e2-4b19-b751-6a6267449133

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9339F1 Score0.8558Precision • Recall0.8274 0.8863

04/08/2026 08:44

Fraud Detection • run identifier • 36976fff-3627-4beb-abd1-c1ff5316778b

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9963F1 Score0.9708Precision • Recall0.9964 0.9465

04/08/2026 08:36

Recommendations • run identifier • 2945118e-f443-42f1-848d-8f5e21cefc88

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999881R.M.S.E • M.A.E • M.S.E.0.0019 0.0000 0.0056

04/08/2026 08:20

Customer Intelligence • run identifier • c40392b2-2c10-416c-b0e7-3630ebf23528

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9354F1 Score0.8598Precision • Recall0.8409 0.8796

04/08/2026 08:03

Fraud Detection • run identifier • 3ae6ff4a-69ec-494b-a0f5-bd08839679f2

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9943F1 Score0.9685Precision • Recall1.0000 0.9390

04/08/2026 07:55

Recommendations • run identifier • 761ec6f0-4269-4e3d-b3ed-efd98ea46d49

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.994223R.M.S.E • M.A.E • M.S.E.0.0293 0.0015 0.0393

04/08/2026 07:39

Customer Intelligence • run identifier • e132511e-230d-4cc7-bfd1-ff1caa4e8d38

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9372F1 Score0.8605Precision • Recall0.8308 0.8925

04/08/2026 07:22

Fraud Detection • run identifier • 4afd05dc-3d75-4bf8-913c-114b7d63dace

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9963F1 Score0.9760Precision • Recall1.0000 0.9532

04/08/2026 07:14

Recommendations • run identifier • 14b8ae6f-0a32-40bf-9f43-ef1a95428922

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999419R.M.S.E • M.A.E • M.S.E.0.0080 0.0002 0.0125

04/08/2026 06:58

Customer Intelligence • run identifier • 0b69637f-d74c-4f9b-be33-b08e8595a22e

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9338F1 Score0.8588Precision • Recall0.8391 0.8794

04/08/2026 06:41

Fraud Detection • run identifier • e38b15bf-83fb-4a8b-beb8-d3762d7dcfe2

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9954F1 Score0.9758Precision • Recall1.0000 0.9528

04/08/2026 06:33

Recommendations • run identifier • 92f27d0e-27fd-425a-9c48-9267b4164c29

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999886R.M.S.E • M.A.E • M.S.E.0.0026 0.0000 0.0055