惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

D
Docker
IT之家
IT之家
Microsoft Security Blog
Microsoft Security Blog
博客园 - 司徒正美
云风的 BLOG
云风的 BLOG
P
Proofpoint News Feed
D
DataBreaches.Net
B
Blog RSS Feed
博客园_首页
The GitHub Blog
The GitHub Blog
I
InfoQ
L
LangChain Blog
G
Google Developers Blog
M
MIT News - Artificial intelligence
美团技术团队
腾讯CDC
V
Visual Studio Blog
aimingoo的专栏
aimingoo的专栏
博客园 - 聂微东
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Apple Machine Learning Research
Apple Machine Learning Research
A
About on SuperTechFans
博客园 - 三生石上(FineUI控件)
博客园 - 叶小钗

DEV Community

Authentication Security Deep Dive: From Brute Force to Salted Hashing (With Java Examples) Why AI Systems Don’t Fail — They Drift Spilling beans for how i learn for exam😁"Reinforcement Learning Cheat Sheet" I Replaced Chrome with Safari for AI Browser Automation. Here's What Broke (and What Finally Worked) How Python Borrows Other People's Work The $40 Architecture: Processing 1 Billion API Requests with 99.99% Uptime Vibe Coding: A Workflow Guide (From Zero to SaaS) Most webhook security guides protect the wrong side. The scary part is delivery. Headless CMS for TanStack Start: Build a Blog with Cosmic EU Age Verification App "Hacked in 2 Minutes" — What Actually Happened Comfy Cloud’s delete function does not actually remove files Running AI Models on GPU Cloud Servers: A Beginner Guide Event-driven media intelligence with AWS Step Functions and Bedrock I scored 500 AI prompts across 8 quality dimensions — here's what broke How to Call Google Gemini API from Next.js (Free Tier, No Backend Needed) The Portal Protocol: Reclaiming Human Connection in the Age of AI How to Fix Your Team's Scattered Knowledge Problem With a Self-Hosted Forum Intro to tc Cloud Functors: A Graph-First Mental Model for the Modern Cloud Designing Multi-Tenant Backends With Both Ownership and Team Access I Built a Neumorphic CSS Library with 77+ Components — Here's What I Learned PostgreSQL Performance Optimization: Why Connection Pooling Is Critical at Scale Cómo construí un SaaS multi-rubro para gestionar expensas en Argentina con FastAPI + Vue 3 🚀 I Built an Ethical Hacking Scanner Tool – Open Source Project I Replaced /usage and /context in Claude Code With a Single Statusline A Pythonic Way to Handle Emails (IMAP/SMTP) with Auto-Discovery and AI-Ready Design I Collected 8.9 Million Polymarket Price Points — Here's What I Found About How Markets Really Move EcoTrack AI — Carbon Footprint Tracker & Dashboard Everyone's Using AI. No One Agrees How. 5 self-hosted ebook managers worth trying in 2026 Building Your First AI Agent with LangChain: From Chatbot to Autonomous Assistant
Three decisions behind a music-to-curator matching score
Satoshi Yamashita · 2026-06-13 · via DEV Community

I build OTONAMI, a pitch platform that connects independent
artists with music curators — playlist editors, radio DJs, bloggers, label scouts.
At its core is a single number: how well does this track fit this curator?

The math behind that number is textbook. Cosine similarity, Jaccard, a weighted
sum — nothing you can't find in a first-year course. What actually took real,
messy music data to get right were three design decisions. Each one came from
a concrete failure, and each one is the difference between a matcher that looks
fine in a demo and one that ranks sensibly in production.

I extracted and generalized the engine into a small, typed, open-source library —
music-matching-patterns
so the code below is real and runnable. Here are the three decisions.

The shape of the problem

A match is scored on three factors and combined with weights:

score = genreScore · w_genre  +  moodScore · w_mood  +  audioScore · w_audio

