Buyer-provider matching algorithm

Information

  • Patent Grant
  • 10650332
  • Patent Number
    10,650,332
  • Date Filed
    Monday, June 1, 2009
    15 years ago
  • Date Issued
    Tuesday, May 12, 2020
    4 years ago
Abstract
In a services exchange medium, buyers are able to search and hire service providers to get projects done quickly and cost effectively. A buyer-provider matching algorithm uses two scores to calculate a “Provider Search” score for each service provider: a “Reputation” score and a “Provider Match” score. In some embodiments, the “Reputation” score is a quantitative metric score of a service provider's overall reputation within the services exchange medium. In other embodiments, the “Reputation” score is configured to enhance the “Provider Match” score. Since reputation is an important attribute when searching for a qualified service provider, the “Provider Search” score takes into consideration the “Reputation” score. A provider results list generated from a provider search is sorted by the “Provider Search” score. As such, the provider results list is sorted in a significant manner useful to the buyer searching for the qualified service provider.
Description
FIELD OF THE INVENTION

The present invention relates to matching algorithms. More particularly, the present invention relates to a buyer-provider matching algorithm.


BACKGROUND OF THE INVENTION

Many job sites that provide a community for job providers and job seekers contain a wealth of resources for both the job providers and the job seekers. However, prior art job sites suffer from a number of shortcomings. For example, a job site that returns a provider search result listing job seekers alphabetically by name presents an inconvenience for a job provider, because the provider search result has insignificant value in terms of finding a qualified job seeker. The provider search result listing job seekers based only on a keyword match also presents an inconvenience for the job provider, because the provider search result does not take into consideration of other important attributes, such as how well a job seeker is regarded in the community. For example, the job seeker having a proper education and qualifications may not work well with others or may not have good work ethics. The provider search result based only on the keyword match do not reflect such attributes. As such, the ability to organize data properly and return the data in a significant manner is important.


The present invention addresses at least these limitations in the prior art.


SUMMARY OF THE INVENTION

An object of the present invention is to provide a buyer-provider matching algorithm within a services exchange medium. In the services exchange medium, buyers find and hire service providers “on demand” to get projects done quickly and cost effectively.


In one aspect, a computerized method of generating a provider results list comprises calculating a provider search score for each service provider within a services exchange medium and sorting the provider results list based on the provider search score. The provider search score is a sum of at least one provider match score enhanced by a reputation score. The provider search score is stored on a computing device. The reputation score in some embodiments is dependent on at least one of customer satisfaction, earnings, and participation by a service provider within the services exchange medium. A provider match score in some embodiments is based on at least one of match between a search text and a section of a profile, and match between a the search text and a part of a project completed by the service provider. In some embodiments, the section of the profile is a provider tagline section, a provider user ID section, a provider name section, a summary services description section, a keywords section, a skills section, an about us section, a detailed services exchange section, a credentials section, or an experience section. A number of points for a match between the search text and the section of the profile comprises a first hit value and a total secondary hit score. The calculating comprises adjusting the total secondary hit score by a secondary hits magnifier. The secondary hits magnifier is modifiable. The calculating further comprises adding the first hit value and the total secondary hit score together, and multiplying an absolute weight to a sum of the first hit value and the total secondary hit score. The absolute weight is modifiable. In some embodiments, the part of the project is a project name or a project description. A number of points associated with a match between the search text and the project name is modifiable. A number of points associated with a match between the search text and the project description is modifiable.


In another aspect, a provider search method within a services exchange medium comprises obtaining a search text, calculating a first score based on a reputation of a service provider, computing a plurality of second scores based on matches between the search text and service provider data, determining a third score based on the plurality of second scores enhanced by the first score, wherein the third score is stored on a computing device, repeating steps calculating, computing, determining for all service providers within the services exchange medium, and generating a provider results list. Typically, the provider results list is sorted by the third score. The reputation in some embodiments is dependent on at least one of customer satisfaction, earnings, and participation by the service provider within the services exchange medium. The method in some embodiments further comprises comparing the search text with sections of a profile belonging to the service provider, and checking the search text against parts of an at least one project completed by the service provider. The sections include provider tagline section, a provider user ID section, a provider name section, a summary services description section, a keywords section, a skills section, an about us section, a detailed services exchange section, a credentials section, and an experience section. The parts include a project name and a project description. A number of points for a match between the search text and a section of the profile comprises a first hit value and a total secondary hit score. The comparing comprises adjusting the total secondary hit score by a secondary hits magnifier. The secondary hits magnifier is modifiable. The comparing further comprises adding the first hit score and the total secondary hit score together, and multiplying an absolute weight to a sum of the first hit value and the total secondary hit score. The absolute weight is modifiable. A number of points for a match frequency between the search text and the project name is modifiable. A score for a match frequency between the search text and the project description is modifiable.


Yet, in another aspect, a system for creating portable interactive windows comprises a processor and an application executed by the processor. The application is for calculating a provider search score for each service provider within a services exchange medium and sorting the provider results list based on the provider search score. The provider search score is a sum of at least one provider match score enhanced by a reputation score. The reputation score in some embodiments is dependent on at least one of customer satisfaction, earnings, and participation by a service provider within the services exchange medium. A provider match score in some embodiments is based on at least one of match between a search text and a section of a profile, and match between a the search text and a part of a project completed by the service provider. In some embodiments, the section of the profile is a provider tagline section, a provider user ID section, a provider name section, a summary services description section, a keywords section, a skills section, an about us section, a detailed services exchange section, a credentials section, or an experience section. A number of points for a match between the search text and the section of the profile comprises a first hit value and a total secondary hit score. The calculating comprises adjusting the total secondary hit score by a secondary hits magnifier. The secondary hits magnifier is modifiable. The calculating further comprises adding the first hit value and the total secondary hit score together, and multiplying an absolute weight to a sum of the first hit value and the total secondary hit score. The absolute weight is modifiable. In some embodiments, the part of the project is a project name or a project description. A number of points associated with a match between the search text and the project name is modifiable. A number of points associated with a match between the search text and the project description is modifiable.


Yet, in another aspect, a computerized method of enhancing provider match scores comprises determining a first match score for each section of a profile stored on a computing device, determining a second match score based on a number of matches between a search text and a project title of each project completed by a service provider, and determining a third match score based on a number of matches between the search text and a project description of each project completed by the service provider. The method also includes adding together first match scores, the second match score, and the third match score to obtain a total match score. The method further includes multiplying an enhancement value to the total match score, the enhancement value is dependent on reputation of the service provider





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a table of exemplary sections of a profile in accordance with some embodiments of the present invention.



