|
| 1 | +package services |
| 2 | + |
| 3 | +import jakarta.inject.{Inject, Singleton} |
| 4 | +import models.domain.publications.PublicationCandidate |
| 5 | +import play.api.Logging |
| 6 | +import repositories.PublicationCandidateRepository |
| 7 | + |
| 8 | +import scala.concurrent.{ExecutionContext, Future} |
| 9 | + |
| 10 | +/** |
| 11 | + * Learns from curator accept/reject decisions to improve relevance scoring. |
| 12 | + * |
| 13 | + * Analyzes historical decisions by computing per-component score distributions |
| 14 | + * for accepted vs rejected candidates, then derives adjusted weights that |
| 15 | + * emphasize components with higher discriminative power. |
| 16 | + */ |
| 17 | +@Singleton |
| 18 | +class ScoringFeedbackService @Inject()( |
| 19 | + candidateRepository: PublicationCandidateRepository, |
| 20 | + relevanceScoringService: RelevanceScoringService |
| 21 | +)(implicit ec: ExecutionContext) extends Logging { |
| 22 | + |
| 23 | + val MinSamplesForFeedback: Int = 10 |
| 24 | + |
| 25 | + /** |
| 26 | + * Analyze all reviewed candidates and compute learned weight adjustments. |
| 27 | + * Returns None if insufficient data (< MinSamplesForFeedback reviewed candidates). |
| 28 | + */ |
| 29 | + def computeLearnedWeights(): Future[Option[LearnedWeights]] = { |
| 30 | + candidateRepository.listReviewed().map { reviewed => |
| 31 | + if (reviewed.size < MinSamplesForFeedback) { |
| 32 | + logger.info(s"Insufficient reviewed candidates (${reviewed.size}/$MinSamplesForFeedback) for feedback learning.") |
| 33 | + None |
| 34 | + } else { |
| 35 | + val accepted = reviewed.filter(_.status == "accepted") |
| 36 | + val rejected = reviewed.filter(_.status == "rejected") |
| 37 | + |
| 38 | + if (accepted.isEmpty || rejected.isEmpty) { |
| 39 | + logger.info("Need both accepted and rejected candidates for feedback learning.") |
| 40 | + None |
| 41 | + } else { |
| 42 | + Some(deriveWeights(accepted, rejected)) |
| 43 | + } |
| 44 | + } |
| 45 | + } |
| 46 | + } |
| 47 | + |
| 48 | + /** |
| 49 | + * Compute a feedback analysis report with per-component statistics. |
| 50 | + */ |
| 51 | + def analyzeFeedback(): Future[Option[FeedbackAnalysis]] = { |
| 52 | + candidateRepository.listReviewed().map { reviewed => |
| 53 | + val accepted = reviewed.filter(_.status == "accepted") |
| 54 | + val rejected = reviewed.filter(_.status == "rejected") |
| 55 | + |
| 56 | + if (accepted.isEmpty && rejected.isEmpty) None |
| 57 | + else { |
| 58 | + val acceptedBreakdowns = accepted.map(relevanceScoringService.scoreBreakdown) |
| 59 | + val rejectedBreakdowns = rejected.map(relevanceScoringService.scoreBreakdown) |
| 60 | + |
| 61 | + Some(FeedbackAnalysis( |
| 62 | + totalReviewed = reviewed.size, |
| 63 | + acceptedCount = accepted.size, |
| 64 | + rejectedCount = rejected.size, |
| 65 | + acceptedMeans = computeMeans(acceptedBreakdowns), |
| 66 | + rejectedMeans = computeMeans(rejectedBreakdowns), |
| 67 | + componentDiscriminativePower = computeDiscriminativePower(acceptedBreakdowns, rejectedBreakdowns) |
| 68 | + )) |
| 69 | + } |
| 70 | + } |
| 71 | + } |
| 72 | + |
| 73 | + private[services] def deriveWeights( |
| 74 | + accepted: Seq[PublicationCandidate], |
| 75 | + rejected: Seq[PublicationCandidate] |
| 76 | + ): LearnedWeights = { |
| 77 | + val acceptedBreakdowns = accepted.map(relevanceScoringService.scoreBreakdown) |
| 78 | + val rejectedBreakdowns = rejected.map(relevanceScoringService.scoreBreakdown) |
| 79 | + |
| 80 | + val discriminativePower = computeDiscriminativePower(acceptedBreakdowns, rejectedBreakdowns) |
| 81 | + |
| 82 | + // Compute new weights proportional to discriminative power, |
| 83 | + // blended with original weights for stability (70% original, 30% learned) |
| 84 | + val blendRatio = 0.3 |
| 85 | + val originalWeights = Map( |
| 86 | + "keyword" -> relevanceScoringService.scoreBreakdown(accepted.head).keywordWeight, |
| 87 | + "concept" -> relevanceScoringService.scoreBreakdown(accepted.head).conceptWeight, |
| 88 | + "citation" -> relevanceScoringService.scoreBreakdown(accepted.head).citationWeight, |
| 89 | + "journal" -> relevanceScoringService.scoreBreakdown(accepted.head).journalWeight |
| 90 | + ) |
| 91 | + |
| 92 | + // Normalize discriminative power to sum to 1.0 for use as weights |
| 93 | + val totalPower = discriminativePower.values.sum |
| 94 | + val learnedRaw = if (totalPower > 0) { |
| 95 | + discriminativePower.view.mapValues(_ / totalPower).toMap |
| 96 | + } else { |
| 97 | + originalWeights |
| 98 | + } |
| 99 | + |
| 100 | + // Blend: new_weight = (1 - blend) * original + blend * learned |
| 101 | + val blended = originalWeights.map { case (component, origWeight) => |
| 102 | + val learnedWeight = learnedRaw.getOrElse(component, origWeight) |
| 103 | + component -> ((1.0 - blendRatio) * origWeight + blendRatio * learnedWeight) |
| 104 | + } |
| 105 | + |
| 106 | + // Normalize blended weights to sum to 1.0 |
| 107 | + val blendedTotal = blended.values.sum |
| 108 | + val normalized = blended.view.mapValues(_ / blendedTotal).toMap |
| 109 | + |
| 110 | + logger.info(s"Learned weights from ${accepted.size + rejected.size} reviewed candidates: $normalized") |
| 111 | + |
| 112 | + LearnedWeights( |
| 113 | + keywordWeight = normalized("keyword"), |
| 114 | + conceptWeight = normalized("concept"), |
| 115 | + citationWeight = normalized("citation"), |
| 116 | + journalWeight = normalized("journal"), |
| 117 | + sampleSize = accepted.size + rejected.size, |
| 118 | + discriminativePower = discriminativePower |
| 119 | + ) |
| 120 | + } |
| 121 | + |
| 122 | + /** |
| 123 | + * Discriminative power = |mean_accepted - mean_rejected| for each component. |
| 124 | + * Higher values mean the component better separates accepted from rejected. |
| 125 | + */ |
| 126 | + private[services] def computeDiscriminativePower( |
| 127 | + acceptedBreakdowns: Seq[ScoringBreakdown], |
| 128 | + rejectedBreakdowns: Seq[ScoringBreakdown] |
| 129 | + ): Map[String, Double] = { |
| 130 | + val acceptedMeans = computeMeans(acceptedBreakdowns) |
| 131 | + val rejectedMeans = computeMeans(rejectedBreakdowns) |
| 132 | + |
| 133 | + Map( |
| 134 | + "keyword" -> math.abs(acceptedMeans.getOrElse("keyword", 0.0) - rejectedMeans.getOrElse("keyword", 0.0)), |
| 135 | + "concept" -> math.abs(acceptedMeans.getOrElse("concept", 0.0) - rejectedMeans.getOrElse("concept", 0.0)), |
| 136 | + "citation" -> math.abs(acceptedMeans.getOrElse("citation", 0.0) - rejectedMeans.getOrElse("citation", 0.0)), |
| 137 | + "journal" -> math.abs(acceptedMeans.getOrElse("journal", 0.0) - rejectedMeans.getOrElse("journal", 0.0)) |
| 138 | + ) |
| 139 | + } |
| 140 | + |
| 141 | + private[services] def computeMeans(breakdowns: Seq[ScoringBreakdown]): Map[String, Double] = { |
| 142 | + if (breakdowns.isEmpty) return Map("keyword" -> 0.0, "concept" -> 0.0, "citation" -> 0.0, "journal" -> 0.0) |
| 143 | + |
| 144 | + val n = breakdowns.size.toDouble |
| 145 | + Map( |
| 146 | + "keyword" -> breakdowns.map(_.keywordScore).sum / n, |
| 147 | + "concept" -> breakdowns.map(_.conceptScore).sum / n, |
| 148 | + "citation" -> breakdowns.map(_.citationScore).sum / n, |
| 149 | + "journal" -> breakdowns.map(_.journalScore).sum / n |
| 150 | + ) |
| 151 | + } |
| 152 | +} |
| 153 | + |
| 154 | +case class LearnedWeights( |
| 155 | + keywordWeight: Double, |
| 156 | + conceptWeight: Double, |
| 157 | + citationWeight: Double, |
| 158 | + journalWeight: Double, |
| 159 | + sampleSize: Int, |
| 160 | + discriminativePower: Map[String, Double] |
| 161 | +) |
| 162 | + |
| 163 | +case class FeedbackAnalysis( |
| 164 | + totalReviewed: Int, |
| 165 | + acceptedCount: Int, |
| 166 | + rejectedCount: Int, |
| 167 | + acceptedMeans: Map[String, Double], |
| 168 | + rejectedMeans: Map[String, Double], |
| 169 | + componentDiscriminativePower: Map[String, Double] |
| 170 | +) |
0 commit comments