./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

03/28/2026 05:00

run identifier

• b79c8509-df33-4fa3-a323-cb9543caaf36

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9381F1 Score0.8639Precision • Recall0.8384 0.8911

Recommendations

03/28/2026 10:02

run identifier

• cb78f7be-b658-40e5-b07f-1b426f9cee37

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999973R.M.S.E • M.A.E • M.S.E.0.0005 0.0000 0.0027

Fraud Detection

03/28/2026 12:42

run identifier

• baa40f05-6d9b-49d7-93e6-8d21ff8689e8

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9968F1 Score0.9771Precision • Recall1.0000 0.9553
Live Logs

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

run identifier: 0006b44...

🌱 Generating stochastic, realistic synthetic users and activity events

run identifier: 0006b44...

📝 New client data not found

run identifier: 0006b44...

⌕ Checking for new training data

run identifier: 0006b44...

▶ Starting

run identifier: 0006b44...

✔ Completed

run identifier: f9bf911...

💾 Persisting model

run identifier: f9bf911...

🌢 Persisting metrics

run identifier: f9bf911...

ƒ(x) Evaluating

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

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

run identifier: f9bf911...

Workflow History

03/28/2026 11:32

Fraud Detection • run identifier • f9bf9115-d3a8-447b-8c88-c48c6d175ba1

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

03/28/2026 11:24

Recommendations • run identifier • 357f3292-360f-485e-b417-2a696fa95a34

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

03/28/2026 11:08

Customer Intelligence • run identifier • 74305215-faf8-41f9-9a01-43846b533b46

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9371F1 Score0.8606Precision • Recall0.8356 0.8872

03/28/2026 10:51

Fraud Detection • run identifier • 7920fd2f-ac20-4973-911c-93aac58e7b5f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9957F1 Score0.9729Precision • Recall0.9987 0.9484

03/28/2026 10:44

Recommendations • run identifier • fddef909-a706-4014-b153-56d75861928f

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999804R.M.S.E • M.A.E • M.S.E.0.0049 0.0001 0.0073

03/28/2026 10:27

Customer Intelligence • run identifier • 180012c7-f626-4e65-b512-1e518916b621

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9355F1 Score0.8568Precision • Recall0.8352 0.8795

03/28/2026 10:10

Fraud Detection • run identifier • 8297a680-6bcc-47f3-9e27-6eb1345fed48

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

03/28/2026 10:02

Recommendations • run identifier • cb78f7be-b658-40e5-b07f-1b426f9cee37

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999973R.M.S.E • M.A.E • M.S.E.0.0005 0.0000 0.0027

03/28/2026 09:46

Customer Intelligence • run identifier • b84766ee-aa88-4176-8f13-7d204d012a7b

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9358F1 Score0.8580Precision • Recall0.8355 0.8818

03/28/2026 09:29

Fraud Detection • run identifier • afd331a8-a3d1-4886-9194-a9860844e40a

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

03/28/2026 09:22

Recommendations • run identifier • dba77b5f-c652-45bd-aa07-6cc8fcb5620f

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.995449R.M.S.E • M.A.E • M.S.E.0.0254 0.0012 0.0351

03/28/2026 09:05

Customer Intelligence • run identifier • a74505a2-53bd-4fbc-9785-d0de66df93de

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9351F1 Score0.8615Precision • Recall0.8311 0.8942

03/28/2026 08:48

Fraud Detection • run identifier • ee50edc5-8fd9-40d4-b5a8-02f2dc89a2d6

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9945F1 Score0.9673Precision • Recall1.0000 0.9367

03/28/2026 08:41

Recommendations • run identifier • 028870bc-de50-4b24-b08c-1b6a968ebaeb

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999956R.M.S.E • M.A.E • M.S.E.0.0008 0.0000 0.0034

03/28/2026 08:24

Customer Intelligence • run identifier • d5fe632c-5b1d-4978-baee-e19d83b776cc

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9364F1 Score0.8588Precision • Recall0.8339 0.8853

03/28/2026 08:07

Fraud Detection • run identifier • c9e5e799-1f6e-45ec-865e-b1c9a5b1ed4c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9950F1 Score0.9682Precision • Recall0.9983 0.9399

03/28/2026 08:00

Recommendations • run identifier • aa5b9308-075a-4106-9267-f10ff65f425a

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999661R.M.S.E • M.A.E • M.S.E.0.0065 0.0001 0.0096

03/28/2026 07:43