FIG. 2 illustrates a table of project name match frequencies and corresponding score values in accordance with some embodiments of the present invention.



FIG. 3 illustrates a table of project description match frequencies and corresponding score values in accordance with some embodiments of the present invention.



FIG. 4 illustrates a table of steps to derive a Provider Match score in accordance with some embodiments of the present invention.



FIG. 5 illustrates an exemplary provider results list in accordance with some embodiments of the present invention.



FIG. 6 illustrates a method of providing the returned provider results list in accordance with some embodiments of the present invention.



FIG. 7 illustrates a graphical representation of an exemplary computing device in accordance with some embodiments of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

In the following description, numerous details are set forth for purposes of explanation. However, one of ordinary skill in the art will realize that the invention may be practiced without the use of these specific details. Thus, the present invention is not intended to be limited to the embodiments shown but is to be accorded the widest scope consistent with the principles and features described herein or with equivalent alternatives.


Reference will now be made in detail to implementations of the present invention as illustrated in the accompanying drawings. The same reference indicators will be used throughout the drawings and the following detailed description to refer to the same or like parts.


Embodiments of the present invention are directed to a buyer-provider matching algorithm within a services exchange medium. Preferably, in a services exchange medium, buyers are able to post projects and to search and hire service providers “on demand” to get the projects done quickly and cost effectively. In the services exchange medium, a service provider creates a profile in order to be immediately connected to a buyer looking for the service provider's expertise. Typically, the service provider's profile describes the service provider's professional abilities. The buyer is able to review the service provider's profile to make an instant hiring decision.


The buyer-provider matching algorithm in some embodiments calculates a “Provider Search” score for each service provider within the services exchange medium. A provide results list generated from a provider search is sorted by the “Provider Search” score. In some embodiments, the buyer-provider matching algorithm preferably uses two scores to calculate the “Provider Search” score: a “Reputation” score and a “Provider Match” score. Each, in turn, is described below.


The “Reputation” score is a quantitative metric which represents the service provider's reputation within the services exchange medium. In some embodiments, the “Reputation” score is dependent on factors such as customer satisfaction, earnings, and/or participation by the service provider within the services exchange medium. Other factors are possible. The “Reputation” score typically ranges from 0% to 100%. If the service provider's “Reputation” score is 11%, then the service provider's reputation is better than 11% of other service providers within the services exchange medium. If the service provider's “Reputation” score is 100%, then the service provider's reputation is better than all other service providers within the services exchange medium. In other embodiments, the “Reputation” score is configured to enhance the “Provider Match” score.


As mentioned above, the buyer-provider matching algorithm also uses the “Provider Match” score to calculate the “Provider Search” score. In some embodiments, if a search text is entered as part of the provider search, then the search text is compared against the service provider's profile and against past projects completed by the service provider within the services exchange medium. In this discussion, assume that the search text is “php.”



FIG. 1 illustrates a table 100 of exemplary sections of a profile in accordance with the present invention. In some embodiments, the “php” search text is compared against different sections of the profile. Each section is associated with an absolute weight, which is variable and adjustable. The absolute weight typically ranges from 0 to 100. In some embodiments, the absolute weight are determined by the services exchange medium. As shown in an “Absolute Weight” column 160, a “Provider Tagline” section 105 has an absolute weight of 100, a “Provider User ID” section 110 has an absolute weight of 15, a “Provider Name” section 115 has an absolute weight of 75, a “Summary Service Description” section 120 has an absolute weight of 75, a “Service Tags/Keywords” section 125 has an absolute weight of 75, a “Skills” section 130 has an absolute weight of 75, an “About Us” (e.g. introduction) section 135 has an absolute weight of 25, a “Detailed Service Description” section 140 has an absolute weight of 50, a “Provider Credentials” section 145 has an absolute weight of 25, an “Experience” section 150 has an absolute weight of 25, and a “Provider Primary Location” section 155 has an absolute weight of 0. Other sections of the profile and absolute weights that make up the “Provider Match” score are possible. In some embodiments, a distinction is made between certified skills and uncertified skills. Certified skills typically have a higher absolute weight than uncertified skills.


A “First Hit” column 165 indicates whether a match between the “php” search text and a corresponding section of the profile has occurred during the provider search. Specifically, once the “php” search text is found in that section, a first hit for that section is a one; otherwise, if the section does not contain the “php” search text, then the first hit for that section remains a zero. As illustrated in FIG. 1, a first hit for the “Provider Tagline” 105 is a one, a first hit for the “Service Tags/Keywords” section 125 is a one, and a first hit for the “Detailed Service Description” 140 is a one, because the “php” search text is found in those section. In some embodiments, each section also has a secondary hit magnifier shown in a “Secondary Hits Magnifier” column 170. The secondary hit magnifier, which is variable and adjustable, is used to increase the service provider's “Provider Match” score when the “php” search text is found more than once in that corresponding section. Specifically, a number of secondary hits for that section, shown in a “Secondary N Hits Count” column 175, is multiplied with that section's secondary hits magnifier to get a total secondary hit score, shown in a “Total Secondary Hit Score” column 180. In some embodiments, the secondary hits magnifier values are determined by the services exchange medium.


As illustrated in FIG. 1, the secondary hits magnifier for each section is set to zero, although the secondary hit magnifier values for the sections are able to be set to any and/or different values. As such, regardless how often the “php” search text appears in, for example, the “Detailed Service Description” section 140 more than once, the corresponding total secondary hit score is zero. A total score for each section, shown in a “Total Score” column 185, is determined by adding together the corresponding total secondary hit score and the first hit. The total score for each section is then multiplied with the corresponding absolute weight to determine a calculated weight, shown in a “Calculated Weight” column 190. A total calculated weight 195 is determined by adding together the calculated weight for each section. The total calculated weight 195 is 225. It should be apparent that the table values as illustrated are exemplary only and do not limit the scope of the invention.


In some embodiments, the “php” search text is also compared against past projects completed by the service provider within the services exchange medium. Specifically, the “php” search text is compared against project names of X most recently completed projects within the services exchange medium in the past Z months. And, the “php” search text is compared against project descriptions of Y most recently completed projects within the services exchange medium in the past Z months. Typically, a value of X is 20, a value of Y is 10, and a value of Z is six. Other values of X, Y and Z are possible.



