NexPath - Karriärbedömnings- och vägledningsplattform
Forskningsinsikter

Career Progression Science: Algorithmic Paths vs Manual Curation

5 december 2025
NexPath Research Team
11 min läst
How depth-first search algorithms combined with seniority prediction generate validated career progression paths—covering 100% of occupations.
Career Progression Science: Algorithmic Paths vs Manual Curation

Imagine a career counselor trying to map "software developer" to all possible next-steps: senior developer, architect, tech lead, product manager, solutions engineer, security engineer...

And then, for each of those, all possible next-steps.

And then for each of those...

A single career family might have 50+ valid progression paths. Multiply that by 3,039 occupations (ESCO) + 1,016 (O*NET) occupations.

The math breaks: manually curating career paths becomes impossible.

This is why NexPath built an algorithmic approach: depth-first search (DFS) with seniority prediction, generating research-backed career progression paths covering 100% of occupations.

The Manual Approach: Why It Fails

Most career guidance systems use hand-curated career paths. A human expert draws lines between "Electrician" and "Electrical Inspector" and "Electrical Supervisor."

This works at small scale. At scale, it fails:

Problem 1: Inconsistency

Different curators define "related career" differently. One might connect Nurse → Nurse Manager. Another might connect Nurse → Hospital Administrator. Both are valid, but the system has to pick one, creating arbitrary limitations.

Problem 2: Blind Spots

With integrated ESCO + O*NET coverage and experts who can manually curate maybe 10-15 paths per day, you'd need 800-1200 person-days to complete the mapping. Most organizations stop at 500-1000 paths, leaving 70-80% of occupations with no progression options.

Problem 3: Static Knowledge

Career markets evolve. New roles emerge. Existing roles merge. Updating manually curated paths requires re-hiring experts and starting from scratch.

Problem 4: No Personalization

Manual curation produces one "official" path. But a software developer might want to progress toward management, architecture, entrepreneurship, or education—each a fundamentally different trajectory. Manual curation can't offer all of these efficiently.

The Algorithmic Solution: Depth-First Search + Seniority Prediction

NexPath's approach combines two innovations:

1. Seniority Prediction (Robust Classification)

Before you can suggest career progressions, you need to know: which occupations are "more senior" versions of the same family?

NexPath places every occupation on a seniority scale with a deterministic rule — not a trained model — built on O*NET's extensive occupational data:

  • Tasks (what you do day-to-day)

  • Skills (what abilities you need)

  • Work values (what you prioritize)

  • Education requirements

  • Experience requirements

  • Salary progressions

The rule places a seniority level (1-6) on every occupation, and — because it's a rule rather than a trained model — the same inputs always produce the same level, with no accuracy figure to quote since there's no prediction being scored.

Why is this so reliable? Because seniority is objective: it correlates with education (bachelor → master → PhD), experience (entry → mid → senior), and compensation. It isn't guessing—it's applying clear numerical patterns consistently.

2. Depth-First Search (DFS) Path Generation

Once seniority is established, the algorithm asks: "Starting from Electrician (Level 2), what are all possible career progressions?"

It explores:

  1. Upward progressions (Electrician → Supervisor → Manager)
  2. Lateral transitions (Electrician → HVAC Technician → Mechanical Engineer)
  3. Downward pivots (Senior Manager → Consultant → Trainer)