Customer Intelligence • run identifier • c2841fb2-b4df-49fe-ba18-f68a300ff114

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9358F1 Score0.8607Precision • Recall0.8317 0.8919

03/28/2026 07:27

Fraud Detection • run identifier • c8ab77f5-1c11-46ed-9c8f-682c3dfa5c48

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

03/28/2026 07:19

Recommendations • run identifier • 7ef47895-d8ff-4ed0-928d-41788f9ee355

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.0043 0.0000 0.0066

03/28/2026 07:02

Customer Intelligence • run identifier • 08348ba5-7439-46f1-9a5f-01f730a8dae9

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9363F1 Score0.8591Precision • Recall0.8328 0.8870

03/28/2026 06:46

Fraud Detection • run identifier • b31acddc-1862-4a1f-a48a-28fa0e28e71f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9954F1 Score0.9704Precision • Recall0.9991 0.9433

03/28/2026 06:38

Recommendations • run identifier • 78f7039a-97bd-4339-90d2-2a99a0e05eb8

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.0018 0.0000 0.0052

03/28/2026 06:21

Customer Intelligence • run identifier • 02297f7d-c1b7-460a-8035-1a9236c72679

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9347F1 Score0.8570Precision • Recall0.8315 0.8841

03/28/2026 06:05

Fraud Detection • run identifier • c502922a-2b45-4036-8e57-05fe18e539f7

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9963F1 Score0.9727Precision • Recall0.9938 0.9524

03/28/2026 05:57

Recommendations • run identifier • f8443c80-addf-4f7b-9713-48b48c202b63

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.975784R.M.S.E • M.A.E • M.S.E.0.0617 0.0065 0.0808

03/28/2026 05:40

Customer Intelligence • run identifier • 3137f76c-0a0e-408c-bed1-988ba6f9e9d4

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9373F1 Score0.8566Precision • Recall0.8363 0.8779

03/28/2026 05:24

Fraud Detection • run identifier • 1f20053a-422a-41c5-8cac-002e59faed22

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

03/28/2026 05:16

Recommendations • run identifier • c2c084d1-e2a6-4e81-be65-bbbd0dcf6164

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.988339R.M.S.E • M.A.E • M.S.E.0.0429 0.0032 0.0564

03/28/2026 05:00

Customer Intelligence • run identifier • b79c8509-df33-4fa3-a323-cb9543caaf36

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9381F1 Score0.8639Precision • Recall0.8384 0.8911

03/28/2026 04:41

Fraud Detection • run identifier • 3f6b0742-3b44-43b0-9145-9f52b5e4a483

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9951F1 Score0.9693Precision • Recall1.0000 0.9405

03/28/2026 04:33

Recommendations • run identifier • 600cd8ec-ad3f-467d-bcf2-f81c228672f8

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

03/28/2026 04:17

Customer Intelligence • run identifier • c9c44570-8916-45a6-b341-cf3d88a1ffa6

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9367F1 Score0.8603Precision • Recall0.8346 0.8877

03/28/2026 02:20

Customer Intelligence • run identifier • e1869e74-eb0c-4c92-a590-e6b006e555d0

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9374F1 Score0.8587Precision • Recall0.8323 0.8869

03/28/2026 02:03

Fraud Detection • run identifier • afedcd0c-2eaf-4f52-a95e-e99eff548b13

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9958F1 Score0.9705Precision • Recall1.0000 0.9427

03/28/2026 01:56

Recommendations • run identifier • a3ae8aac-8bb8-40dc-bdc7-0a441dad9d6e

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.0015 0.0000 0.0033

03/28/2026 01:39

Customer Intelligence • run identifier • 6ac7383b-8107-4a06-8d21-6ba6e45bb237

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9379F1 Score0.8596Precision • Recall0.8350 0.8857

03/28/2026 01:23

Fraud Detection • run identifier • 2ab3377d-38c9-4134-b63e-634daa0e67f5

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9942F1 Score0.9677Precision • Recall1.0000 0.9374

03/28/2026 01:15

Recommendations • run identifier • a33c952a-37d9-4b2a-905e-141510109113

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

03/28/2026 12:58

Customer Intelligence • run identifier • 2d2a5bd5-a120-49d7-9a3c-357a1ec522b1

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

03/28/2026 12:42

Fraud Detection • run identifier • baa40f05-6d9b-49d7-93e6-8d21ff8689e8

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

03/28/2026 12:34

Recommendations • run identifier • a81d11bd-4435-4b7f-9d00-14f891d9369f

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.997914R.M.S.E • M.A.E • M.S.E.0.0167 0.0006 0.0240

