memento-mcp-server 1.6.0 → 1.7.1

package/dist/services/spaced-repetition/performance-analysis.service.js

@@ -0,0 +1,174 @@
+/**
+ * 성과 분석 서비스
+ * 단일 책임 원칙 (SRP) 적용
+ */
+/**
+ * 기본 성과 분석기
+ */
+export class DefaultPerformanceAnalyzer {
+    analyzeReviewPerformance(schedules, actualRecall) {
+        const totalMemories = schedules.length;
+        const reviewedMemories = schedules.filter(s => s.needs_review).length;
+        let totalRecallRate = 0;
+        let recallCount = 0;
+        const performanceByInterval = new Map();
+        for (const schedule of schedules) {
+            if (actualRecall.has(schedule.memory_id)) {
+                const recalled = actualRecall.get(schedule.memory_id);
+                totalRecallRate += recalled ? 1 : 0;
+                recallCount++;
+                const interval = Math.floor(schedule.current_interval / 7) * 7; // 주 단위로 그룹화
+                const current = performanceByInterval.get(interval) || { total: 0, successful: 0 };
+                current.total++;
+                if (recalled)
+                    current.successful++;
+                performanceByInterval.set(interval, current);
+            }
+        }
+        const averageRecallRate = recallCount > 0 ? totalRecallRate / recallCount : 0;
+        // 간격별 성과 계산
+        const performanceByIntervalRate = new Map();
+        for (const [interval, stats] of performanceByInterval) {
+            performanceByIntervalRate.set(interval, stats.successful / stats.total);
+        }
+        return {
+            totalMemories,
+            reviewedMemories,
+            averageRecallRate,
+            performanceByInterval: performanceByIntervalRate
+        };
+    }
+}
+/**
+ * 상세 성과 분석기
+ * 더 세밀한 성과 지표 제공
+ */
+export class DetailedPerformanceAnalyzer {
+    analyzeReviewPerformance(schedules, actualRecall) {
+        const baseAnalysis = new DefaultPerformanceAnalyzer()
+            .analyzeReviewPerformance(schedules, actualRecall);
+        // 추가 분석 수행
+        this.analyzePerformanceTrends(schedules, actualRecall);
+        this.analyzeIntervalEffectiveness(schedules, actualRecall);
+        return baseAnalysis;
+    }
+    analyzePerformanceTrends(schedules, actualRecall) {
+        // 성과 트렌드 분석 로직
+        const weeklyPerformance = this.calculateWeeklyPerformance(schedules, actualRecall);
+        const trendDirection = this.calculateTrendDirection(weeklyPerformance);
+        console.log(`성과 트렌드: ${trendDirection}`);
+    }
+    analyzeIntervalEffectiveness(schedules, actualRecall) {
+        // 간격별 효과성 분석 로직
+        const intervalEffectiveness = this.calculateIntervalEffectiveness(schedules, actualRecall);
+        console.log('간격별 효과성:', intervalEffectiveness);
+    }
+    calculateWeeklyPerformance(schedules, actualRecall) {
+        // 주별 성과 계산 로직
+        return [];
+    }
+    calculateTrendDirection(weeklyPerformance) {
+        if (weeklyPerformance.length < 2)
+            return '데이터 부족';
+        const recent = weeklyPerformance.slice(-2);
+        if (recent.length < 2)
+            return '데이터 부족';
+        if ((recent[1] || 0) > (recent[0] || 0))
+            return '상승';
+        if ((recent[1] || 0) < (recent[0] || 0))
+            return '하락';
+        return '안정';
+    }
+    calculateIntervalEffectiveness(schedules, actualRecall) {
+        const effectiveness = new Map();
+        for (const schedule of schedules) {
+            if (actualRecall.has(schedule.memory_id)) {
+                const recalled = actualRecall.get(schedule.memory_id);
+                const interval = schedule.current_interval;
+                const current = effectiveness.get(interval) || { total: 0, successful: 0 };
+                current.total++;
+                if (recalled)
+                    current.successful++;
+                effectiveness.set(interval, current);
+            }
+        }
+        const result = new Map();
+        for (const [interval, stats] of effectiveness) {
+            result.set(interval, stats.successful / stats.total);
+        }
+        return result;
+    }
+}
+/**
+ * 적응형 성과 분석기
+ * 학습자의 성과 패턴을 학습하여 분석 개선
+ */
+export class AdaptivePerformanceAnalyzer {
+    learningPatterns = new Map();
+    performanceThresholds = new Map();
+    analyzeReviewPerformance(schedules, actualRecall) {
+        const baseAnalysis = new DefaultPerformanceAnalyzer()
+            .analyzeReviewPerformance(schedules, actualRecall);
+        // 적응형 분석 수행
+        this.updateLearningPatterns(schedules, actualRecall);
+        this.adjustPerformanceThresholds();
+        return baseAnalysis;
+    }
+    updateLearningPatterns(schedules, actualRecall) {
+        for (const schedule of schedules) {
+            if (actualRecall.has(schedule.memory_id)) {
+                const recalled = actualRecall.get(schedule.memory_id);
+                const performance = recalled ? 1 : 0;
+                const pattern = this.learningPatterns.get(schedule.memory_id) || [];
+                pattern.push(performance);
+                // 최근 30개 기록만 유지
+                if (pattern.length > 30) {
+                    pattern.shift();
+                }
+                this.learningPatterns.set(schedule.memory_id, pattern);
+            }
+        }
+    }
+    adjustPerformanceThresholds() {
+        for (const [memoryId, pattern] of this.learningPatterns) {
+            if (pattern.length >= 10) {
+                const averagePerformance = pattern.reduce((sum, perf) => sum + perf, 0) / pattern.length;
+                this.performanceThresholds.set(memoryId, averagePerformance);
+            }
+        }
+    }
+    getPersonalizedThreshold(memoryId) {
+        return this.performanceThresholds.get(memoryId) || 0.7;
+    }
+}
+/**
+ * 예측 성과 분석기
+ * 머신러닝 기반 성과 예측
+ */
+export class PredictivePerformanceAnalyzer {
+    predictionModel = new Map();
+    analyzeReviewPerformance(schedules, actualRecall) {
+        const baseAnalysis = new DefaultPerformanceAnalyzer()
+            .analyzeReviewPerformance(schedules, actualRecall);
+        // 예측 분석 수행
+        this.predictPerformance(schedules);
+        return baseAnalysis;
+    }
+    predictPerformance(schedules) {
+        for (const schedule of schedules) {
+            const predictedPerformance = this.calculatePredictedPerformance(schedule);
+            this.predictionModel.set(schedule.memory_id, predictedPerformance);
+        }
+    }
+    calculatePredictedPerformance(schedule) {
+        // 간단한 예측 모델 (실제로는 더 복잡한 ML 모델 사용)
+        const baseScore = schedule.recall_probability;
+        const intervalFactor = Math.log(schedule.current_interval + 1) / 10;
+        const multiplierFactor = Math.abs(schedule.multiplier - 1) / 2;
+        return Math.max(0, Math.min(1, baseScore + intervalFactor - multiplierFactor));
+    }
+    getPredictedPerformance(memoryId) {
+        return this.predictionModel.get(memoryId) || 0.5;
+    }
+}
+//# sourceMappingURL=performance-analysis.service.js.map

