DecisionMind Mühürlü, doğrulanabilir reprodüksiyon

Kullanım alanları

DNMA

DNMA - Çift Normalleştirme Tabanlı Çoklu Toplama

Çift normalizasyonlu agregasyon (doğrusal + vektörel)

Formül adımları

Analiz motorunun yöntem bildirimindeki (manifest F.steps) adımlar; raporlardaki formüllerle aynı kaynaktır.

  1. Adım 1 — Üç normalleştirme.

    rij(1)=xij/maxixij;rij(2)=xij/∑ixij2;rij(3)=(xij−minixij)/(maxixij−minixij), direction-adjusted
    LaTeX r^{(1)}_{ij}=x_{ij}/\max_i x_{ij};\quad r^{(2)}_{ij}=x_{ij}/\sqrt{\sum_i x_{ij}^{2}};\quad r^{(3)}_{ij}=(x_{ij}-\min_i x_{ij})/(\max_i x_{ij}-\min_i x_{ij})\text{, direction-adjusted}
  2. Adım 2 — Üç alt-fayda hesaplama.

    ui(1)=∑jwjrij(1),ui(2)=∏j(rij(2))wj,ui(3)=di−/(di++di−)
    LaTeX u^{(1)}_{i}=\sum_j w_jr^{(1)}_{ij},\quad u^{(2)}_{i}=\prod_j(r^{(2)}_{ij})^{w_j},\quad u^{(3)}_{i}=d_i^-/(d_i^++d_i^-)
  3. Adım 3 — Üç sıralama ve sapma ölçüsü.

    Ri(k)=rank(ui(k)); Si(k)=ui(k)−minlul(k)
    LaTeX R^{(k)}_{i}=\text{rank}(u^{(k)}_{i});\ S^{(k)}_{i}=u^{(k)}_{i}-\min_{l} u^{(k)}_{l}
  4. Adım 4 — Birleştirilmiş DNMA skoru.

    Di=∑k=13αk(ui(k))2−∑k=13βk(Ri(k))2
    LaTeX D_{i} = \sum_{k=1}^{3} \alpha_{k}\,(u^{(k)}_{i})^{2} - \sum_{k=1}^{3} \beta_{k}\,(R^{(k)}_{i})^{2}

Yöntem ayrıntıları kaynak kütüphanedeki özgün (İngilizce) metindir.

Sezgi

Dual-normalisation aggregation (linear + vector). Output typically utility (higher value = preferred).

Sonucu okuma: U_i ∈ [0,1] approximately. Higher U means better. DNMA combines two normalisation paradigms - linear (min-max) and vector (Euclidean) - to reduce the influence of any single normalisation method on the ranking. λ=0.5 gives equal weight to both. λ=1 reduces to a min-max SAW; λ=0 gives a vector-normalised SAW.

Varsayımlar

  • Criteria preferences are independent (no synergistic interactions)
  • Compensation is acceptable: high score on one criterion can offset low on another
  • Decision matrix is complete (no missing values)

Ne zaman kullanılmaz

  • Criteria strongly correlated → consider DEMATEL/ANP for interdependence
  • Non-compensatory preferences → consider outranking (ELECTRE/PROMETHEE)

Sınırlılıklar

  • Assumes: Criteria preferences are independent (no synergistic interactions)
  • Assumes: Compensation is acceptable: high score on one criterion can offset low on another
  • Assumes: Decision matrix is complete (no missing values)

Sık yapılan hatalar

  • Sabit kriter sütunu: doğrusal normalleştirme paydası sıfırdır.

Hesap adımları ve dayanakları

  1. Three normalisations: linear-max, vector, and target-based.

    Dayanak: Liao-Wu 2020, p.6 Eqs.(1)-(3)

  2. Three sub-utilities: complete (WSM), incomplete (WPM), and TOPSIS-like.

    Dayanak: Liao-Wu 2020, p.7 Eqs.(4)-(6)

  3. Compute three ranks R^{(k)}_i; deviation measure considers rank spread.

    Dayanak: Liao-Wu 2020, p.8 Eq.(7)

  4. Combined DNMA score D_i = Σ α_k (u^{(k)}_i)^2 − Σ β_k (R^{(k)}_i)^2; descending ranking.

    Dayanak: Liao-Wu 2020, p.8 Eq.(8)