03/28/2026 12:17

Customer Intelligence • run identifier • 759c2f25-9da7-4627-994d-af49c616b72b

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9350F1 Score0.8596Precision • Recall0.8298 0.8917

03/28/2026 12:01

Fraud Detection • run identifier • 0b1ed9ec-7721-4109-a851-ccba58ca0f78

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9961F1 Score0.9733Precision • Recall0.9961 0.9515

03/27/2026 11:53

Recommendations • run identifier • 861519c9-910e-4e4a-b381-f55d7dafe347

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.995612R.M.S.E • M.A.E • M.S.E.0.0269 0.0012 0.0341

03/27/2026 11:36

Customer Intelligence • run identifier • 70fd7863-c3f5-45ca-916d-d7d8ed2c0392

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9382F1 Score0.8573Precision • Recall0.8381 0.8775

03/27/2026 11:20

Fraud Detection • run identifier • 98da6b47-6831-4786-ab4c-14b42de1e49b

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

03/27/2026 11:12

Recommendations • run identifier • 797cdb99-e02f-4ef5-b8bc-2aa9ccd8d431

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.996796R.M.S.E • M.A.E • M.S.E.0.0205 0.0008 0.0290

03/27/2026 10:55

Customer Intelligence • run identifier • 8bf8dd59-4dd0-403e-adca-fe00b1056726

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9359F1 Score0.8602Precision • Recall0.8331 0.8891

03/27/2026 10:39

Fraud Detection • run identifier • bd191070-d643-4cde-98f9-3ae300dacddc

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9958F1 Score0.9709Precision • Recall0.9995 0.9438

03/27/2026 10:31

Recommendations • run identifier • c02bdbc3-0f90-4c1f-8d1f-f55d103cb0cc

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999657R.M.S.E • M.A.E • M.S.E.0.0060 0.0001 0.0096

03/27/2026 10:14

Customer Intelligence • run identifier • c666e2f5-7f87-4871-9296-92164e16712c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9351F1 Score0.8556Precision • Recall0.8337 0.8787

03/27/2026 09:58

Fraud Detection • run identifier • d9b180ec-b648-42e0-9f1c-fe6326218b2b

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9952F1 Score0.9704Precision • Recall0.9927 0.9491

03/27/2026 09:50

Recommendations • run identifier • e27a7ef7-d3c1-4067-8688-576d805dff74

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.998773R.M.S.E • M.A.E • M.S.E.0.0124 0.0003 0.0180

03/27/2026 09:34

Customer Intelligence • run identifier • 9b5f3e8d-54a1-457f-9fb7-5ff73ae88cfd

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9370F1 Score0.8595Precision • Recall0.8368 0.8835

03/27/2026 09:17

Fraud Detection • run identifier • e59b5dcf-0343-4f71-962c-c9cc0025a64d

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

03/27/2026 09:09

Recommendations • run identifier • 1c051259-575d-4773-bfe4-63003f5833ba

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

03/27/2026 08:53

Customer Intelligence • run identifier • d3a6afa2-105c-4f16-a81e-9461207b1e81

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9370F1 Score0.8590Precision • Recall0.8317 0.8882

03/27/2026 08:36

Fraud Detection • run identifier • 5c1c37fd-fe25-4818-a780-e826f622deca

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9946F1 Score0.9730Precision • Recall1.0000 0.9475

03/27/2026 08:28

Recommendations • run identifier • e25e57d8-bc52-4a1b-bf7a-caeb62239e41

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.976882R.M.S.E • M.A.E • M.S.E.0.0593 0.0061 0.0783

03/27/2026 08:12

Customer Intelligence • run identifier • fbd80ca5-bd0b-47b8-b1a4-821a62435d09

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9351F1 Score0.8579Precision • Recall0.8355 0.8817

03/27/2026 07:55

Fraud Detection • run identifier • ce382ded-77dd-456d-b71b-35f04423bae8

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9961F1 Score0.9712Precision • Recall1.0000 0.9440

03/27/2026 07:47

Recommendations • run identifier • cef53302-21a1-43a1-9802-ef54f03fb623

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999871R.M.S.E • M.A.E • M.S.E.0.0032 0.0000 0.0059

03/27/2026 07:31

Customer Intelligence • run identifier • acd7b625-0305-4597-af8a-c853d6f1c2b4

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9341F1 Score0.8568Precision • Recall0.8213 0.8955

03/27/2026 07:14