package/dist/services/spaced-repetition/performance-analysis.service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"performance-analysis.service.js","sourceRoot":"","sources":["../../../src/services/spaced-repetition/performance-analysis.service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH;;GAEG;AACH,MAAM,OAAO,0BAA0B;IACrC,wBAAwB,CACtB,SAA2B,EAC3B,YAAkC;QAElC,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC;QACvC,MAAM,gBAAgB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC;QAEtE,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,qBAAqB,GAAG,IAAI,GAAG,EAAiD,CAAC;QAEvF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzC,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAE,CAAC;gBACvD,eAAe,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,WAAW,EAAE,CAAC;gBAEd,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY;gBAC5E,MAAM,OAAO,GAAG,qBAAqB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;gBACnF,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChB,IAAI,QAAQ;oBAAE,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,qBAAqB,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,MAAM,iBAAiB,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,YAAY;QACZ,MAAM,yBAAyB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5D,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,qBAAqB,EAAE,CAAC;YACtD,yBAAyB,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1E,CAAC;QAED,OAAO;YACL,aAAa;YACb,gBAAgB;YAChB,iBAAiB;YACjB,qBAAqB,EAAE,yBAAyB;SACjD,CAAC;IACJ,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,2BAA2B;IACtC,wBAAwB,CACtB,SAA2B,EAC3B,YAAkC;QAElC,MAAM,YAAY,GAAG,IAAI,0BAA0B,EAAE;aAClD,wBAAwB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAErD,WAAW;QACX,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QACvD,IAAI,CAAC,4BAA4B,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAE3D,OAAO,YAAY,CAAC;IACtB,CAAC;IAEO,wBAAwB,CAC9B,SAA2B,EAC3B,YAAkC;QAElC,eAAe;QACf,MAAM,iBAAiB,GAAG,IAAI,CAAC,0BAA0B,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QACnF,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,CAAC,CAAC;QAEvE,OAAO,CAAC,GAAG,CAAC,WAAW,cAAc,EAAE,CAAC,CAAC;IAC3C,CAAC;IAEO,4BAA4B,CAClC,SAA2B,EAC3B,YAAkC;QAElC,gBAAgB;QAChB,MAAM,qBAAqB,GAAG,IAAI,CAAC,8BAA8B,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAE3F,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,qBAAqB,CAAC,CAAC;IACjD,CAAC;IAEO,0BAA0B,CAChC,SAA2B,EAC3B,YAAkC;QAElC,cAAc;QACd,OAAO,EAAE,CAAC;IACZ,CAAC;IAEO,uBAAuB,CAAC,iBAA2B;QACzD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,QAAQ,CAAC;QAElD,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,QAAQ,CAAC;QACvC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,8BAA8B,CACpC,SAA2B,EAC3B,YAAkC;QAElC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAiD,CAAC;QAE/E,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzC,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAE,CAAC;gBACvD,MAAM,QAAQ,GAAG,QAAQ,CAAC,gBAAgB,CAAC;gBAE3C,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;gBAC3E,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChB,IAAI,QAAQ;oBAAE,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9C,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACvD,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,2BAA2B;IAC9B,gBAAgB,GAA0B,IAAI,GAAG,EAAE,CAAC;IACpD,qBAAqB,GAAwB,IAAI,GAAG,EAAE,CAAC;IAE/D,wBAAwB,CACtB,SAA2B,EAC3B,YAAkC;QAElC,MAAM,YAAY,GAAG,IAAI,0BAA0B,EAAE;aAClD,wBAAwB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAErD,YAAY;QACZ,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QACrD,IAAI,CAAC,2BAA2B,EAAE,CAAC;QAEnC,OAAO,YAAY,CAAC;IACtB,CAAC;IAEO,sBAAsB,CAC5B,SAA2B,EAC3B,YAAkC;QAElC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzC,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAE,CAAC;gBACvD,MAAM,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAErC,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;gBACpE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAE1B,gBAAgB;gBAChB,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;oBACxB,OAAO,CAAC,KAAK,EAAE,CAAC;gBAClB,CAAC;gBAED,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IAEO,2BAA2B;QACjC,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACxD,IAAI,OAAO,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;gBACzB,MAAM,kBAAkB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;gBACzF,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;IACH,CAAC;IAED,wBAAwB,CAAC,QAAgB;QACvC,OAAO,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;IACzD,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,6BAA6B;IAChC,eAAe,GAAwB,IAAI,GAAG,EAAE,CAAC;IAEzD,wBAAwB,CACtB,SAA2B,EAC3B,YAAkC;QAElC,MAAM,YAAY,GAAG,IAAI,0BAA0B,EAAE;aAClD,wBAAwB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAErD,WAAW;QACX,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAEnC,OAAO,YAAY,CAAC;IACtB,CAAC;IAEO,kBAAkB,CAAC,SAA2B;QACpD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,oBAAoB,GAAG,IAAI,CAAC,6BAA6B,CAAC,QAAQ,CAAC,CAAC;YAC1E,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,oBAAoB,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAEO,6BAA6B,CAAC,QAAwB;QAC5D,kCAAkC;QAClC,MAAM,SAAS,GAAG,QAAQ,CAAC,kBAAkB,CAAC;QAC9C,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACpE,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAE/D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,cAAc,GAAG,gBAAgB,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,uBAAuB,CAAC,QAAgB;QACtC,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;IACnD,CAAC;CACF"}