FIG. 2 illustrates a table 200 of project name match frequencies and corresponding scores in accordance with the present invention. The project name match frequencies are shown in a “Frequencies” column 205, and the corresponding scores are shown in a “Score” column 210. The more project name matches that occur during the provider search, a higher score is added to the service provider's “Provider Match” score. For example, the service provider is awarded with a score of 100 if the service provider, within the last six months, has completed one project having the “php” search text as part of the project name. The service provider is awarded a maximum score of 1050 if the service provider, within the last six months, has completed at least 20 projects having the “php” search text as part of the project names. The project name match frequencies and corresponding scores are variable and adjustable. Other project name match frequencies and corresponding scores that make up the “Provider Match” score are possible.



FIG. 3 illustrates a table 300 of project description match frequencies and corresponding scores in accordance with the present invention. The project description match frequencies are shown in a “Frequencies” column 305, and the corresponding scores are shown in a “Score” column 310. The more project description matches that occur during the provider search, a higher score is added to the service provider's “Provider Match” score. For example, the service provider is awarded with a score of 50 if the service provider, within the last six months, has completed one project having the “php” search text as part of the project description. The service provider is awarded a maximum score of 275 if the service provider, within the last six months, has completed at least 10 projects having the “php” search text as part of the project descriptions. The project description match frequencies and corresponding scores are variable and adjustable. Other project description match frequencies and corresponding scores that make up the “Provider Match” score are possible.



FIG. 4 illustrates a table 400 of steps to derive the “Provider Match” score in accordance with the present invention. For example, assume that the service provider's “Reputation” score is 11%. Since the “Reputation” score is used to enhance the “Provider Match” score, an “E Score” multiplier 425 is 1.11. However, if the service provider had a perfect “Reputation” score of 100%, then the “E Score” multiplier 425 is 2, which is in some embodiments the maximum multiplier.


As illustrated in FIG. 4, the “php” search text is found in the following areas: three times in the “Detailed Service Description” section 140 of the profile, one time in the “Service Tags/Keywords” section 125 of the profile, one time in the “Provider Tagline” section 105 of the profile, five times in project descriptions 405 of projects completed within the past six months, and eight times in project names 410 of the projects completed within the past six months. As such, points 420 received for the “Detailed Service Description,” the “Service Tags/Keywords,” the “Provider Tagline,” the “Past Project Description,” and the “Past Project Name” are 50, 75, 100, 200, and 660, respectively. The points 420 are based on the frequencies 415 of the “php” search text found in each of the different areas, referencing the “Calculated Weight” column 190 of FIG. 1, and the “Score” columns 210 and 310 of FIGS. 2-3, respectively. Each of the points 420 received is multiplied with the “E Score” multiplier 425 (e.g. 1.11). As such, the “Reputation” score is configured to enhance the “Provider Match” score. Final scores 430 received for the “Detailed Service Description,” the “Service Tags/Keywords,” the “Provider Tagline,” the “Past Project Description,” and the “Past Project Name” are 55.5, 83.25, 111, 222, and 732.6, respectively. A total final score 435 is determined by adding together the final score for each area. The total final score 435 is 1204 (rounded from 1204.35). In some embodiments, the total final score 435 is the “Provider Search” score.


As mentioned above, the provider results list is sorted by the “Provider Search” score. Since reputation is an important attribute when searching for a qualified service provider, the “Provider Search” score takes into consideration the “Reputation” score. As such, the provider results list is advantageously sorted in a significant manner useful to the buyer searching for a qualified service provider. In some embodiments, the “Provider Search” score also takes into the service provider's performance within the services exchange medium.



FIG. 5 illustrates an exemplary provider results list 500 in accordance with the present invention. In some embodiments, the provider results list 500 is sorted by the “Provider Search” score. As illustrated in FIG. 5, the service provider with the “Provider Search” score of 1204, as calculated above, is MechTechnologies. Bhatia Systems ranks higher than MechTechnologies in the provider results list 500 because Bhatia System has a higher “Provider Search” score than MechTechnologies. Bhatia Systems has a “Provider Search” score of 1, 264. In other embodiments, result rankings 505 and “Provider Search” scores 510 are not shown in the provider results list 500. Yet, in other embodiments, if no search text is entered as part of the provider search, then the “Reputation” score of each service provider is the final determiner of rank. As such, the provider results list 500 is sorted by the “Reputation” score.



FIG. 6 illustrates a process 600 of providing the provider results list in accordance with the present invention. At step 605, the buyer-provider matching algorithm obtains a search text (e.g. “php”) entered by a user. At step 610, the buyer-provider matching algorithm calculates a first score for a service provider within the services exchange medium. Typically, the first score is the “Reputation” score described above. At step 615, the buyer-provider matching algorithm computes a plurality of second scores. Typically, the plurality of second scores is computed by comparing the search text with the service provider's profile and with the past projects completed by the service provider within the services exchange medium. The plurality of second scores is the “Provider Match” score described score. At step 620, the buyer-provider matching algorithm determines a third score. Typically, the third score is derived by using the first score and the plurality of second scores. The third score is the “Provider Search” score described above. Step 625 determines whether a third score has been determined for each service provider within the services exchange medium. If a third score has been determined for each service provider within the services exchange medium, then at step 630, a provider results list is generated and is sorted by the third score. The process 600 ends. Alternatively, a first score is calculated for another service provider at step 610 and the process 600 continues.


The steps of the present invention are embodied in machine-executable instructions. These instructions can be used to cause a general-purpose or special-purpose processor that is programmed with the instructions to perform the steps of the present invention. Alternatively, the steps of the present invention can be performed by specific hardware components that contain hardwired logic for performing the steps, or by any combination of programmed computer components and custom hardware components.