Fraud Detection • run identifier • 5e6bf6a9-cf37-46a3-a1e9-c5b0f34e8b8c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9949F1 Score0.9698Precision • Recall1.0000 0.9414

03/27/2026 07:06

Recommendations • run identifier • 32a765ef-796e-4321-8dfd-de0a1dee1ed7

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

03/27/2026 06:50

Customer Intelligence • run identifier • 67123524-92f7-4e63-a8cf-039bd4b35f61

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9377F1 Score0.8609Precision • Recall0.8353 0.8880

03/27/2026 06:33

Fraud Detection • run identifier • 2d48ba23-f503-4aa4-a89a-35585e5acb90

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9954F1 Score0.9690Precision • Recall0.9952 0.9442

03/27/2026 06:26

Recommendations • run identifier • 4b53505d-9254-4349-8c69-79727b6528e0

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999859R.M.S.E • M.A.E • M.S.E.0.0034 0.0000 0.0061

03/27/2026 06:09

Customer Intelligence • run identifier • 82c7481f-5de0-4e30-a8d7-279e0f7156d6

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9334F1 Score0.8577Precision • Recall0.8277 0.8899

03/27/2026 05:52

Fraud Detection • run identifier • ff49f9dd-290c-4a79-93e0-421541f04648

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

03/27/2026 05:45

Recommendations • run identifier • ff1cee5e-20c1-4aa0-9f7c-62b2a34198de

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

03/27/2026 05:28

Customer Intelligence • run identifier • 6b0217a5-f5e2-4820-b873-1ed8df9bba9c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9370F1 Score0.8640Precision • Recall0.8341 0.8961

03/27/2026 05:11

Fraud Detection • run identifier • 8bb0d7e3-9ee9-47ce-921f-7b2658b0e61a

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

03/27/2026 05:04

Recommendations • run identifier • 900d7e2b-df35-4cb1-a829-9c4c2cd0cb98

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.997634R.M.S.E • M.A.E • M.S.E.0.0164 0.0006 0.0251

03/27/2026 04:47

Customer Intelligence • run identifier • ff6267fc-86e1-42c2-aee6-47955d0856f6

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9333F1 Score0.8555Precision • Recall0.8312 0.8812

03/27/2026 04:31

Fraud Detection • run identifier • e4e148f3-c7b8-42d4-b97a-ae2647e7c0de

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9958F1 Score0.9725Precision • Recall1.0000 0.9465

03/27/2026 04:23

Recommendations • run identifier • f63f59f1-19b8-4623-9ac4-ed9223bf693e

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.0035 0.0000 0.0066

03/27/2026 04:06

Customer Intelligence • run identifier • 84abea85-2ee0-4d51-8350-f1cce0b94feb

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9377F1 Score0.8614Precision • Recall0.8382 0.8860

03/27/2026 03:50

Fraud Detection • run identifier • 1256f6d6-3754-4930-8998-d2f019c734c5

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

03/27/2026 03:42

Recommendations • run identifier • 574bb0bd-ac2b-480d-b136-b744d70ad60c

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.995519R.M.S.E • M.A.E • M.S.E.0.0261 0.0012 0.0348

03/27/2026 03:26

Customer Intelligence • run identifier • cf553e0c-79ce-4123-a2b0-324bb321b104

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9384F1 Score0.8602Precision • Recall0.8337 0.8885

03/27/2026 03:09

Fraud Detection • run identifier • d644afc0-d470-4ba9-8cf6-03d787e91286

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9958F1 Score0.9717Precision • Recall1.0000 0.9450

03/27/2026 03:01

Recommendations • run identifier • 71c77f30-3fde-4175-9eb8-b85013f9c786

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.997512R.M.S.E • M.A.E • M.S.E.0.0176 0.0007 0.0258

03/27/2026 02:45

Customer Intelligence • run identifier • 7eeaa686-7a47-4141-95ec-fedf9d57cac1

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9370F1 Score0.8561Precision • Recall0.8360 0.8772

03/27/2026 02:28

Fraud Detection • run identifier • 3e55120f-11f9-4297-b1a3-4c4e0bae0841

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9964F1 Score0.9725Precision • Recall0.9994 0.9469

03/27/2026 02:20

Recommendations • run identifier • e385c81e-3119-4cd7-b5e5-1333de885c28

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.0014 0.0000 0.0036

03/27/2026 02:04

Customer Intelligence • run identifier • 9e925451-5df6-4c56-b176-9cf468313f32

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9375F1 Score0.8604Precision • Recall0.8384 0.8835

03/27/2026 01:47