package/dist/services/spaced-repetition/priority-calculation.service.d.ts

@@ -0,0 +1,53 @@
+/**
+ * 우선순위 계산 서비스
+ * 단일 책임 원칙 (SRP) 적용
+ */
+import type { ReviewSchedule, ReviewPriority } from '../../types/spaced-repetition.types.js';
+import type { PriorityCalculator } from '../../interfaces/spaced-repetition.interface.js';
+/**
+ * 기본 우선순위 계산기
+ * 리콜 확률과 간격을 기반으로 우선순위 계산
+ */
+export declare class DefaultPriorityCalculator implements PriorityCalculator {
+    calculateReviewPriority(schedule: ReviewSchedule): number;
+    calculateBatchPriorities(schedules: ReviewSchedule[]): ReviewPriority[];
+}
+/**
+ * 가중치 기반 우선순위 계산기
+ * 다양한 요소에 가중치를 적용한 우선순위 계산
+ */
+export declare class WeightedPriorityCalculator implements PriorityCalculator {
+    private urgencyWeight;
+    private intervalWeight;
+    private multiplierWeight;
+    constructor(urgencyWeight?: number, intervalWeight?: number, multiplierWeight?: number);
+    calculateReviewPriority(schedule: ReviewSchedule): number;
+    calculateBatchPriorities(schedules: ReviewSchedule[]): ReviewPriority[];
+}
+/**
+ * 적응형 우선순위 계산기
+ * 학습자의 성과 패턴을 고려한 우선순위 계산
+ */
+export declare class AdaptivePriorityCalculator implements PriorityCalculator {
+    private baseCalculator;
+    private performancePatterns;
+    constructor(baseCalculator?: PriorityCalculator);
+    calculateReviewPriority(schedule: ReviewSchedule): number;
+    calculateBatchPriorities(schedules: ReviewSchedule[]): ReviewPriority[];
+    private calculateAdaptationFactor;
+    updatePerformancePattern(memoryId: string, performance: number): void;
+}
+/**
+ * 시간 기반 우선순위 계산기
+ * 시간대와 요일을 고려한 우선순위 계산
+ */
+export declare class TimeBasedPriorityCalculator implements PriorityCalculator {
+    private baseCalculator;
+    private timeWeights;
+    constructor(baseCalculator?: PriorityCalculator, timeWeights?: Map<number, number>);
+    calculateReviewPriority(schedule: ReviewSchedule): number;
+    calculateBatchPriorities(schedules: ReviewSchedule[]): ReviewPriority[];
+    private getTimeFactor;
+    private initializeTimeWeights;
+}
+//# sourceMappingURL=priority-calculation.service.d.ts.map

package/dist/services/spaced-repetition/priority-calculation.service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-calculation.service.d.ts","sourceRoot":"","sources":["../../../src/services/spaced-repetition/priority-calculation.service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EACV,cAAc,EACd,cAAc,EACf,MAAM,wCAAwC,CAAC;AAChD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,iDAAiD,CAAC;AAE1F;;;GAGG;AACH,qBAAa,yBAA0B,YAAW,kBAAkB;IAClE,uBAAuB,CAAC,QAAQ,EAAE,cAAc,GAAG,MAAM;IAQzD,wBAAwB,CAAC,SAAS,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;CAcxE;AAED;;;GAGG;AACH,qBAAa,0BAA2B,YAAW,kBAAkB;IAEjE,OAAO,CAAC,aAAa;IACrB,OAAO,CAAC,cAAc;IACtB,OAAO,CAAC,gBAAgB;gBAFhB,aAAa,GAAE,MAAY,EAC3B,cAAc,GAAE,MAAY,EAC5B,gBAAgB,GAAE,MAAY;IAGxC,uBAAuB,CAAC,QAAQ,EAAE,cAAc,GAAG,MAAM;IAUzD,wBAAwB,CAAC,SAAS,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;CAcxE;AAED;;;GAGG;AACH,qBAAa,0BAA2B,YAAW,kBAAkB;IAIjE,OAAO,CAAC,cAAc;IAHxB,OAAO,CAAC,mBAAmB,CAAoC;gBAGrD,cAAc,GAAE,kBAAoD;IAG9E,uBAAuB,CAAC,QAAQ,EAAE,cAAc,GAAG,MAAM;IAOzD,wBAAwB,CAAC,SAAS,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAevE,OAAO,CAAC,yBAAyB;IAcjC,wBAAwB,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI;CAWtE;AAED;;;GAGG;AACH,qBAAa,2BAA4B,YAAW,kBAAkB;IAElE,OAAO,CAAC,cAAc;IACtB,OAAO,CAAC,WAAW;gBADX,cAAc,GAAE,kBAAoD,EACpE,WAAW,GAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAa;IAMtD,uBAAuB,CAAC,QAAQ,EAAE,cAAc,GAAG,MAAM;IAOzD,wBAAwB,CAAC,SAAS,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAevE,OAAO,CAAC,aAAa;IAKrB,OAAO,CAAC,qBAAqB;CAO9B"}