In some embodiments, the present invention is provided as a computing device. FIG. 7 illustrates a graphical representation of an exemplary computing device 700 in accordance with the present invention. The computing device 700, such as a server stores, serves, computes, communicates, generates and/or displays information about the service provider within the services exchange medium. The service provider uses an Internet-ready device, such as a personal computer, to interact with the computer device 700 to create the profile and to generate the online professional badge. In general, a hardware structure suitable for implementing the computing device 700 includes a network interface 702, a memory 704, processor 706, I/O device(s) 708, a bus 710 and a storage device 712. The choice of processor is not critical as long as the processor 706 has sufficient speed. The memory 704 is any conventional computer memory known in the art. The storage device 712 is a hard drive, CDROM, CDRW, DVD, DVDRW, flash memory card or any other storage device. The computing device is able to include one or more network interfaces 702. An example of a network interface includes a network card connected to an Ethernet or other type of LAN. The I/O device(s) 708 are able to include one or more of the following: keyboard, mouse, monitor, display, printer, modem and other devices. Software used to create the online professional badge is likely to be stored in the storage device 712 and memory 704 and processed as an application is typically processed.


Examples of suitable computing devices include a personal computer, laptop computer, computer workstation, a server, mainframe computer, mini-computer, handheld computer, personal digital assistant, cellular/mobile telephone, smart appliance, gaming console or any other suitable computing device.


The present invention has been described in terms of specific embodiments incorporating details to facilitate the understanding of principles of construction and operation of the invention. Such reference herein to specific embodiments and details thereof is not intended to limit the scope of the claims appended hereto. A person skilled in the art would appreciate that various modifications and revisions to the buyer-provider matching algorithm will occur. Consequently, the claims should be broadly construed, consistent with the spirit and scope of the invention, and should not be limited to their exact, literal meaning.