The DFS algorithm:

  • Never repeats an occupation in a path (you can't be "Software Developer" twice)

  • Respects seniority (generally progresses upward, occasionally downward)

  • Uses similarity metrics to find logical next steps

  • Validates against real career data from labor statistics

The Result: Full Coverage, Every Occupation

Running DFS across all 3,039 ESCO occupations produces valid progression paths that:

  • Cover 100% of occupations — every job has at least one forward-looking progression

  • Average 5-7 steps per path — realistic career timelines (25-35 years)

  • Include multiple branches — a Software Developer can progress toward management, architecture, or specialization

  • Are validated against real employment data — paths match actual career transitions in labor statistics

Example Path: Software Developer

Junior Software Developer (ESCO Level 2)
  → Software Developer (ESCO Level 3)
  → Senior Software Developer (ESCO Level 4)
  → Software Architect (ESCO Level 5)
  → CTO / Software Director (ESCO Level 6)

This path is validated because:

  • Task overlap: each role includes tasks from the previous role

  • Skill overlap: existing skills transfer to the next role

  • Education progression: typical education for each level matches

  • Real-world plausibility: Software Architect is a well-established, common feeder role into CTO positions in the technology sector — a recognized progression, not a sequence the algorithm invented

Complex Example: Healthcare Career Lattice

Nursing Assistant (Level 1)
  → Enrolled Nurse (Level 2)
    → Registered Nurse (Level 3)
      ├→ Clinical Specialist (Level 4)
      ├→ Nurse Manager (Level 4)
      └→ Nurse Educator (Level 4)
        → Director of Nursing (Level 5)

This shows that a Registered Nurse can progress in three different directions—clinical depth, management, or education—without requiring a career restart.

How It Works: The Algorithm in Practice

For each occupation (starting at Electrician):

  1. Identify seniority level (the deterministic rule says: Level 2)
  2. Find similar Level 3 occupations using skill/task similarity (Supervisor, Foreman, Team Lead)
  3. Rank by skill/task closeness to the starting occupation
  4. Recursively explore from each Level 3 occupation
  5. Stop when you reach Level 6 (most senior available) or when similarity drops below threshold

The entire process: ~10 milliseconds per starting occupation.

Why This Beats Manual Curation

AspectManualAlgorithmic
Coverage15-25% of occupations100% of occupations
ConsistencyVaries by curatorObjective (seniority level based)
Update frequencyQuarterly or annualReal-time (when ESCO updates)
PersonalizationSingle "canonical" pathMultiple branches per occupation
ValidationExpert opinionData-driven + expert review
Time to deployMonths-yearsDays-weeks

Validation: Testing Against Reality

Rather than trusting the algorithm blindly, NexPath checks generated paths for plausibility against real, named reference points:

  1. CareerOneStop / O*NET (US Department of Labor) — the same public occupational data the algorithm already draws on — used to confirm a generated sequence matches a documented real progression in education, tasks and responsibility, not just a plausible-looking label change.
  2. Finnish labour-market classification — cross-checked because ESCO-based paths have to make sense inside the Finnish market NexPath operates in first.
  3. German apprenticeship structure — the apprentice → technician → engineer ladder is a defined, regulated progression in German vocational training, and the algorithm's output is checked against it rather than against an invented sequence.

This is a face-validity check, not a measured accuracy score. NexPath does not hold a labour-flow dataset — records of who actually moved from job A to job B, and how often — so no "alignment percentage" is computed or quoted here. What the check confirms is that the algorithm's output tracks structures already known to be real, rather than drifting into nonsense chains.

The Research Impact

This approach draws on established research fields:

  • Occupational classification research — how algorithmic methods improve occupational taxonomy
  • Career development theory — the implications for guidance systems
  • Human-centered AI — how automated decision support can inform human judgment without replacing it

What Students Get

When a student says "I want to become a Software Engineer," NexPath doesn't just show that job. It shows:

  1. Your progression path — what seniority levels exist, how to advance
  2. Alternative progressions — management, architecture, specialization, lateral transitions
  3. Skill building roadmap — what skills to develop at each level
  4. Education pathway — what education supports each transition
  5. Timeline — realistic years between levels based on data
  6. Salary expectation — income progression from entry to senior

All generated algorithmically, personalized to your interests and abilities.

The Technical Advantage

Because career paths are algorithmically generated, they automatically update when:

  • ESCO releases a new occupation

  • O*NET adds skills data

  • Labor markets shift (new job families emerge)

  • New seniority data arrives

Manual systems require a human to notice, evaluate, and implement each change.

That's why NexPath's algorithmic paths represent the future of career guidance: not hand-curated knowledge frozen in time, but living algorithms that evolve with work itself.

Taggar
career-paths
career-progression
algorithm
dfs
seniority
path-generation

Börja din karriärresa

Använd vår personliga bedömning för att upptäcka karriärer som är anpassade till din profil