package/dist/services/spaced-repetition/priority-calculation.service.js

@@ -0,0 +1,161 @@
+/**
+ * 우선순위 계산 서비스
+ * 단일 책임 원칙 (SRP) 적용
+ */
+/**
+ * 기본 우선순위 계산기
+ * 리콜 확률과 간격을 기반으로 우선순위 계산
+ */
+export class DefaultPriorityCalculator {
+    calculateReviewPriority(schedule) {
+        // 리콜 확률이 낮을수록, 간격이 길수록 우선순위 높음
+        const urgencyScore = 1 - schedule.recall_probability;
+        const intervalScore = Math.log(schedule.current_interval + 1) / 10; // 정규화
+        return urgencyScore + intervalScore;
+    }
+    calculateBatchPriorities(schedules) {
+        return schedules.map(schedule => {
+            const priority = this.calculateReviewPriority(schedule);
+            const urgency = 1 - schedule.recall_probability;
+            const intervalScore = Math.log(schedule.current_interval + 1) / 10;
+            return {
+                memory_id: schedule.memory_id,
+                priority,
+                urgency,
+                interval_score: intervalScore
+            };
+        });
+    }
+}
+/**
+ * 가중치 기반 우선순위 계산기
+ * 다양한 요소에 가중치를 적용한 우선순위 계산
+ */
+export class WeightedPriorityCalculator {
+    urgencyWeight;
+    intervalWeight;
+    multiplierWeight;
+    constructor(urgencyWeight = 0.6, intervalWeight = 0.3, multiplierWeight = 0.1) {
+        this.urgencyWeight = urgencyWeight;
+        this.intervalWeight = intervalWeight;
+        this.multiplierWeight = multiplierWeight;
+    }
+    calculateReviewPriority(schedule) {
+        const urgencyScore = 1 - schedule.recall_probability;
+        const intervalScore = Math.log(schedule.current_interval + 1) / 10;
+        const multiplierScore = Math.abs(schedule.multiplier - 1) / 2; // 정규화
+        return this.urgencyWeight * urgencyScore +
+            this.intervalWeight * intervalScore +
+            this.multiplierWeight * multiplierScore;
+    }
+    calculateBatchPriorities(schedules) {
+        return schedules.map(schedule => {
+            const priority = this.calculateReviewPriority(schedule);
+            const urgency = 1 - schedule.recall_probability;
+            const intervalScore = Math.log(schedule.current_interval + 1) / 10;
+            return {
+                memory_id: schedule.memory_id,
+                priority,
+                urgency,
+                interval_score: intervalScore
+            };
+        });
+    }
+}
+/**
+ * 적응형 우선순위 계산기
+ * 학습자의 성과 패턴을 고려한 우선순위 계산
+ */
+export class AdaptivePriorityCalculator {
+    baseCalculator;
+    performancePatterns = new Map();
+    constructor(baseCalculator = new DefaultPriorityCalculator()) {
+        this.baseCalculator = baseCalculator;
+    }
+    calculateReviewPriority(schedule) {
+        const basePriority = this.baseCalculator.calculateReviewPriority(schedule);
+        const adaptationFactor = this.calculateAdaptationFactor(schedule.memory_id);
+        return basePriority * adaptationFactor;
+    }
+    calculateBatchPriorities(schedules) {
+        return schedules.map(schedule => {
+            const priority = this.calculateReviewPriority(schedule);
+            const urgency = 1 - schedule.recall_probability;
+            const intervalScore = Math.log(schedule.current_interval + 1) / 10;
+            return {
+                memory_id: schedule.memory_id,
+                priority,
+                urgency,
+                interval_score: intervalScore
+            };
+        });
+    }
+    calculateAdaptationFactor(memoryId) {
+        const pattern = this.performancePatterns.get(memoryId);
+        if (!pattern || pattern.length === 0)
+            return 1.0;
+        // 최근 성과 패턴 분석
+        const recentPattern = pattern.slice(-10);
+        const averagePerformance = recentPattern.reduce((sum, perf) => sum + perf, 0) / recentPattern.length;
+        // 성과가 좋으면 우선순위 낮춤, 나쁘면 높임
+        if (averagePerformance > 0.8)
+            return 0.8;
+        if (averagePerformance < 0.5)
+            return 1.2;
+        return 1.0;
+    }
+    updatePerformancePattern(memoryId, performance) {
+        const pattern = this.performancePatterns.get(memoryId) || [];
+        pattern.push(performance);
+        // 최근 50개 기록만 유지
+        if (pattern.length > 50) {
+            pattern.shift();
+        }
+        this.performancePatterns.set(memoryId, pattern);
+    }
+}
+/**
+ * 시간 기반 우선순위 계산기
+ * 시간대와 요일을 고려한 우선순위 계산
+ */
+export class TimeBasedPriorityCalculator {
+    baseCalculator;
+    timeWeights;
+    constructor(baseCalculator = new DefaultPriorityCalculator(), timeWeights = new Map() // 시간대별 가중치
+    ) {
+        this.baseCalculator = baseCalculator;
+        this.timeWeights = timeWeights;
+        // 기본 시간대 가중치 설정
+        this.initializeTimeWeights();
+    }
+    calculateReviewPriority(schedule) {
+        const basePriority = this.baseCalculator.calculateReviewPriority(schedule);
+        const timeFactor = this.getTimeFactor();
+        return basePriority * timeFactor;
+    }
+    calculateBatchPriorities(schedules) {
+        return schedules.map(schedule => {
+            const priority = this.calculateReviewPriority(schedule);
+            const urgency = 1 - schedule.recall_probability;
+            const intervalScore = Math.log(schedule.current_interval + 1) / 10;
+            return {
+                memory_id: schedule.memory_id,
+                priority,
+                urgency,
+                interval_score: intervalScore
+            };
+        });
+    }
+    getTimeFactor() {
+        const hour = new Date().getHours();
+        return this.timeWeights.get(hour) || 1.0;
+    }
+    initializeTimeWeights() {
+        // 학습에 최적화된 시간대 설정
+        this.timeWeights.set(9, 1.2); // 오전 9시
+        this.timeWeights.set(14, 1.1); // 오후 2시
+        this.timeWeights.set(20, 1.3); // 오후 8시
+        this.timeWeights.set(22, 0.8); // 오후 10시 (피로 고려)
+    }
+}
+//# sourceMappingURL=priority-calculation.service.js.map

