next generation job matching system (slide share 05 2013)
TRANSCRIPT
NEXT GENERATION JOB MATCHING SYSTEMRDI LABSQUERY ENGINE™ FOR JOB MATCHINGMAY 2013
Employers Post Jobs
Candidates Post
Credentials
Employers Search
Candidate Credentials
Candidates Search Job
Posting
THE FOUR DIMENSIONS OF JOB SEARCH
Copyright (c) 2013 RDI Labs 2
JOB MATCHING SYSTEMS ARE CRITICALLY IMPORTANT IN TODAY’S JOB MARKET, BUT . . .
There are 12 million unemployed people
There are 4.8 million online job postings
And, 1.6 million of these jobs remain unfilled because of job matching system limitations
Bottom line: Existing job matching systems do a poor job of matching candidates and jobs
Copyright (c) 2013 RDI Labs 3
WHAT’S WRONG WITH EXISTING JOB MATCHING SYSTEMS?
Binary Boolean search logic
• Only jobs/candidates that exactly meet all search/filter criteria are included in results
No preference• Unable to indicate or understand user-defined preference – like
Seattle is preferred over Tacoma
No importance weighting
• Unable to express or understand user-defined importance weighting - like skills are more important than education
No true ranking• All results are of equal value requiring time-consuming human
review
No feedback or tuning
• No visual cues or indications about why items are found or how to explore results to improve search quality
No bidirectional matching
• Job and candidate search and filtering are handled independently rather than bidirectionally
Copyright (c) 2013 RDI Labs 4
TODAY’S JOB SEARCH EXPERIENCE
Copyright (c) 2013 RDI Labs 5
Frustrating Time Consuming Inefficient
TODAY’S JOB SEARCH EXPERIENCE - LINKEDIN
Copyright (c) 2013 RDI Labs 6
KEYWORDS
BINARY FILTERS
+
Many Potentially High Quality Matches
Eliminated from Results
Non-Ranked Results
Non-Ordered Results
No Visual Indications of Results Quality
TODAY’S JOB SEARCH EXPERIENCE - MONSTER
Copyright (c) 2013 RDI Labs 7
KEYWORDS BINARY FILTERS+
TODAY’S JOB SEARCH EXPERIENCE – INDEED.COM
Copyright (c) 2013 RDI Labs 8
KEYWORDS BINARY FILTERS+
TODAY’S JOB SEARCH EXPERIENCE – BEYOND.COM
Copyright (c) 2013 RDI Labs 9
KEYWORDS BINARY FILTERS+
WHAT IF JOB MATCHING SYSTEMS COULD . . .
Copyright (c) 2013 RDI Labs
Analyze candidate and job posts against all search attributes and without excluding results because of a single failed binary Boolean match
Allow users to easily express how much one attribute is preferred over another
Allow users to easily communication the relative importance of attributes
Present users with true rank ordered results with highest quality matches shown first
Provide users with actionable search feedback and enable them to “tune” results in real time to find best matches
Show bidirectionally how well candidates match jobs AND jobs match candidates
With the RDI Labs Query Engine™, they can.
10
NEXT GENERATION JOB MATCHING SYSTEM
Copyright (c) 2013 RDI Labs 11
Relative Importance
Preferences
Targets with Shades of Gray
EASY TO EXPRESS
NEXT GENERATION JOB MATCHING SYSTEM
Copyright (c) 2013 RDI Labs 12
Overall Match Quality
How Well the Job Matches the Candidate
How Well the Candidate Matches the Job
BIDIRECTIONAL SEARCH FEEDBACK
Bidirectional
Easily Tuned
Ranked
SEARCH RESULTS ARE
ADDITIONAL QUERY ENGINE API CAPABILITIES
• Allow addition of search fields as needed/wanted
• Integrate different types of posting information:
• Input data (e.g. user fills in form – high quality information)
• Crawled resumes (e.g. crawler counts words and proximity –medium quality information)
• Social information of uneven quality (e.g. Facebook postings give mixed quality clues about capabilities)
• Soft skill and personality test data (mixed quality information)
• Include proximity analysis
• Skills (e.g. if a candidate knows jquery, they probably know Ajax)
• Location (e.g. if they live in Lake Oswego they are near Portland)
Copyright (c) 2013 RDI Labs 13
PLEASE CONTACT US FOR A DEMONSTRATION AND TO LEARN
MORE ABOUT HOW YOU CAN USE THE QUERY ENGINE API TO CREATE A TRUE
JOB MATCHING SYSTEM
Copyright (c) 2013 RDI Labs 14
CONTACT:
Richard A. Lazar, CEOEmail: [email protected]: (503) 702-0625