Patent Application
20060212448
This application is related to co-pending applications entitled “METHOD AND APPARATUS FOR IDENTIFYING CANDIDATES FOR A POSITION” and “METHOD AND APPARATUS FOR TRACKING CANDIDATE REFERRERS”, both of which were filed simultaneous with the present application. The present application incorporates by reference the entire contents of these two applications in their entirety.
1. Field of the Invention
The present invention relates generally to ranking candidates for a position, and in particular to methods and apparatuses that generate a predicted prospect rating based at least in part on received candidate referrals.
2. Description of the Related Art
Methods and apparatuses involving job searching and placement services are known in the art. Such methods and apparatus are offered, for example, on well known Internet Web sites including www.Monster.com, www.Linkedin.com, www.HotJobs.com, and www.RealContacts.com. Another such method is described in U.S. Published Patent Application No. 2004/0107192, which is incorporated by reference herein in its entirety.
The '192 application, similar to many known methods and apparatuses, discloses a method for providing job searching services, recruitment services and/or recruitment-related services (¶ [0002]). In particular, the '192 application discloses a database 10H which contains employer data (¶ [0130]) applicant data (¶ [0124]) and recruiter data (¶ [0136]). Specific examples of stored data include resumes, references, educational background, etc. The '192 application also discloses methods for restricting access and filtering employee or employer queries, such as preventing current employers from accessing information regarding their current employees (¶ [0127]), and tracking applicants that are pre-approved or prohibited for working for a particular employer (¶ [0135]).
The '192 application and other known methods and apparatuses, however, fail to adequately filter prospective candidates or reach passive prospective candidates (i.e., those not presently actively seeking jobs). As such, the company or recruiter looking for prospective candidates may be inundated with resumes, many of which are not close to the type or quality of candidates the company or recruiter is looking for. Thus, a need exists for an improved method and apparatus for identifying candidates for job openings and for ranking candidates for job openings.
Other problems with the prior art not described above can also be overcome using the teachings of the present invention, as would be readily apparent to one of ordinary skill in the art after reading this disclosure.
Reference will now be made in detail to exemplary embodiments of the present invention. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.
Various embodiments of the present invention are directed at relationship-based networks that connect employers (e.g., companies, educational institutions, government municipalities, etc.) with skilled labor in a job placement context. For discussion purposes, skilled labor can also be referred to as “candidates” or “prospects” for a position with an employer. As would be readily understood by those of skill in the art, skilled labor may include, for example, (1) independent contractors; (2) third party applicants; and (3) existing employees of that employer, such as employees that are employed in a different position than the one being applied for. Other forms of skilled labor are also contemplated.
In addition to the job placement context, the present invention may be used to connect entities in a service or product procurement context. As an example, Company A (a nominal employer) may use one or more embodiments of the present invention to identify Company B (a prospect/candidate) for supplying widgets to Company A. Other applications are also contemplated.
According to one embodiment of the present invention, a method of identifying candidates for a position is disclosed. Preferably, the position is defined in a campaign for the position. In the job placement context, a campaign may comprise a record containing at least a job description, a candidate requirement, and a contact for the campaign. The purpose of the campaign is to identify candidates for the position. Embodiments directed at campaign creation are provided below.
In step 100 (
The campaign creator may create a campaign in step 100 by generating a record including information about the campaign. This record generation may take place, for example, by accessing a graphical user interface (GUI) or the like in step 200 (
According to one embodiment of the present invention, job aspects include company description, job location, job responsibilities, and salary range. According to another embodiment of the present invention, candidate requirements include employment history and educational background. Other information may also be provided, as would be readily understood by those of skill in the art after reading this disclosure.
Once the record has been created for the campaign in step 100, the campaign is published in such a manner that it becomes visible to entities other than the campaign creator. As an example, a representation of all or a portion of the campaign record may be made publicly available on a job postings Web site and/or sent to a plurality of contacts. Campaign publishing may publish complete campaign records, partial campaign records, or non-record information (e.g., a banner advertisement with links to a campaign record on a job postings Web site)—collectively referred to as published “campaign information”. Embodiments directed at publishing campaign information are provided below.
According to one embodiment of the present invention, campaign information is published by sending in step 110 (
According to another embodiment of the present invention, messages sent in step 110 may be personalized for each contact or class of contact. Personalization allows for the system to take into consideration differences between various contacts. To illustrate, a prospective candidate may desire detailed information about the company description and working environment, whereas a recruiter may desire only information involving basic job requirements and salary range. The present invention contemplates several different methods for personalizing campaign information as described in greater detail below.
According to one embodiment, the campaign creator may initiate a personalized campaign message in step 300 (
As previously described, campaign information is preferably sent in step 110 to at least one contact, and, in some applications, messages sent to the contact(s) may be personalized for that contact or class of contact (steps 300, 310, 320, 330, 340). Contacts are entities that are known or identified prior to or contemporaneous with publishing the campaign. Contacts may include candidates for the position and/or candidate referrers that refer candidates for the position. Preferably, contacts are identified by the campaign creator or system initiating a contact list in step 400 (
According to one embodiment of the present invention, candidate and/or referrer profiles are maintained to supplement the contact identification process. As previously noted, candidates and referrers represent two classes of contacts that may be contacted by the system, where candidates represent prospects for the job and referrers represent entities likely to refer prospects for the job. Candidate and referrer profile maintenance is discussed individually below, as different information may be pertinent to candidates and referrers.
Candidate profiles may be maintained to supplement the identification of candidate contacts for the campaign. A Web site or other software may maintain a plurality of candidate profiles, including information such as employment history, educational background, preferred job aspects, contact information, etc. Preferably, the system includes a method of maintaining or updating candidate profiles over time as shown in
Using the profile information described above, candidates for a position may be automatically identified by the system in step 430 by comparing defined job aspects in the campaign to information in the candidate profiles. If set aspects are met, such as X profile has a sufficient educational background and employment history match to defined campaign aspects, the candidate with X profile is identified as a contact for campaign information.
Filters may be included as part of performing step 430 (
Similar to candidate profiles, candidate referrer profiles may be maintained to supplement the identification of candidate referrers for the campaign. A Web site may maintain a plurality of referrer profiles, including referral history and contact information. Referrers may include, for example, any entity that has referred candidates in the past or has the potential to refer candidates in the future. To illustrate, referrers may include individuals on a corporation's employee list (e.g., an email contact list), a list of recruiters, a list of recruiter agencies, a list of temporary staffing providers, etc.
Referrers may be known in advance or identified using Internet searching and sourcing technology or the like. As an example, referrers for a position may be identified in step 430 by comparing defined job aspects in the campaign to the candidate referrer profiles, and/or based on a referrer rating for each referrer. If set aspects are met, such as X profile has position in the company that matches defined campaign aspects and the candidate referrer has a referrer rating of at least Y, the candidate referrer with X profile is identified as a contact for campaign information in step 430. Additional disclosure regarding the referrer rating is provided below in reference to determining a candidate's referral rating.
Once contacts have been identified and a selected contact list generated (step 440), the campaign information can then be sent in step 110 (
Once the campaign information has been published, the system may receive candidate profiles in step 120 (
Candidates receive the campaign information in step 620, from sent campaign information in step 600, from forwarded messages in step 650, or from other publication means. As with the referrers, candidates may also perform many actions. To illustrate, candidates may forward the campaign information to other candidates in step 660, or submit their own profile in step 670. Other actions taken by candidates and/or referrers are also contemplated. See, for example, the screen shot of
Once candidates and referrers have taken some action on the campaign information, the system then receives candidate profiles in steps 120, 680. This includes profiles sent to the system from referrers in step 630, 640 and from candidates in step 670. In addition, the system may also review candidate profiles already stored on the system, such as candidates who responded to other campaigns in the past. Thus, the system may receive campaign profiles in step 680 from a plurality of internal and external sources.
According to one embodiment of the present invention, the system also tracks campaign information recipients as part of the sending campaign information in step 110 (
While the collection of candidate profiles itself (steps 110, 120, 130) as described in the previous embodiments is useful, one significant problem with existing systems is the inundation of candidate profiles with many that are of poor quality. Thus, one embodiment of the present invention is directed at ranking candidate profiles in step 130 that have been received and/or reviewed by the system.
Candidate profiles may be ranked in step 130 based on a candidate profile rank. The candidate profile rank generally refers to the strength of a given candidate's profile in comparison to other candidates. Many factors may be weighed in arriving at the candidate profile rank for a given candidate profile. One factor used in determining a candidate profile rank is a candidate referral rating. A candidate referral rating may be defined as the overall strength of references for that candidate. Examples of determining a candidate referral rating are provided below. See also the exemplary screen shot of
As one example, assume a campaign is sent to Employee X, and Employee X recommends a former classmate Candidate Y. Assume further that Candidate Z applies directly for the same position that Candidate Y was recommended for. Candidate Y may be given a higher referral rating than Candidate Z because Candidate Y received a referral, whereas Candidate Z did not. This factor can be referred to as the “Source” factor.
As another example, assume a campaign is sent to Employee A, who is an assistant manager, and Employee B, who is a teller. Assume further that Employee A recommends Candidate Y and Employee B recommends Candidate Z. Candidate Y may be given a higher referral rating than Candidate Z, because Employee A has a greater impact on the hiring decisions of the company than Employee B. This factor can be referred to as the “Hiring Manager” factor.
As another example, assume a campaign is sent to both Employee F and Employee G. Assume further that Employee F recommends Candidate Y, who Employee F supervised at a prior employer. Assume further that Employee G recommends Candidate Z, who Employee G heard speak at a conference but never worked with. Candidate Y may be given a higher referral rating than Candidate Z, due to the knowledge of the candidates' work. This factor can be referred to as the “working knowledge” factor.
As another example, assume a campaign is sent to both Employee M and Employee N. Assume further that Employee M strongly recommends Candidate Y, and Employee N mildly recommends Candidate Z. Candidate Y may be given a higher referral rating than Candidate Z, due to the strength of the referral itself. This factor can be referred to as the “recommendation strength” factor.
As another example, assume a campaign is sent to Referrer R. Assume further that Referrer R refers a candidate, with Referrer R being “D” degrees away from the company. The weighting factor can then be multiplied by a score of 0.5d. If d=0, i.e., the recommendation is provided by an employee of the company then this multiplier is just 1. If the recommendation is provided by someone distanced from the company than=>if d=1, then this multiplier is 0.5. If d=2, then this multiplier is 0.25. This factor can be referred to as the “connection and distance” factor.
According to one embodiment of the present invention, the aforementioned factors are weighted and summed to achieve a net score for a candidate. One exemplary weighting structure is provided in the table below. Other weightings are also contemplated.
As disclosed above, a candidate's recommendations are summed and weighted. Preferably, referrer ratings of the referrers themselves may also be calculated and balanced against the candidate's recommendations to achieve an overall candidate referral rating. However, it should be appreciate that a candidate's referral rating may be on the recommendations alone, the referrer rating alone, or a combination of the recommendations and referrer rating. Embodiments directed at calculating a referrer rating are provided below.
A referrer rating preferably is based on a plurality of factors such as a position of the referrer within a company, a referral history of the referrer, etc. As an example, if a hiring manager is the ultimate decision maker for filling a position and that hiring manager recommends a candidate, the referrer rating is preferably given a high value indicating the strength and importance of the referrer. This is similar to the Hiring Manager factor previously described.
In addition, if a particular referrer has a strong referral history, the referrer rating is also preferably given a high value indicating the past success of this particular referrer. A referral history may be defined as any action involving the treatment of candidates previously referred by the referrer. Exemplary actions involve a hiring rate of referred candidates, an interview rate of referred candidates, and a review rate of referred candidates. A review rate of referred candidates may be defined as the rating given to referred candidates by the campaign creator.
As with the recommendations for the candidate, these factors involved in determining a referrer rating may also be weighted. One exemplary weighting structure is provided in the table below. Other weightings are also contemplated.
According to one embodiment of the present invention, the weightings of a given referrer's referral history are added together to determine a net score. A “batting average” is then calculated by dividing the net score by the total number of rated recommendations for that referrer. As an example, if the if Referrer X has referred three candidates in the past, Candidates A, B, C, and Candidate A was hired, Candidate B was rated an average prospect by the campaign creator, and Candidate C was rated a prospect not worth pursuing by the campaign creator, the calculation would be=>(4+0−1)/3=1.
According to one embodiment of the present invention, for each recommendation a candidate receives, the weighted sum for that recommendation is then multiplied by the referral rating (i.e., the batting average) for that particular referrer. This process may be used for each recommendation, and the results totaled to achieve a net candidate referral rating.
In particular, a method for calculating the PPR for a candidate is shown in the flowchart of
If the candidate prospect was referred, the method proceeds to steps 2010 through 2040. It should be appreciated that steps 2010, 2020, 2030 and 2040 may be performed in any order, and/or may be performed simultaneously depending on the particular implementation at hand. Thus, the order shown is purely for description purposes only.
In step 2010, the method calculates a working knowledge factor for the referral. In step 2020, the method calculates a recommendation strength for the referral. In step 2030, the method calculates a relationship of the referrer to the hiring manager. And finally, in step 2040, the method calculates a referrer batting average for the referrer. The factors calculated in steps 2010, 2020, 2030 and 2040 are analogous to factors, and exemplary weightings provided in Table 1 and Table 2.
Irregardless of whether the candidate was referred, the method in step 2050 calculates a connection distance between the candidate and the company. The method then calculates in step 2060 a job fit, such as by comparing a candidate profile to a campaign record. Finally, in step 2070 the method calculates the PPR using the outcome of steps 2010, 2020, 2030, 2040, 2050 and 2060. This PPR can be used to rank and/or group candidates as will be described in greater detail below.
As described above, for each candidate a candidate referral rating (preferably part of an overall PPR) is determined. Candidate profiles may be ranked and/or grouped based wholly on the candidate referral ratings. As an example, candidates may be grouped into three categories: (1) Strong Prospects; (2) Average Prospects; and (3) Poor Prospects. Preferably, grouped candidate profiles are also ranked within each group based on the candidate referral rating. The automatic ranking or grouping of candidates can be referred to as the predicted prospect ranking (PPR), as it is predictive of the likelihood of acting on a given candidate. This process is described in greater detail below.
In step 710 (
According to another embodiment of the present invention, the PPR calculation in step 730 also incorporates a comparison of candidate profiles to campaign requirements. As an example, candidates with close matches between educational background and education requirements in the campaign record may be given a higher PPR than candidates with lower matches. Similarly, candidates that are willing to move to a location in which the job is located may be given a higher PPR than candidates that have indicated an unwillingness to move. These factors can be determined by comparing the candidate profiles to the campaign record.
As described above, the disclosed method includes techniques for identifying candidates for a position by sending campaign information to a plurality of contacts (step 110), receiving candidate referrals from the plurality of contacts (step 120), and ranking candidate profiles based on candidate profile ranks (step 130) wherein the candidate profile ranks are based at least in part on a referral rating. Such a process may be done largely automatically by a system used to create the campaign.
It is further contemplated, however, to provide a second ranking of candidate profiles referred to as an explicit prospect rating (EPR). Specifically, once the system has ranked or grouped candidate profiles based on PPR in step 730, the campaign creator or other reviewer may further manually rank the PPR ranked/grouped candidate profiles in step 760. The campaign creator/reviewer may decide some candidates are (1) Strong Prospects; (2) Average Prospects; and (3) Poor Prospects. This ranking results in calculation of an Explicit Prospect Rating (EPR), which is based in part on the PPR and in part on the explicit ranking by the campaign creator or other reviewer. Candidates may then be re-ranked or grouped in step 770 based on this EPR, and forwarded on to or displayed for a hiring manager or other like individual in step 780 to conduct follow up communications as needed.
According to another embodiment of the present invention, a method is provided for updating one or more of the algorithms, or weightings used by the algorithms, for calculating the candidate referral rating or the PPR. As an example, the system may compare the PPR with the EPR to identify a PPR rating accuracy. If there is a difference between the PPR and EPR, the system may adjust one or more of the noted algorithms or weightings to improve the PPR rating accuracy. As an example, if the EPR reflects that the campaign creator/reviewer placed more emphasis on the candidate referral rating than a comparison between the candidate profile and the campaign record, then the candidate referral rating may be more heavily weighted. Similarly, if the EPR reflects that the campaign creator/reviewer placed more emphasis on the comparison between the candidate profile and the campaign record, then the comparison may be more heavily weighted. Such a process may be done automatically or manually.
One exemplary technique for updating one or more of the algorithms or weightings comprises use of Baye's theorem. Baye's theorem is directed at updating estimates of conditional probability of a hypothesis given certain evidence (e.g. the probability that a person is a good prospect based on the fact that they were strongly recommended by a coworker), based on the past likelihood of the evidence given the hypothesis (e.g. the probability someone is strongly recommended by a coworker given that they were rated a good prospect).
Baye's theorem can be written as follows:
P(H/E)=P(E/H)×P(H)|P(E)
As written above, Baye's theorem says that the probability of a particular hypothesis given a particular item of evidence can be computed based on the probability of the evidence given the hypothesis in past instances, times a normalization factor: the probability of the hypothesis divided by the probability of the evidence. For a more thorough discussion, see http://en.wikipedia.org/wiki/Bayesian_analysis.
Baye's theorem may be applied to PPR computations by dividing each factor in the equation by a scaling factor to convert it to a probability between 0 and 1 and viewing it as an initial estimate of conditional probability. A so called “naive Bayesian classifier” makes the simplifying assumptions that each of the conditional probabilities is independent. Under this assumption, the probability of the hypothesis Hi given a set of items of evidence Ej can be computed as the product of P(Hi|Ej) for each j. The most likely hypothesis is the one that maximizes this product; this is called the maximum a posteriori (MAP) probability. Although the independence assumption is often violated, it can be proven in a number of cases that the hypothesis chosen through MAP is nonetheless the most likely one.
In brief, Baye's theorem provides a way to update the weightings (conditional probabilities) in the algorithm(s) based on past results, and to compute an improved classification of a prospect based on the evidence. Other techniques also exist for updating the algorithm(s) and/or weighting(s), as would be readily apparent to one of ordinary skill in the art after reading this disclosure.
According to yet another embodiment of the present invention, a method of selecting positions for a candidate is provided. Preferably, a campaign is created as similarly described in step 100, such that the campaign includes at least one defined job aspect. Once the job has been created, a user may access a campaign website or the like in step 800 (
In step 820, the system compares campaign job aspects (defined in step 100) to the candidate's preferred job aspects from the candidate profile (defined in step 810). This comparison may be done automatically (e.g., each time a user accesses the campaign website in step 800), in response to an event (e.g., when a new campaign is created in step 100), and/or in response to user query (e.g., the user selecting a search feature on the job postings website). The comparison in step 820 provides a list of jobs from campaigns that are filtered in step 830 and displayed for the user. The user than can select positions of interest in step 840 (or alternatively forward the results on to another individual or recommend another individual), and submit their profile in step 850. In this manner, a user can also benefit from the teachings of the present invention by directly investigating campaigns on a job postings website.
According to another embodiment of the present invention, an interface is provide for integrating a system that identifies candidates for a position with other systems. As an example, an XML interface may be provided for integrating with an Applicant Tracking System. Such a system would be understood by those of skill in the art after reading this disclosure.
A system useable with various embodiments of the present invention is shown in the block diagram of
Preferably, each of terminals 930, 940, 950 and web server 910 include a programmable microprocessor with appropriate peripheral devices including network communication equipment to perform the various method steps described in the aforementioned embodiments. Those of skill in the art will appreciate that the present invention may be provided on many different types of processors (e.g., Intel, AMD, etc.) and in multiple formats (e.g., Macintosh, Windows, Linux) including web based communication protocols and languages. Thus, the system shown in
The foregoing description of various embodiments of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention. The embodiments were chosen and described in order to explain the principles of the invention and its practical application to enable one skilled in the art to utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated.