Each sub-score lands in [0, 1]. Genre tends to be the strongest predictor of
fit, mood is a secondary signal, and audio is a tie-breaker rather than a driver —
so a split that leans on genre (something like 0.55 / 0.25 / 0.20) is a reasonable
starting point. The interesting part isn't the weights. It's how each sub-score is
computed.

Decision 1 — Genre uses recall, not Jaccard

The obvious move is Jaccard similarity over the two genre sets: intersection over
union. It's symmetric and tidy. It's also wrong here.

Picture a curator who covers ten genres — a generous, broad-taste editor. A track
that hits exactly one of those ten is a perfect fit for that curator's lane. But
Jaccard would score it 1 / 10 = 0.1, because the union is huge. The broader and
more welcoming the curator, the harder Jaccard punishes them. That's exactly
backwards from what you want.

The question isn't symmetric. It's: does this track fit inside the curator's
lane?
So genre is scored as recall over the track's genres — of the track's
genres, how many does the curator cover?

export function genreScore(track: Track, curator: Curator): number {
  if (curator.openToAllGenres) return 1;

  const trackGenres = normalizeLabels(track.genres);
  if (trackGenres.length === 0) return 0.5; // see Decision 3

  const curatorGenres = new Set(normalizeLabels(curator.genres));
  const covered = trackGenres.filter((g) => curatorGenres.has(g)).length;
  return covered / trackGenres.length;
}

A broad curator is no longer penalized for being broad. The asymmetry of the
real-world question is now baked into the metric.

Decision 2 — Tempo is deliberately excluded from the audio vector

Audio fit is cosine similarity over a feature vector: energy, danceability,
acousticness, instrumentalness, valence. The tempting sixth dimension is tempo.
I left it out on purpose.

Automatic BPM detection is unreliable in a way that's uniquely destructive to a
distance metric: it makes half-time and double-time errors. A slow 60 BPM
ballad routinely gets read as 120 BPM. When that doubled value lands in a vector
and you compute distance, it doesn't just add a little noise — it blows a hole in
the score. Two tracks that belong together suddenly look far apart on one axis.

In an early version, this produced a bug where about 22% of matches collapsed
toward a flat, meaningless score. Tracing it back, tempo was the culprit nearly
every time. Pulling tempo out of scoring removed an entire class of false
negatives at once.

for (const dimension of AUDIO_DIMENSIONS) {
  const x = a[dimension];
  const y = b[dimension];
  dot += x * y;
  magA += x * x;
  magB += y * y;
}

Tempo can still show up in display copy ("similar energy and tempo") — humans
read it fine. It just must never re-enter the score. Keep explanation and scoring
decoupled.

Decision 3 — Missing data is neutral, never a penalty

Independent music is full of gaps. Plenty of tracks have no reliable audio
analysis. Plenty of curators never filled in their mood tags. The naive thing is
to treat a missing signal as a zero — and the naive thing quietly buries every new
or under-analyzed artist at the bottom of every ranking.

So whenever either side lacks audio, or either side lacks moods, that factor
returns a neutral 0.5. It neither helps nor hurts.

export function audioScore(track: Track, curator: Curator): number {
  const a = track.audio;
  const b = curator.audio;
  if (!a || !b) return 0.5; // absence of a signal is not evidence of a bad fit
  // ...cosine similarity...
}

Absence of evidence is not evidence of a poor fit. Encoding that one line keeps the
newest artists — the ones a discovery platform exists to serve — from being
penalized for thin metadata.

Takeaway

None of these are clever algorithms. They're small, boring guards: recall instead
of Jaccard, one dimension removed, one neutral fallback. But each one came from
watching real rankings go wrong, and together they're most of what separates a
matcher that works from one that merely runs.

The full implementation is open source and typed end to end:
music-matching-patterns.
If you're wiring an LLM into a Next.js app, you might also like my earlier write-up
on production patterns for the Claude API in Next.js.