Fraud Detection • run identifier • aa1b0688-71e7-4d54-b653-bb2d61a5c5dc

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9946F1 Score0.9692Precision • Recall1.0000 0.9402

03/27/2026 01:39

Recommendations • run identifier • 747d41ea-a6fb-4cb9-8dc1-3564c33de91b

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.991699R.M.S.E • M.A.E • M.S.E.0.0333 0.0022 0.0472

03/27/2026 01:23

Customer Intelligence • run identifier • 7a1face0-2eda-4d94-98ff-6d028c124596

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9344F1 Score0.8587Precision • Recall0.8293 0.8901

03/27/2026 01:06

Fraud Detection • run identifier • 23da59ac-c981-4998-a8c0-044668e81bb9

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9959F1 Score0.9734Precision • Recall1.0000 0.9483

03/27/2026 12:59

Recommendations • run identifier • b743adcb-2fd7-495e-a4b7-de74c9287232

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999731R.M.S.E • M.A.E • M.S.E.0.0059 0.0001 0.0085

03/27/2026 12:42

Customer Intelligence • run identifier • d97b047c-bd16-4420-ab5a-443f6247643e

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9377F1 Score0.8592Precision • Recall0.8318 0.8885

03/27/2026 12:23

Fraud Detection • run identifier • 0485f7f0-aca0-4c8d-aed2-dd4e04708f6a

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

03/27/2026 12:16

Recommendations • run identifier • b35feb84-d13b-4e46-96b3-08daf7e31ecf

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.986144R.M.S.E • M.A.E • M.S.E.0.0464 0.0037 0.0611

03/27/2026 11:59

Customer Intelligence • run identifier • d613c15d-2b83-4b69-b435-f547cb6e2b68

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9357F1 Score0.8609Precision • Recall0.8377 0.8854

03/27/2026 09:40

Fraud Detection • run identifier • e15f9e30-061a-4203-af4f-c7bc4252097a

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

03/27/2026 09:32

Recommendations • run identifier • 39f375c2-778e-4f00-aeb2-3e0d5110d64a

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

03/27/2026 09:15

Customer Intelligence • run identifier • 9b007854-632a-49bc-937c-c36117d8287c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9344F1 Score0.8585Precision • Recall0.8310 0.8878

03/27/2026 08:39

Fraud Detection • run identifier • 9d21f64e-44d2-42e8-8c76-afa8c685a82c

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

03/27/2026 08:32

Recommendations • run identifier • d7258626-3623-492b-a6a1-c9c377451b02

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999370R.M.S.E • M.A.E • M.S.E.0.0089 0.0002 0.0130

03/27/2026 08:15

Customer Intelligence • run identifier • 52f2ff1c-5d72-456e-993f-45e3fa575568

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9368F1 Score0.8573Precision • Recall0.8390 0.8764

03/27/2026 07:58

Fraud Detection • run identifier • 42e6a282-8e4a-44e1-87b9-bde67424c25a

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9950F1 Score0.9722Precision • Recall1.0000 0.9459

03/27/2026 07:50

Recommendations • run identifier • 847d60ba-8b2f-410d-ac2b-77a25e0a6644

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999784R.M.S.E • M.A.E • M.S.E.0.0049 0.0001 0.0077

03/27/2026 07:34

Customer Intelligence • run identifier • 283205ad-3643-42cc-b239-fee0ed59d693

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9375F1 Score0.8611Precision • Recall0.8355 0.8883

03/27/2026 07:17

Fraud Detection • run identifier • 227a862a-5792-4c32-a2db-db16bfcc3400

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9959F1 Score0.9725Precision • Recall0.9958 0.9504

03/27/2026 07:09

Recommendations • run identifier • 80bbac55-1b9a-4b63-91e7-342984d786a5

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.991744R.M.S.E • M.A.E • M.S.E.0.0340 0.0022 0.0473

03/27/2026 06:53

Customer Intelligence • run identifier • 2aff9d0d-2394-4757-8bfa-43fe9da87091

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9340F1 Score0.8543Precision • Recall0.8298 0.8802

03/27/2026 06:36

Fraud Detection • run identifier • 3ea80a98-3855-49b4-ae58-166549e2f4d2

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

03/27/2026 06:28

Recommendations • run identifier • c5d0894f-fb78-41b0-9a5e-bcf42d6657b4

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.995351R.M.S.E • M.A.E • M.S.E.0.0260 0.0013 0.0356

03/27/2026 06:12