package/dist/services/spaced-repetition/priority-calculation.service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-calculation.service.js","sourceRoot":"","sources":["../../../src/services/spaced-repetition/priority-calculation.service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IACpC,uBAAuB,CAAC,QAAwB;QAC9C,+BAA+B;QAC/B,MAAM,YAAY,GAAG,CAAC,GAAG,QAAQ,CAAC,kBAAkB,CAAC;QACrD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM;QAE1E,OAAO,YAAY,GAAG,aAAa,CAAC;IACtC,CAAC;IAED,wBAAwB,CAAC,SAA2B;QAClD,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YACxD,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,kBAAkB,CAAC;YAChD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAEnE,OAAO;gBACL,SAAS,EAAE,QAAQ,CAAC,SAAS;gBAC7B,QAAQ;gBACR,OAAO;gBACP,cAAc,EAAE,aAAa;aAC9B,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,0BAA0B;IAE3B;IACA;IACA;IAHV,YACU,gBAAwB,GAAG,EAC3B,iBAAyB,GAAG,EAC5B,mBAA2B,GAAG;QAF9B,kBAAa,GAAb,aAAa,CAAc;QAC3B,mBAAc,GAAd,cAAc,CAAc;QAC5B,qBAAgB,GAAhB,gBAAgB,CAAc;IACrC,CAAC;IAEJ,uBAAuB,CAAC,QAAwB;QAC9C,MAAM,YAAY,GAAG,CAAC,GAAG,QAAQ,CAAC,kBAAkB,CAAC;QACrD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACnE,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM;QAErE,OAAO,IAAI,CAAC,aAAa,GAAG,YAAY;YACjC,IAAI,CAAC,cAAc,GAAG,aAAa;YACnC,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;IACjD,CAAC;IAED,wBAAwB,CAAC,SAA2B;QAClD,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YACxD,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,kBAAkB,CAAC;YAChD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAEnE,OAAO;gBACL,SAAS,EAAE,QAAQ,CAAC,SAAS;gBAC7B,QAAQ;gBACR,OAAO;gBACP,cAAc,EAAE,aAAa;aAC9B,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,0BAA0B;IAI3B;IAHF,mBAAmB,GAA0B,IAAI,GAAG,EAAE,CAAC;IAE/D,YACU,iBAAqC,IAAI,yBAAyB,EAAE;QAApE,mBAAc,GAAd,cAAc,CAAsD;IAC3E,CAAC;IAEJ,uBAAuB,CAAC,QAAwB;QAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QAC3E,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAE5E,OAAO,YAAY,GAAG,gBAAgB,CAAC;IACzC,CAAC;IAED,wBAAwB,CAAC,SAA2B;QAClD,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YACxD,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,kBAAkB,CAAC;YAChD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAEnE,OAAO;gBACL,SAAS,EAAE,QAAQ,CAAC,SAAS;gBAC7B,QAAQ;gBACR,OAAO;gBACP,cAAc,EAAE,aAAa;aAC9B,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,yBAAyB,CAAC,QAAgB;QAChD,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAEjD,cAAc;QACd,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,kBAAkB,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;QAErG,0BAA0B;QAC1B,IAAI,kBAAkB,GAAG,GAAG;YAAE,OAAO,GAAG,CAAC;QACzC,IAAI,kBAAkB,GAAG,GAAG;YAAE,OAAO,GAAG,CAAC;QACzC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,wBAAwB,CAAC,QAAgB,EAAE,WAAmB;QAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC7D,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAE1B,gBAAgB;QAChB,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACxB,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QAED,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,2BAA2B;IAE5B;IACA;IAFV,YACU,iBAAqC,IAAI,yBAAyB,EAAE,EACpE,cAAmC,IAAI,GAAG,EAAE,CAAC,WAAW;;QADxD,mBAAc,GAAd,cAAc,CAAsD;QACpE,gBAAW,GAAX,WAAW,CAAiC;QAEpD,gBAAgB;QAChB,IAAI,CAAC,qBAAqB,EAAE,CAAC;IAC/B,CAAC;IAED,uBAAuB,CAAC,QAAwB;QAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAExC,OAAO,YAAY,GAAG,UAAU,CAAC;IACnC,CAAC;IAED,wBAAwB,CAAC,SAA2B;QAClD,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YACxD,MAAM,OAAO,GAAG,CAAC,GAAG,QAAQ,CAAC,kBAAkB,CAAC;YAChD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,gBAAgB,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAEnE,OAAO;gBACL,SAAS,EAAE,QAAQ,CAAC,SAAS;gBAC7B,QAAQ;gBACR,OAAO;gBACP,cAAc,EAAE,aAAa;aAC9B,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,aAAa;QACnB,MAAM,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;QACnC,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;IAC3C,CAAC;IAEO,qBAAqB;QAC3B,kBAAkB;QAClB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAG,QAAQ;QACxC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAE,QAAQ;QACxC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAE,QAAQ;QACxC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAE,iBAAiB;IACnD,CAAC;CACF"}