Claims
  • 1. A non-transitory computer-readable medium storing instructions that, when executed by a computing device, cause the computing device to perform a method comprising: obtaining a timeframe, specified by a buyer, that includes a number of months relative to a current time;communicatively coupling with at least one data store that together stores service provider profiles and projects completed by services providers within a services exchange medium;assessing a services exchange medium reputation score for each service provider in the services exchange medium;based on a determination that a search text has been specified by the buyer, for each service provider profile stored in the at least one data store, calculating a provider search score for a respective service provider profile, wherein the provider match score is based upon a match between the search text entered by the buyer and a section of the respective service provider profile, wherein the respective service provider profile comprises multiple sections entered by the service provider associated with the respective service provider profile, wherein the section of the respective service provider profile is weighted according to conditions established by the services exchange medium to contribute to the provider match score upon match between the section and the search text, wherein the provider match score as a first hit value is further modified according to one or more total secondary hit scores of subsequent matches of the section and the search text in response to the established weighting conditions, wherein a sum of the first hit value and the total secondary hit score determines a participation in a calculation of an associated section of the respective service provider profile and wherein the provider search score is also based upon a match between the search text entered by the buyer and a part of each project that is completed by the service provider associated with the respective service provider profile and within the timeframe specified by the buyer; andadjusting the provider search score by the services exchange medium reputation score of the service provider associated with the respective service provider profile; andsorting a provider results list based on adjusted provider search scores;based on a determination that a search text has not been specified by the buyer, sorting the provider results list based on the services exchange medium reputation score; andpresenting the provider results lists in a user interface.
  • 2. The non-transitory computer-readable medium of claim 1 wherein the services exchange medium reputation score is dependent on at least one of customer satisfaction, earnings, and participation by a service provider within the services exchange medium.
  • 3. The non-transitory computer-readable medium of claim 1 wherein a number of points for the match between the search text and the section of the profile comprises the first hit value and the total secondary hit score.
  • 4. The non-transitory computer-readable medium of claim 3 wherein the calculating comprises adjusting the total secondary hit score by a secondary hits magnifier.
  • 5. The non-transitory computer-readable medium of claim 4 wherein the secondary hits magnifier is modifiable.
  • 6. The non-transitory computer-readable medium of claim 4 wherein the calculating further comprises adding the first hit value and the total secondary hit score together, and multiplying an absolute weight to a sum of the first hit value and the total secondary hit score.
  • 7. The non-transitory computer-readable medium of claim 6 wherein the absolute weight is modifiable.
  • 8. The non-transitory computer-readable medium of claim 1 wherein the part of the project is a project name or a project description.
  • 9. The non-transitory computer-readable medium of claim 8 wherein a number of points associated with a match between the search text and the project name is modifiable.
  • 10. The non-transitory computer-readable medium of claim 8 wherein a number of points associated with a match between the search text and the project description is modifiable.
  • 11. A computer readable storage medium tangibly embodied thereon a program of instructions executable by a processor for performing a method of searching service providers in a services exchange medium operable to connect a buyer and a service provider over a network, the method comprising: obtaining a timeframe that includes a number of months relative to a current time;accessing at least one data store that together includes service provider profiles of the service providers in the services exchange medium;assessing a first score for each service provider in the services exchange medium, wherein the first score is dependent on services exchange medium reputation of that service provider;based on a determination that a search text has been provided by a buyer, comparing the search text with the profile belonging to a service provider and stored in the at least one data store of the services exchange medium, wherein the profile comprises multiple sections entered by the service provider;computing a plurality of second scores based on matches between the search text and the profile belonging to the service provider, wherein each section of the profile is weighted according to conditions established by the services exchange medium to contribute to the second scores upon match between a respective section and the search text, wherein the second scores are further modified according to one or more subsequent match score of subsequent matches of the respective section and the search text in response to the established weighting conditions, wherein a sum of the second score and the subsequent match score determines a participation in a calculation of an associated section of the respective section on the service provider profile;computing a plurality of third scores based on matches between the search text and parts of each project that is completed by the service provider within the services exchange medium and within the timeframe specified by the buyer;determining a fourth score based on the plurality of second scores and the plurality of third scores that together are enhanced by the first score;repeating steps of comparing to determining for all service providers within the services exchange medium; andgenerating a provider results list that is sorted by the fourth score; andbased on a determination that a search text has not been provided by a buyer, generating a provider results list that is sorted by the first score.
  • 12. The computer readable storage medium of claim 11 wherein the services exchange medium reputation is dependent on at least one of customer satisfaction, earnings, and participation by the service provider within the services exchange medium.
  • 13. The computer readable storage medium of claim 11 wherein the sections include provider tagline section, a provider user ID section, a provider name section, a summary services description section, a keywords section, a skills section, an about us section, a detailed services exchange section, a credentials section, and an experience section.
  • 14. The computer readable storage medium of claim 11 wherein the parts include a project name and a project description.
  • 15. The computer readable storage medium of claim 11 wherein a number of points for a match between the search text and a section of the profile comprises a first hit value and a total secondary hit score.
  • 16. The computer readable storage medium of claim 15 wherein the comparing comprises adjusting the total secondary hit score by a secondary hits magnifier.
  • 17. The computer readable storage medium of claim 16 wherein the secondary hits magnifier is modifiable.
  • 18. The computer readable storage medium of claim 16 wherein the comparing further comprises adding the first hit score and the total secondary hit score together, and multiplying an absolute weight to a sum of the first hit value and the total secondary hit score.
  • 19. The computer readable storage medium of claim 18 wherein the absolute weight is modifiable.
  • 20. The computer readable storage medium of claim 14 wherein a number of points for a match frequency between the search text and the project name is modifiable.
  • 21. The computer readable storage medium of claim 14 wherein a number of points for a match frequency between the search text and the project description is modifiable.
  • 22. A system for generating a provider results list comprising: a processor; andan application executed by the processor, the application for: obtaining a timeframe that includes a number of months relative to a current time;accessing at least one data store that together stores profiles of service providers of a services exchange medium that is operable to connect buyers with the service providers over a network;assessing, for each service provider, a reputation score that is dependent on reputation of that service provider within the services exchange medium;based on a determination that a search text has been specified by a buyer, calculating a provider search score for each of the service providers within the services exchange medium, wherein the provider search score is a sum of at least one provider match score, wherein each of the at least one provider match score is based on a match between the search text entered by the buyer and a section of the service provider profile for the respective service provider or is based on a match between the search text entered by the buyer and a part of each project that is completed by the service provider within the services exchange medium and within the timeframe, wherein the service provider profile comprises multiple sections entered by the respective service provider, wherein the section of the profile is weighted according to conditions established by the services exchange medium to contribute to the provider match score upon match between the section and the search text, wherein the provider match score is further modified according to one or more subsequent match scores of subsequent matches of the section and the search text in response to the established weighting conditions, wherein a sum of the provider match score and the subsequent match score determines a calculation participation of an associated section of the respective section on the service provider profile, wherein the sum of the at least one provider match score is enhanced by the reputation score; andsorting the provider results list based on the provider search score;based on a determination that a search text has not been specified by the buyer, sorting the provider results list based on the reputation score; andgenerating a user interface that includes the sorted provider results list.
  • 23. The system of claim 22 wherein the application is executed online.
  • 24. The system of claim 22 wherein the reputation score is dependent on at least one of customer satisfaction, earnings, and participation by a service provider within the services exchange medium.
  • 25. The system of claim 22 wherein the section of the profile is a provider tagline section, a provider user ID section, a provider name section, a summary services description section, a keywords section, a skills section, an about us section, a detailed services exchange section, a credentials section, or an experience section.
  • 26. The system of claim 22 wherein a number of points for a match between the search text and the section of the profile comprises a first hit value and a total secondary hit score.
  • 27. The system of claim 26 wherein the calculating comprises adjusting the total secondary hit score by a secondary hits magnifier.
  • 28. The system of claim 27 wherein the secondary hits magnifier is modifiable.
  • 29. The system of claim 27 wherein the calculating further comprises adding the first hit value and the total secondary hit score together, and multiplying an absolute weight to a sum of the first hit value and the total secondary hit score.
  • 30. The system of claim 29 wherein the absolute weight is modifiable.
  • 31. The system of claim 22 wherein the part of the project is a project name or a project description.
  • 32. The system of claim 31 wherein a number of points associated with a match between the search text and the project name is modifiable.
  • 33. The system of claim 31 wherein a number of points associated with a match between the search text and the project description is modifiable.
  • 34. A computer-implemented method of enhancing provider match scores comprising: obtaining a timeframe that includes a number of months relative to a current time;accessing at least one data store that together stores a profile entered by a service provider of a services exchange medium operable to connect a buyer and the service provider over a network;assessing an enhancement value that is dependent on reputation of the service provider within the services exchange medium;based on a determination that a search text has been specified by the buyer, determining a first match score based on a match between the search text and a section of the profile, wherein the section of the profile is weighted to contribute to the first match score according to conditions established by the services exchange medium, wherein the first match score is further modified according to one or more second match scores of subsequent matches in response to the established weighting conditions, wherein a sum of the first match score and the one or more second match scores determines a calculation participation of an associated section of the profile, wherein the established weighting conditions includes a magnifier associated with the one or more subsequent matches, by a computer programmed with instructions for determining the first match score;determining a second match score based on a number of matches between the search text and a project title of each project completed by a service provider within the services exchange medium and within the timeframe specified by the buyer, by a computer programmed with instructions for determining the second match score;determining a third match score based on a number of matches between the search text and a project description of each project completed by the service provider within the services exchange medium and within the timeframe specified by the buyer, by a computer programmed with instructions for determining the third match score;adding together first match scores, the second match score, and the third match score to obtain a total match score, by a computer programmed with instructions for obtaining the total match score;multiplying the enhancement value to the total match score to obtain a search value, by a computer programmed to multiply the enhancement value to the total match score; anddetermining a position of the service provider relative to other service providers in the services exchange medium based on the search value; andbased on a determination that a search text has not been specified by the buyer, determining a position of the service provider relative to other service providers in the services exchange medium based on the enhancement value.
  • 35. The system of claim 22 wherein the timeframe is specified by the buyer.
  • 36. The system of claim 35 wherein the timeframe is specified via the user interface.