Customer Intelligence • run identifier • aab76270-32b0-4424-970c-5c5226fe289b

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9287F1 Score0.8524Precision • Recall0.8326 0.8731

03/27/2026 05:55

Fraud Detection • run identifier • 8e1ca617-bbda-47ce-958d-4f5672a14786

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

03/27/2026 05:47

Recommendations • run identifier • da231ce4-335d-4d69-ad6e-f07d58e481c2

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999877R.M.S.E • M.A.E • M.S.E.0.0033 0.0000 0.0058

03/27/2026 05:30

Customer Intelligence • run identifier • 6161ece0-9960-462c-9deb-98e130b5aeb3

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9337F1 Score0.8556Precision • Recall0.8245 0.8892

03/27/2026 05:14

Fraud Detection • run identifier • 8bd038a3-bdef-45dc-9013-248196bf5b0c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9951F1 Score0.9701Precision • Recall1.0000 0.9419

03/27/2026 05:06

Recommendations • run identifier • 59524d1c-856a-42c9-8e76-ba854c90ab9a

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

03/27/2026 04:49

Customer Intelligence • run identifier • f29797df-d3eb-4e7f-96e8-b9bfc24ba797

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9369F1 Score0.8617Precision • Recall0.8383 0.8864

03/27/2026 04:32

Fraud Detection • run identifier • 07c9b1ac-92a1-495c-a24a-694dc2a0c3e6

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryA.U.C.0.9971F1 Score0.9747Precision • Recall0.9891 0.9606

03/27/2026 04:25

Recommendations • run identifier • bec31fa6-4fc0-43b0-a3a2-92d7d41e6235

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.999822R.M.S.E • M.A.E • M.S.E.0.0041 0.0000 0.0069

03/27/2026 04:08

Customer Intelligence • run identifier • cc206dc6-82de-4b7b-859e-f11b3736621c

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9333F1 Score0.8556Precision • Recall0.8228 0.8910

03/27/2026 03:52

Fraud Detection • run identifier • 0ec27018-708d-483f-bc1c-92ea23e0599d

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryA.U.C.0.9958F1 Score0.9759Precision • Recall1.0000 0.9529

03/27/2026 03:44

Recommendations • run identifier • b436e2fd-0d5e-4fbe-b99c-b93b31558050

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Tree RegressionR²0.999846R.M.S.E • M.A.E • M.S.E.0.0039 0.0000 0.0065

03/27/2026 03:27

Customer Intelligence • run identifier • 70ce5451-a501-4b47-a83c-8b227a4e3bec

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9327F1 Score0.8588Precision • Recall0.8255 0.8948

03/27/2026 03:11

Fraud Detection • run identifier • 16421fdd-bddb-4dea-9bb8-cb8c3f05c134

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

03/27/2026 03:03

Recommendations • run identifier • c8a5969a-eeb4-451a-9243-83a351491636

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.967550R.M.S.E • M.A.E • M.S.E.0.0772 0.0089 0.0941

03/27/2026 02:46

Customer Intelligence • run identifier • 9e3f361b-f210-40c1-b96b-d743c346cff3

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Forest BinaryK-Means++A.U.C.0.9364F1 Score0.8572Precision • Recall0.8326 0.8832

03/27/2026 02:30

Fraud Detection • run identifier • 92177770-9217-4e65-9649-360b3df8a011

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

03/27/2026 02:22

Recommendations • run identifier • 4d578408-0f37-4973-99d5-21f4892cc9d3

Algorithm(s)
R²
R.M.S.E • M.A.E • M.S.E.
Algorithm(s)Fast Forest RegressionR²0.993112R.M.S.E • M.A.E • M.S.E.0.0312 0.0019 0.0435

03/27/2026 02:05

Customer Intelligence • run identifier • 14d5d81c-a92c-49a6-93d7-f6ce91f2d795

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9351F1 Score0.8588Precision • Recall0.8387 0.8798

03/27/2026 01:49

Fraud Detection • run identifier • 4d8949f6-06d6-40c6-b90d-c9ab6edba263

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

03/27/2026 01:41

Recommendations • run identifier • 48c35051-6fe7-4d41-aaf5-c9a3b89c6189

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

03/27/2026 01:24

Customer Intelligence • run identifier • f49dc6cd-3d81-4b40-b383-de49d5b9a65f

Algorithm(s)
A.U.C.
F1 Score
Precision • Recall
Algorithm(s)Fast Tree BinaryK-Means++A.U.C.0.9368F1 Score0.8613Precision • Recall0.8312 0.8936