package/dist/services/spaced-repetition/recall-probability.service.d.ts

@@ -0,0 +1,36 @@
+/**
+ * 리콜 확률 계산 서비스
+ * 단일 책임 원칙 (SRP) 적용
+ */
+import type { RecallProbabilityCalculator } from '../../interfaces/spaced-repetition.interface.js';
+/**
+ * 기본 리콜 확률 계산기
+ * 지수 감쇠 모델 사용: P = exp(-time_since_last_review / interval)
+ */
+export declare class DefaultRecallProbabilityCalculator implements RecallProbabilityCalculator {
+    calculateRecallProbability(timeSinceLastReview: number, // 일 단위
+    interval: number): number;
+}
+/**
+ * 개선된 리콜 확률 계산기
+ * 학습자 특성을 고려한 확률 모델
+ */
+export declare class EnhancedRecallProbabilityCalculator implements RecallProbabilityCalculator {
+    private baseForgettingRate;
+    private learningEfficiency;
+    constructor(baseForgettingRate?: number, learningEfficiency?: number);
+    calculateRecallProbability(timeSinceLastReview: number, interval: number): number;
+    updateLearningEfficiency(performance: boolean[]): void;
+}
+/**
+ * 적응형 리콜 확률 계산기
+ * 개별 학습자의 망각 곡선을 학습
+ */
+export declare class AdaptiveRecallProbabilityCalculator implements RecallProbabilityCalculator {
+    private forgettingCurves;
+    calculateRecallProbability(timeSinceLastReview: number, interval: number, memoryId?: string): number;
+    private calculatePersonalizedProbability;
+    updateForgettingCurve(memoryId: string, recallData: boolean[]): void;
+    private estimateForgettingCurve;
+}
+//# sourceMappingURL=recall-probability.service.d.ts.map

package/dist/services/spaced-repetition/recall-probability.service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recall-probability.service.d.ts","sourceRoot":"","sources":["../../../src/services/spaced-repetition/recall-probability.service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,iDAAiD,CAAC;AAEnG;;;GAGG;AACH,qBAAa,kCAAmC,YAAW,2BAA2B;IACpF,0BAA0B,CACxB,mBAAmB,EAAE,MAAM,EAAE,OAAO;IACpC,QAAQ,EAAE,MAAM,GACf,MAAM;CAMV;AAED;;;GAGG;AACH,qBAAa,mCAAoC,YAAW,2BAA2B;IAEnF,OAAO,CAAC,kBAAkB;IAC1B,OAAO,CAAC,kBAAkB;gBADlB,kBAAkB,GAAE,MAAY,EAChC,kBAAkB,GAAE,MAAY;IAG1C,0BAA0B,CACxB,mBAAmB,EAAE,MAAM,EAC3B,QAAQ,EAAE,MAAM,GACf,MAAM;IAST,wBAAwB,CAAC,WAAW,EAAE,OAAO,EAAE,GAAG,IAAI;CAMvD;AAED;;;GAGG;AACH,qBAAa,mCAAoC,YAAW,2BAA2B;IACrF,OAAO,CAAC,gBAAgB,CAAoC;IAE5D,0BAA0B,CACxB,mBAAmB,EAAE,MAAM,EAC3B,QAAQ,EAAE,MAAM,EAChB,QAAQ,CAAC,EAAE,MAAM,GAChB,MAAM;IAgBT,OAAO,CAAC,gCAAgC;IAiBxC,qBAAqB,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,IAAI;IAMpE,OAAO,CAAC,uBAAuB;CAWhC"}

package/dist/services/spaced-repetition/recall-probability.service.js