US Referenced Citations (243)
Number Name Date Kind
4703325 Chamberlin et al. Oct 1987 A
4799156 Shavit et al. Jan 1989 A
5008853 Bly et al. Apr 1991 A
5220657 Bly et al. Jun 1993 A
5548506 Srinivasan Aug 1996 A
5557515 Abbruzzese et al. Sep 1996 A
5592620 Chen et al. Jan 1997 A
5664115 Fraser Sep 1997 A
5715402 Popolo Feb 1998 A
5732400 Mandler et al. Mar 1998 A
5794207 Walker et al. Aug 1998 A
5835896 Fisher et al. Nov 1998 A
5842178 Giovannoli Nov 1998 A
5862223 Walker et al. Jan 1999 A
5905975 Ausubel May 1999 A
5924082 Silverman et al. Jul 1999 A
5949976 Chappelle Sep 1999 A
5956715 Glasser et al. Sep 1999 A
5966130 Benman, Jr. Oct 1999 A
5987498 Athing et al. Nov 1999 A
6009154 Rieken et al. Dec 1999 A
6041307 Ahuja et al. Mar 2000 A
6049777 Sheena et al. Apr 2000 A
6061665 Bahreman May 2000 A
6064980 Jacobi et al. May 2000 A
6078906 Huberman Jun 2000 A
6092049 Chislenko Jul 2000 A
6101482 DiAngelo et al. Aug 2000 A
6119101 Peckover Sep 2000 A
6119149 Notani Sep 2000 A
6128624 Papierniak et al. Oct 2000 A
6141653 Conklin et al. Oct 2000 A
6154731 Monks et al. Nov 2000 A
6161099 Harrington et al. Dec 2000 A
6208659 Govindarajan et al. Mar 2001 B1
6223177 Tatham et al. Apr 2001 B1
6226031 Barraclough et al. May 2001 B1
6233600 Salas et al. May 2001 B1
6311178 Bi et al. Oct 2001 B1
6336105 Conklin et al. Jan 2002 B1
6374292 Srivastava et al. Apr 2002 B1
6385620 Kurziua May 2002 B1
6415270 Rackson et al. Jul 2002 B1
6415284 D'Souza et al. Jul 2002 B1
6442528 Notani et al. Aug 2002 B1
6484153 Walker et al. Nov 2002 B1
6557035 McKnight Apr 2003 B1
6564246 Varma et al. May 2003 B1
6567784 Bukow May 2003 B2
6598026 Ojha et al. Jul 2003 B1
6618734 Williams Sep 2003 B1
6662194 Joao Dec 2003 B1
6735570 Lacy et al. May 2004 B1
6832176 Hartigan et al. Dec 2004 B2
6859523 Jilk Feb 2005 B1
6871181 Kansal Mar 2005 B2
6931385 Halstead et al. Aug 2005 B1
6938048 Jilk et al. Aug 2005 B1
7069242 Sheth et al. Jun 2006 B1
7096193 Beaudoin Aug 2006 B1
7155400 Jilk et al. Dec 2006 B1
7310415 Short Dec 2007 B1
7346535 Younger Mar 2008 B2
7406443 Fink et al. Jul 2008 B1
7437327 Lam et al. Oct 2008 B2
7444374 Baker Oct 2008 B1
7466810 Quon Dec 2008 B1
7505919 Richardson Mar 2009 B2
7587336 Wallgren et al. Sep 2009 B1
7752080 Greener Jul 2010 B1
7778938 Stimac Aug 2010 B2
7814085 Pfleger Oct 2010 B1
7966265 Schalk et al. Jun 2011 B2
8024225 Sirota et al. Sep 2011 B1
8024670 Rahmatian Sep 2011 B1
8156051 Shah Apr 2012 B1
8224755 Goodman et al. Jul 2012 B2
8380709 Diller Feb 2013 B1
8504403 Deich Aug 2013 B2
8512143 Jung et al. Aug 2013 B2
8517742 Johnson Aug 2013 B1
8682683 Ananian Mar 2014 B2
8700694 Archbold Apr 2014 B2
8843388 Westfall Sep 2014 B1
8856670 Thakur et al. Oct 2014 B1
9020271 Deolalikar et al. Apr 2015 B2
9454576 Kapoor Sep 2016 B1
20010011222 McLauchlin et al. Aug 2001 A1
20010032170 Sheth Oct 2001 A1
20010034630 Mayer Oct 2001 A1
20010034688 Annunziata Oct 2001 A1
20010039508 Nagler Nov 2001 A1
20010041988 Lin Nov 2001 A1
20020007300 Slatter Jan 2002 A1
20020010685 Ashby Jan 2002 A1
20020023046 Callahan et al. Feb 2002 A1
20020026398 Sheth Feb 2002 A1
20020032576 Abbott et al. Mar 2002 A1
20020052773 Kraemer May 2002 A1
20020054138 Hennum May 2002 A1
20020069031 Lehman Jun 2002 A1
20020078432 Charisius et al. Jun 2002 A1
20020103687 Kipling Aug 2002 A1
20020120522 Yang Aug 2002 A1
20020120554 Vega Aug 2002 A1
20020129139 Ramesh Sep 2002 A1
20020133365 Grey et al. Sep 2002 A1
20020161707 Cole et al. Oct 2002 A1
20020194077 Dutta Dec 2002 A1
20020194112 dePinto et al. Dec 2002 A1
20030004738 Chander Jan 2003 A1
20030014294 Yoneyama Jan 2003 A1
20030046155 Himmel et al. Mar 2003 A1
20030050811 Freeman, Jr. Mar 2003 A1
20030055780 Hansen et al. Mar 2003 A1
20030061266 Ouchi Mar 2003 A1
20030086608 Frost May 2003 A1
20030101126 Cheung et al. May 2003 A1
20030120603 Kojima et al. Jun 2003 A1
20030182171 Vianello Sep 2003 A1
20030191684 Lumsden Oct 2003 A1
20030212246 Eleveld Nov 2003 A1
20030212627 Burns et al. Nov 2003 A1
20030220843 Lam et al. Nov 2003 A1
20030233372 Warner Dec 2003 A1
20040063463 Boivin Apr 2004 A1
20040103167 Grooters et al. May 2004 A1
20040122926 Moore et al. Jun 2004 A1
20040128224 Dabney et al. Jul 2004 A1
20040215560 Amalraj et al. Oct 2004 A1
20040230466 Davis et al. Nov 2004 A1
20040230511 Kannan et al. Nov 2004 A1
20040230521 Broadbent et al. Nov 2004 A1
20040241627 Delfing Dec 2004 A1
20040243428 Black Dec 2004 A1
20050033633 LaPasta Feb 2005 A1
20050043998 Bross et al. Feb 2005 A1
20050097613 Ulate et al. May 2005 A1
20050131830 Juarez et al. Jun 2005 A1
20050177380 Pritchard et al. Aug 2005 A1
20050222907 Pupo Oct 2005 A1
20060031177 Rule Feb 2006 A1
20060074708 Woods Apr 2006 A1
20060080116 Maguire Apr 2006 A1
20060095366 Sheth et al. May 2006 A1
20060106846 Schulz May 2006 A1
20060122850 Ward et al. Jun 2006 A1
20060136324 Barry et al. Jun 2006 A1
20060143228 Odio-Paez Jun 2006 A1
20060155609 Caiafa Jul 2006 A1
20060159109 Lamkin Jul 2006 A1
20060177041 Warner et al. Aug 2006 A1
20060195428 Peckover Aug 2006 A1
20060212359 Hudgeon Sep 2006 A1
20060284838 Tsatalos Dec 2006 A1
20070005536 Caswell et al. Jan 2007 A1
20070022040 Gordon Jan 2007 A1
20070027746 Grabowich Feb 2007 A1
20070027792 Smith Feb 2007 A1
20070061144 Grichnik et al. Mar 2007 A1
20070067196 Usui Mar 2007 A1
20070078699 Scott et al. Apr 2007 A1
20070088601 Money et al. Apr 2007 A1
20070112671 Rowan May 2007 A1
20070130059 Lee et al. Jun 2007 A1
20070162379 Skinner Jul 2007 A1
20070174180 Shin Jul 2007 A1
20070174394 Jayaweera Jul 2007 A1
20070185723 Shellnutt Aug 2007 A1
20070192130 Sandhu Aug 2007 A1
20070233510 Howes Oct 2007 A1
20080010598 Smilowitz et al. Jan 2008 A1
20080046834 Yu et al. Feb 2008 A1
20080059267 Hamilton Mar 2008 A1
20080059523 Schmidt Mar 2008 A1
20080065444 Stroman et al. Mar 2008 A1
20080082662 Dandliker et al. Apr 2008 A1
20080091774 Taylor et al. Apr 2008 A1
20080104495 Craig May 2008 A1
20080109491 Gupta May 2008 A1
20080134292 Ariel et al. Jun 2008 A1
20080154783 Rule et al. Jun 2008 A1
20080184135 Washburn et al. Jul 2008 A1
20080187114 Altberg Aug 2008 A1
20080194228 Pousti Aug 2008 A1
20080209417 Jackobson Aug 2008 A1
20080244582 Brown et al. Oct 2008 A1
20080288582 Pousti Nov 2008 A1
20080294505 Markowitz et al. Nov 2008 A1
20080294631 Malhas et al. Nov 2008 A1
20080294688 Brousard Nov 2008 A1
20080313005 Nessland et al. Dec 2008 A1
20090011395 Schmidt Jan 2009 A1
20090017788 Doyle et al. Jan 2009 A1
20090055404 Heiden Feb 2009 A1
20090055476 Marcus et al. Feb 2009 A1
20090112728 Evers et al. Apr 2009 A1
20090116403 Callanan et al. May 2009 A1
20090132345 Meyssami et al. May 2009 A1
20090150386 Lichtblau Jun 2009 A1
20090177691 Manfredi et al. Jul 2009 A1
20090199185 Slawson et al. Aug 2009 A1
20090210282 Elenbaas et al. Aug 2009 A1
20090234706 Adams et al. Sep 2009 A1
20090241035 Tseng et al. Sep 2009 A1
20090241172 Sennett et al. Sep 2009 A1
20090249340 Akiyama et al. Oct 2009 A1
20090265243 Karassner Oct 2009 A1
20090287592 Brooks et al. Nov 2009 A1
20090288021 Ioffe et al. Nov 2009 A1
20090327081 Wang et al. Dec 2009 A1
20100017253 Butler Jan 2010 A1
20100088749 Steeples Apr 2010 A1
20100115040 Sargent et al. May 2010 A1
20100144318 Cable Jun 2010 A1
20100161503 Foster Jun 2010 A1
20100162167 Stallings Jun 2010 A1
20100191591 Silbert Jul 2010 A1
20100250322 Norwood Sep 2010 A1
20100287525 Wagner Nov 2010 A1
20100324948 Kumar et al. Dec 2010 A1
20110106762 Dane May 2011 A1
20110107088 Eng et al. May 2011 A1
20110131146 Skutnik Jun 2011 A1
20110208665 Hirsch Aug 2011 A1
20110238505 Chiang et al. Sep 2011 A1
20110238768 Habets et al. Sep 2011 A1
20110302053 Rigole Dec 2011 A1
20120041832 Sheth et al. Feb 2012 A1
20120110087 Culver et al. May 2012 A1
20120143952 Von Graf Jun 2012 A1
20120150761 Ananian Jun 2012 A1
20130246294 Pendyala et al. Sep 2013 A1
20130325734 Bixler et al. Dec 2013 A1
20140074738 Thankappan et al. Mar 2014 A1
20140108078 Davis Apr 2014 A1
20140164271 Forman et al. Jun 2014 A1
20140222493 Mohan et al. Aug 2014 A1
20140358646 Said et al. Dec 2014 A1
20140377723 Strong Dec 2014 A1
20150032654 Huff Jan 2015 A1
20150134600 Eisner et al. May 2015 A1
20160012135 Wang et al. Jan 2016 A1
Foreign Referenced Citations (4)
Number Date Country
0 952 536 Oct 1999 EP
WO 0115050 Mar 2001 WO
WO 0173645 Oct 2001 WO
WO 02061531 Aug 2002 WO
Non-Patent Literature Citations (47)
Entry
U.S. Appl. No. 09/644,665, filed Aug. 24, 2000, Sheth et al.
U.S. Appl. No. 12/287,994, filed Oct. 14, 2008, Diller et al.
U.S. Appl. No. 12/287,997, filed Oct. 14, 2008, Diller et al.
U.S. Appl. No. 12/474,127, filed May 28, 2008, Diller et al.
U.S. Appl. No. 12/474,147, filed May 28, 2008, Sinha et al.
ants.com web pages [online]. Ants.com [retrieved on Aug. 22, 2008]. Retrieved from the Internet: <URL: http://www.ants.com/ants/>.
bizbuyer.com web pages [online]. BizBuyer.com, [retrieved Aug. 18-21, 2000]. Retrieved from the Internet: <URL: http://www.bizbuyer.com/>.
BullhornPro web pages [online]. Bullhorn, Inc. [retrieved on Jan. 4, 2001]. Retrieved from the Internet: <URL: http://www.bullhornpro.com/>.
Cassidy, M., “Going for Broke,” San Jose Mercury News, Monday, Aug. 16, 1999, pp. 1E and 4E, published in San Jose, CA.
efrenzy.com web pages [online]. eFrenzy, Inc. [retrieved on Aug. 22, 2000]. Retrieved from the Internet: <URL: http://www.efrenzy.com/index.isp>.
Eisenberg, D., “We're for Hire, Just Click,” Time Magazine, Aug. 16, 1999, vol. 154, No. 7 [online] [retrieved on Aug. 19, 1999]. Retrieved from the Internet: <URL: http://www.pathfinder.com/time/magazine/articles/0,3266,29393,00.html>.
eworkexchange.com web pages [online]. eWork Exchange, Inc. [retrieved on Aug. 18-22, 2000]. Retrieved from the Internet: <URL: http://www.eworks.com/>.
eWork Exchange web pages [online]. eWork Exchange, Inc. [retrieved on Jan. 5, 2001]. Retrieved from the Internet: <URL: http://www.eworks.com/>.
eWork ProSource web pages [online]. eWork Exchange, Inc. [retrieved on Jan. 3, 2001]. Retrieved from the Internet: <URL: http://www.ework.com/>.
FeeBid.com web pages [online]. FeeBid.com [retrieved on Dec. 18, 2000]. Retrieved from the Internet: <URL: http://www.feebid.com>.
freeagent.com web pages [online]. FreeAgent.com [retrieved Aug. 18-22, 2000]. Retrieved from the Internet: <URL: http://www.freeagent.com/>.
guru.com.com web pages [online]. Guru.com, Inc. [retrieved Aug. 18, 2000]. Retrieved from the Internet: <URL: http://www.guru.com/>.
Herhold, S., “Expert Advice is Collectible for Start-up,” San Jose Mercury News, Monday, Aug. 16, 1999, pp. 1E and 6E, San Jose, CA.
hotdispatch.com web pages [online]. HotDispatch, Inc. [retrieved on Aug. 22, 2000]. Retrieved from the Internet: <URL: http://www.hotdispatch.com/>.
Humphreys, Paul et al., “A Just-in-Time Evaluation Strategy for International Procurement,” MCB UP Limited, 1998, pp. 1-11.
“IBNL Forges Into the Future of Buying and Selling with Source Interactive Software,” PR Newswire, Jan. 10, 1996. [replacement copy retrieved on May 4, 2009]. Retrieved from Internet: <URL: http://www.highbeam.com>.
imandi.com web pages [online]. Imandi Corporation [retrieved on Aug. 22, 2000]. Retrieved from the Internet: <URL: http://www.imandi.com/>.
Malone, Thomas W. et al., “The Dawn of the E-Lance Economy,” Harvard Business Review, Sep.-Oct. 1998, pp. 145-152.
“Netscape Selects Netopia as the Exclusive ‘Virtual Office’ Offering on the New Netscape Small Business Source Service,” PR Newswire, May 11, 1998, Mountain View and Alameda, California.
onvia.com web pages [online]. Onvia.com [retrieved Aug. 22, 2000]. Retrieved from the Internet: <URL: http://www.onvia.com/usa/home/index.cfm>.
Opus360 web pages [online]. Opus360 Corporation [retrieved on Jan. 3, 2001] Retrieved from the Internet: <URL: http://www.opus360com/>.
smarterwork.com web pges [online]. smarterwork.com, Inc. [retrieved on Aug. 22, 2000]. Retrieved from the Internet: <URL: http://www.smarterwork.com/>.
workexchange.com web pages [online]. WorkExchange, Inc. [retrieved Aug. 22, 2000]. Retrieved from the Internet: <URL: http://www.workexchange.com/unique/workexchange/index1.cfm>.
U.S. Appl. No. 12/474,170, filed May 28, 2008, Sinha et al.
U.S. Appl. No. 60/206,203, filed May 22, 2000, Anumolu et al.
U.S. Appl. No. 60/999,147, filed Oct. 15, 2007, Diller et al.
U.S. Appl. No. 61/131,920, filed Jun. 11, 2008, Diller et al.
Davenport, Thomas H. and Keri Pearlson, “Two Cheers for the Virtual Office”, summer 1998, abstract, retrieved from the Internet: <URL: http://www.pubservice.com/MSStore?ProductDetails.aspx?CPC=3944>.
PCT International Search Report and Written Opinion, PCT/US06/22734, dated Jun. 3, 2008, 5 pages.
Shalil Majithia et al, “Reputation-based Semantic Service Discovery”, IEEE Computer Society,13th IEEE International Workshops on Enabling Technologies:Infrastructure for Collaborative Enterprises, 2004, pp. 1-6.
Ziqiang Xu et al, “Reputation-Enhanced QoS-based Web Services Discovery”, School of Computing, Queen's University, Canada, 2007, pp. 1-8.
Massimo Paolucci et al. “Semantic Matching of Web Services Capabilities” Carnegie Mellon University, 2002, Springer-Verlag Berlin Heidelberg, p. 333-347.
madbid.com [online] <URL: http://web.archive.org.web/20080829025830//http://uk.nadbid.com/faq/>.
morebusiness.com, “How to Write Winning Business Proposals: Writing Strategies,” cited in Office Action dated Oct. 6, 2011, <http://www.morebusiness.com/running_your_business/management/v1n11.brc>, published Aug. 1, 1998.
University of Wisconsin—Eau Claire LTS Online Help Documentation, Microsoft Excel 2003/2004, using the Sort Command, https://web.archive.org/web/20080311184836/http://www.uwec.edu/Help/Excel03/srtcom.htm,Mar. 11, 2008,retrieved Oct. 1, 2014.
Paolucci et al., “Semantic Matching of Web Services Capabilities”, 2002, Carnegie Mellon University, Pittsburgh, PA, USA.
Muhl, Charles J. “What Is an Employee-The Answer Depends on the Federal Law.” Monthly Lab. Rev. 125(2002): 9 pages.
Barton, Lisa Horwedel “Reconciling the independent contractor versus employee dilemma: a discussion of current developments as they relate to employee benefit plans.” Cap. UL Rev 29 (2001): 63 pages.
Moran, Jenna Amato “Independent Contractor or Employee-Misclassification of Workers and Its Effect of the State.” Buff. Pub. Int. LJ 28 (2009): 28 pages.
Webb, Teresa J., et al. “An empirical assist in resolving the classification dilemma of workers as either employees or independent contractors.” Journal of Applied Business Research (JABR) 24. (2011): 22 pages.
Wood, Robert W. “Defining Employees and Independent Contractors.” Bus. L. Today 17 (2007): 6 pages.
IBM Websphere Telecommunications Web Services Server Programming Guide, ibm.com/redbooks, John Bergland et al., Sep. 2008.