Files

T

koriweb d8a80f6272 chore(wiki): dangling 링크 canonical 정규화 (768파일/1200건)

이름만 다른(표기 변형) [[위키링크]]를 대상 문서의 canonical 제목으로 치환해
끊겼던 1,200개 링크를 연결. 제목/파일명 정규화 일치만 적용하고 별칭 매칭은
과병합 위험으로 제외(애매성 가드). 원본은 _link_reconcile_backup/ 에 백업.
도구: Datacollect/scripts/link_reconcile_apply.mjs

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>

2026-06-08 12:24:15 +09:00

4.2 KiB

Raw Blame History

id, title, category, status, canonical_id, aliases, duplicate_of, source_trust_level, confidence_score, verification_status, tags, raw_sources, last_reinforced, github_commit, tech_stack

title

Mutually Exclusive and Collectively Exhaustive (MECE)

매 한 줄

"매 항목 겹치지 않고 매 합쳐 전체". Barbara Minto가 McKinsey에서 정형화한 매 categorization 원칙으로, 매 합리적 의사소통과 매 logical decomposition의 매 backbone이다. 2026 LLM agent의 task partitioning에서도 매 동일 원칙이 적용된다.

매 핵심

매 두 조건

Mutually Exclusive (ME): 매 두 카테고리의 교집합 = ∅.
Collectively Exhaustive (CE): 매 카테고리들의 합집합 = 전체.

매 typical partition 패턴

Binary split: A vs Not-A.
Process steps: Before / During / After.
Stakeholders: Internal / External.
Time: Past / Present / Future.
Quantitative axes: Price × Volume = Revenue.

매 응용

Issue tree / logic tree decomposition.
Market sizing (top-down vs bottom-up).
SQL GROUP BY 카테고리 설계.
LLM agent subtask split (no overlap, no gap).

💻 패턴

MECE check (Python)

def is_mece(categories, universe):
    union = set().union(*categories)
    if union != universe:
        return False, "not exhaustive", universe - union
    for i, a in enumerate(categories):
        for b in categories[i+1:]:
            if a & b:
                return False, "overlap", a & b
    return True, "MECE", None

Decision-tree style decomposition

- 매출 감소 원인
  - 가격 (P)
  - 수량 (Q) [P와 ME — 가격 효과 통제 후]
  - 믹스 (M) [구성 변화]
  → P + Q + M ≈ ΔRevenue (CE check)

Pandas group MECE validation

def validate_mece_groups(df, group_col, total_col):
    grouped = df.groupby(group_col)[total_col].sum()
    return abs(grouped.sum() - df[total_col].sum()) < 1e-6

Set cover (greedy CE construction)

def greedy_cover(universe, sets):
    chosen, remaining = [], set(universe)
    while remaining:
        best = max(sets, key=lambda s: len(s & remaining))
        chosen.append(best)
        remaining -= best
    return chosen

LLM prompt for MECE plan

prompt = """
Decompose the task into MECE subtasks:
- Subtasks must NOT overlap (ME).
- Subtasks must cover the full task (CE).
- Output JSON list. Verify by sketching the union set.
Task: {task}
"""

MECE + Pareto (80/20 prioritization)

def mece_pareto(buckets, values, top=0.8):
    sorted_buckets = sorted(zip(buckets, values), key=lambda x: -x[1])
    cum, picked = 0, []
    for b, v in sorted_buckets:
        picked.append(b); cum += v
        if cum >= top * sum(values): break
    return picked

매 결정 기준

상황	Decomposition axis
Revenue analysis	P × Q × M
Cost analysis	Fixed vs Variable
Customer	New vs Existing
Process	Stage gates
Bug triage	Severity × Component

기본값: Quantitative MECE (numerical sum-check 가능).

🔗 Graph

🤖 LLM 활용

언제: Task decomposition, structured analysis, taxonomy design, agent planning. 언제 X: Highly entangled / coupled systems where clean partition is impossible.

❌ 안티패턴

Pseudo-MECE: 매 표면 MECE이나 매 실제 overlap.
Forced exhaustiveness: "Other" 버킷으로 매 모든 잔여 처리.
Wrong axis: 매 분석 목적과 무관한 축.

🧪 검증 / 중복

Verified (Minto "The Pyramid Principle"; Rasiel "The McKinsey Way").
신뢰도 A.

🕓 Changelog

날짜	변경
2026-05-08	Phase 1
2026-05-10	Manual cleanup — MECE conditions + validators

4.2 KiB Raw Blame History Unescape Escape