@@ -0,0 +1,88 @@
+/**
+ * 리콜 확률 계산 서비스
+ * 단일 책임 원칙 (SRP) 적용
+ */
+/**
+ * 기본 리콜 확률 계산기
+ * 지수 감쇠 모델 사용: P = exp(-time_since_last_review / interval)
+ */
+export class DefaultRecallProbabilityCalculator {
+    calculateRecallProbability(timeSinceLastReview, // 일 단위
+    interval) {
+        if (interval <= 0)
+            return 0;
+        if (timeSinceLastReview <= 0)
+            return 1;
+        return Math.exp(-timeSinceLastReview / interval);
+    }
+}
+/**
+ * 개선된 리콜 확률 계산기
+ * 학습자 특성을 고려한 확률 모델
+ */
+export class EnhancedRecallProbabilityCalculator {
+    baseForgettingRate;
+    learningEfficiency;
+    constructor(baseForgettingRate = 1.0, learningEfficiency = 1.0) {
+        this.baseForgettingRate = baseForgettingRate;
+        this.learningEfficiency = learningEfficiency;
+    }
+    calculateRecallProbability(timeSinceLastReview, interval) {
+        if (interval <= 0)
+            return 0;
+        if (timeSinceLastReview <= 0)
+            return 1;
+        // 개선된 공식: P = exp(-forgetting_rate * time / interval)
+        const forgettingRate = this.baseForgettingRate / this.learningEfficiency;
+        return Math.exp(-forgettingRate * timeSinceLastReview / interval);
+    }
+    updateLearningEfficiency(performance) {
+        if (performance.length === 0)
+            return;
+        const successRate = performance.filter(success => success).length / performance.length;
+        this.learningEfficiency = Math.max(0.5, Math.min(2.0, successRate * 2));
+    }
+}
+/**
+ * 적응형 리콜 확률 계산기
+ * 개별 학습자의 망각 곡선을 학습
+ */
+export class AdaptiveRecallProbabilityCalculator {
+    forgettingCurves = new Map();
+    calculateRecallProbability(timeSinceLastReview, interval, memoryId) {
+        if (interval <= 0)
+            return 0;
+        if (timeSinceLastReview <= 0)
+            return 1;
+        if (memoryId && this.forgettingCurves.has(memoryId)) {
+            return this.calculatePersonalizedProbability(timeSinceLastReview, interval, memoryId);
+        }
+        // 기본 지수 감쇠 모델
+        return Math.exp(-timeSinceLastReview / interval);
+    }
+    calculatePersonalizedProbability(timeSinceLastReview, interval, memoryId) {
+        const curve = this.forgettingCurves.get(memoryId);
+        const normalizedTime = timeSinceLastReview / interval;
+        // 개인별 망각 곡선 적용
+        if (normalizedTime < curve.length) {
+            const index = Math.floor(normalizedTime * curve.length);
+            return curve[index] || 0;
+        }
+        return Math.exp(-timeSinceLastReview / interval);
+    }
+    updateForgettingCurve(memoryId, recallData) {
+        // 리콜 데이터를 기반으로 개인별 망각 곡선 업데이트
+        const curve = this.estimateForgettingCurve(recallData);
+        this.forgettingCurves.set(memoryId, curve);
+    }
+    estimateForgettingCurve(recallData) {
+        // 간단한 망각 곡선 추정 (실제로는 더 복잡한 알고리즘 사용)
+        const curve = [];
+        const decayRate = 0.1;
+        for (let i = 0; i < 100; i++) {
+            curve.push(Math.exp(-decayRate * i));
+        }
+        return curve;
+    }
+}
+//# sourceMappingURL=recall-probability.service.js.map

package/dist/services/spaced-repetition/recall-probability.service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recall-probability.service.js","sourceRoot":"","sources":["../../../src/services/spaced-repetition/recall-probability.service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;GAGG;AACH,MAAM,OAAO,kCAAkC;IAC7C,0BAA0B,CACxB,mBAA2B,EAAE,OAAO;IACpC,QAAgB;QAEhB,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAC5B,IAAI,mBAAmB,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAEvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,mBAAmB,GAAG,QAAQ,CAAC,CAAC;IACnD,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,mCAAmC;IAEpC;IACA;IAFV,YACU,qBAA6B,GAAG,EAChC,qBAA6B,GAAG;QADhC,uBAAkB,GAAlB,kBAAkB,CAAc;QAChC,uBAAkB,GAAlB,kBAAkB,CAAc;IACvC,CAAC;IAEJ,0BAA0B,CACxB,mBAA2B,EAC3B,QAAgB;QAEhB,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAC5B,IAAI,mBAAmB,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAEvC,sDAAsD;QACtD,MAAM,cAAc,GAAG,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,kBAAkB,CAAC;QACzE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,cAAc,GAAG,mBAAmB,GAAG,QAAQ,CAAC,CAAC;IACpE,CAAC;IAED,wBAAwB,CAAC,WAAsB;QAC7C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAErC,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;QACvF,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,mCAAmC;IACtC,gBAAgB,GAA0B,IAAI,GAAG,EAAE,CAAC;IAE5D,0BAA0B,CACxB,mBAA2B,EAC3B,QAAgB,EAChB,QAAiB;QAEjB,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAC5B,IAAI,mBAAmB,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAEvC,IAAI,QAAQ,IAAI,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACpD,OAAO,IAAI,CAAC,gCAAgC,CAC1C,mBAAmB,EACnB,QAAQ,EACR,QAAQ,CACT,CAAC;QACJ,CAAC;QAED,cAAc;QACd,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,mBAAmB,GAAG,QAAQ,CAAC,CAAC;IACnD,CAAC;IAEO,gCAAgC,CACtC,mBAA2B,EAC3B,QAAgB,EAChB,QAAgB;QAEhB,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACnD,MAAM,cAAc,GAAG,mBAAmB,GAAG,QAAQ,CAAC;QAEtD,eAAe;QACf,IAAI,cAAc,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YACxD,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,mBAAmB,GAAG,QAAQ,CAAC,CAAC;IACnD,CAAC;IAED,qBAAqB,CAAC,QAAgB,EAAE,UAAqB;QAC3D,8BAA8B;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QACvD,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;IAEO,uBAAuB,CAAC,UAAqB;QACnD,oCAAoC;QACpC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,GAAG,CAAC;QAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/dist/services/spaced-repetition/review-scheduling.service.d.ts

@@ -0,0 +1,43 @@
+/**
+ * 리뷰 스케줄링 서비스
+ * 단일 책임 원칙 (SRP) 적용
+ */
+import type { SpacedRepetitionFeatures, ReviewSchedule, MemoryData } from '../../types/spaced-repetition.types.js';
+import type { ReviewScheduler, IntervalCalculationStrategy, RecallProbabilityCalculator, ReviewNecessityChecker } from '../../interfaces/spaced-repetition.interface.js';
+/**
+ * 기본 리뷰 스케줄러
+ */
+export declare class DefaultReviewScheduler implements ReviewScheduler {
+    private intervalStrategy;
+    private recallCalculator;
+    private necessityChecker;
+    protected recallThreshold: number;
+    constructor(intervalStrategy: IntervalCalculationStrategy, recallCalculator: RecallProbabilityCalculator, necessityChecker: ReviewNecessityChecker, recallThreshold?: number);
+    createReviewSchedule(memoryId: string, currentInterval: number, lastReviewDate: Date, features: SpacedRepetitionFeatures): ReviewSchedule;
+    createBatchReviewSchedules(memories: MemoryData[]): ReviewSchedule[];
+    private getDaysSince;
+}
+/**
+ * 우선순위 기반 리뷰 스케줄러
+ * 리뷰 우선순위를 고려한 스케줄링
+ */
+export declare class PriorityBasedReviewScheduler extends DefaultReviewScheduler {
+    private maxDailyReviews;
+    constructor(intervalStrategy: IntervalCalculationStrategy, recallCalculator: RecallProbabilityCalculator, necessityChecker: ReviewNecessityChecker, recallThreshold?: number, maxDailyReviews?: number);
+    createBatchReviewSchedules(memories: MemoryData[]): ReviewSchedule[];
+    private prioritizeAndLimitSchedules;
+    private calculatePriority;
+}
+/**
+ * 적응형 리뷰 스케줄러
+ * 학습자의 성과에 따라 동적으로 조정
+ */
+export declare class AdaptiveReviewScheduler extends DefaultReviewScheduler {
+    private performanceHistory;
+    constructor(intervalStrategy: IntervalCalculationStrategy, recallCalculator: RecallProbabilityCalculator, necessityChecker: ReviewNecessityChecker, recallThreshold?: number);
+    createReviewSchedule(memoryId: string, currentInterval: number, lastReviewDate: Date, features: SpacedRepetitionFeatures): ReviewSchedule;
+    private adjustThresholdForMemory;
+    private evaluateReviewNecessity;
+    updatePerformance(memoryId: string, success: boolean): void;
+}
+//# sourceMappingURL=review-scheduling.service.d.ts.map

package/dist/services/spaced-repetition/review-scheduling.service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"review-scheduling.service.d.ts","sourceRoot":"","sources":["../../../src/services/spaced-repetition/review-scheduling.service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EACV,wBAAwB,EACxB,cAAc,EACd,UAAU,EACX,MAAM,wCAAwC,CAAC;AAChD,OAAO,KAAK,EACV,eAAe,EACf,2BAA2B,EAC3B,2BAA2B,EAC3B,sBAAsB,EACvB,MAAM,iDAAiD,CAAC;AAEzD;;GAEG;AACH,qBAAa,sBAAuB,YAAW,eAAe;IAE1D,OAAO,CAAC,gBAAgB;IACxB,OAAO,CAAC,gBAAgB;IACxB,OAAO,CAAC,gBAAgB;IACxB,SAAS,CAAC,eAAe,EAAE,MAAM;gBAHzB,gBAAgB,EAAE,2BAA2B,EAC7C,gBAAgB,EAAE,2BAA2B,EAC7C,gBAAgB,EAAE,sBAAsB,EACtC,eAAe,GAAE,MAAY;IAGzC,oBAAoB,CAClB,QAAQ,EAAE,MAAM,EAChB,eAAe,EAAE,MAAM,EACvB,cAAc,EAAE,IAAI,EACpB,QAAQ,EAAE,wBAAwB,GACjC,cAAc;IAuBjB,0BAA0B,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,cAAc,EAAE;IAkBpE,OAAO,CAAC,YAAY;CAKrB;AAED;;;GAGG;AACH,qBAAa,4BAA6B,SAAQ,sBAAsB;IAMpE,OAAO,CAAC,eAAe;gBAJvB,gBAAgB,EAAE,2BAA2B,EAC7C,gBAAgB,EAAE,2BAA2B,EAC7C,gBAAgB,EAAE,sBAAsB,EACxC,eAAe,GAAE,MAAY,EACrB,eAAe,GAAE,MAAW;IAKtC,0BAA0B,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,cAAc,EAAE;IAOpE,OAAO,CAAC,2BAA2B;IAanC,OAAO,CAAC,iBAAiB;CAK1B;AAED;;;GAGG;AACH,qBAAa,uBAAwB,SAAQ,sBAAsB;IACjE,OAAO,CAAC,kBAAkB,CAAqC;gBAG7D,gBAAgB,EAAE,2BAA2B,EAC7C,gBAAgB,EAAE,2BAA2B,EAC7C,gBAAgB,EAAE,sBAAsB,EACxC,eAAe,GAAE,MAAY;IAK/B,oBAAoB,CAClB,QAAQ,EAAE,MAAM,EAChB,eAAe,EAAE,MAAM,EACvB,cAAc,EAAE,IAAI,EACpB,QAAQ,EAAE,wBAAwB,GACjC,cAAc;IAiBjB,OAAO,CAAC,wBAAwB;IAahC,OAAO,CAAC,uBAAuB;IAI/B,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI;CAW5D"}