The present invention relates to an improved matching method that is based on a machine learning algorithm and a system thereof.
A traditional hiring process is a long and cumbersome.
At a step 105b, a contractor searches for job openings or leads. In a bad economy when job openings are scarce, the contractor may need to search for some time until the contractor finds something worthwhile. At a step 110b, after the contractor finally finds a job opening, the contractor drafts a resume or a proposal tailored to the job opening. At a step 115b, the contractor sends the resume or proposal to the job opening.
At a step 120, the client evaluates all the resumes or proposals the client has received after a certain period of time. At a step 125, the client interviews some or all of the candidates. At a step 130, the client performs negotiations with the candidates. At a step 135, the client makes hiring decisions. At a step 140, the client and/or the contractor hope for a success.
The traditional hiring process 100 is a stop and go process due to the amount of waiting it takes after each step and can take weeks, if not months, to fill a job opening. Even when the opening is filled, there is no predictability in the result in regards to whether the client will be satisfied with the hired contractor or vice versa. For example, the client and the hired contractor might find it difficult to work with each other because they are in different time zones, or the client likes to micro-manage while the hired contractor prefers to be macro-managed. The traditional hiring process 100 does not provide trustworthy results as trust issues exist in the traditional hiring process 100.
The present invention addresses at least these limitations in the prior art.
Embodiments of the present invention are directed to a matching method that implements a machine learning algorithm to serve one or more matches to an individual and to ensure that an outcome of each match is more likely than not to be successful. A recommendation engine uses the machine learning algorithm to perform predictive analysis to thereby select one or more members of an online community to match or pair with the individual, based on at least structured data, unstructured data or both of the individual and/or each selected member. The recommendation engine is configured to continuously learn from past user behavior, including the individual's, to further improve future matches provided to the individual.
In one aspect, a non-transitory computer-readable medium is provided. The non-transitory computer-readable medium stores instructions that, when executed by a computing device, cause the computing device to perform a method. The method includes determining a first set of requirements for a buyer and determining a second set of requirements for each service provider belonging to a group of service providers.
In some embodiments, each set of requirements include at least one structured datum, at least one unstructured datum or a combination thereof. A structured datum is explicit, and an unstructured datum is implicit.
In some embodiments, an unstructured datum is behavior datum. In some embodiments, an unstructured datum can be a positive user action or a negative user action.
In some embodiments, a structured datum includes function/role/skills, geography, time zone, languages, availability, or budget. In some embodiments, structured datum includes job details or job history.
The method also includes performing predictive analysis based on all sets of requirements, thereby intelligently suggesting at least one match between the buyer and a service provider belonging to the group of service providers such that the match is more likely than not to be successful. In some embodiments, success is defined as a hire and an eventual positive feedback.
In some embodiments, the predictive analysis is based on a machine learning algorithm configured to learn from past user behavior.
In some embodiments, the method also includes using requirements of a community in making the suggestion. Typically, the buyer and the group of service providers belong to the community.
In some embodiments, the method also includes tracking actions of each user participating in the community.
In some embodiments, the method also includes providing at least one communication mechanism configured to allow a direct live communication between the buyer and the service provider belonging to the group of service providers.
In some embodiments, the method also includes providing access to an online profile associated with the service provider belonging to the group of service providers.
In another aspect, a system is provided. The system typically includes an online community for hiring and working on demand, and a recommendation engine. The online community includes members. The recommendation engine is configured to perform predictive analysis to intellectually pair an individual with at least one member of the online community such that the pairing is based at least on behavior characteristics determined by a machine learning algorithm. In some embodiments, recommendation engine, the members, and the individual are communicatively coupled.
In some embodiments, the at least one member is able to be timely committed to the individual during a specified period identified by the individual.
In some embodiments, the members includes clients and contractors. Typically, the clients have jobs to be filled and the contractors are looking to fill the jobs. A job can be role based or deliverable based.
In some embodiments, the recommendation engine is also configured to determine a first success rate of an outcome of a match between the individual and a first member, to determine a second success rate of an outcome of a match between the individual and a second member, and to present one of the two matches with the higher success rate.
In some embodiments, the recommendation engine is also configured to obtain structured data of a user, determine unstructured data of the user based on past behavior of the user in the online community, and assign a weight to each datum of the structured data and unstructured data.
In some embodiments, the recommendation engine is also configured to communicatively couple with one or more social networks to access one or more social graphs associated with the one or more social networks. The one or more social graphs are used by the machine learning algorithm during the performance.
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.
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.
Overview
Embodiments of the present invention are directed to a matching method that implements a machine learning algorithm to serve one or more matches to an individual and to ensure that an outcome of each match is more likely than not to be successful. A recommendation engine uses the machine learning algorithm to perform predictive analysis to thereby select one or more members of an online community to match or pair with the individual, based on at least structured data, unstructured data or both of the individual and/or each selected member. The recommendation engine is configured to continuously learn from past user behavior, including the individual's, to further improve future matches provided to the individual.
For example, the present invention is able to pair workers to jobs quickly, allowing a client to hire an ideal match on the spot, such as in one Internet session. In other words, in one Internet session, the client is able to provide information about a job opening, be served with one or more candidates, and hire a candidate to start work during the time period indicated by the client. In some embodiments, the present invention factors in a client's job requirements, including behavior data, and based on predicative analysis of successful outcomes, quickly search through all candidates, reviewing and taking into consideration their requirements, to find ideal matches for the job instantaneously. In some embodiments, a successful outcome is defined by the client hiring a matched candidate and providing a good feedback for that candidate after the job is completed.
Hypothetically, assume Aaden, Abigail, Finn, Kristin, Aria and Ethan are all members of an online community, such as a services marketplace in which clients find and hire contractors to fill available job openings. Aaden is a client who has a job opening that needs to be filled right away. Abigail, Finn, Kristin, Aria and Ethan are contractors within the services marketplace and have created online profiles, which include job histories describing previous and current jobs held online, offline, or both. An exemplary online profile is discussed in U.S. patent application Ser. No. 12/474,127, entitled “Online Professional Services Storefront,” filed on May 28, 2009, which is hereby incorporated by reference. While Abigail, Kristin, Aria and Ethan are seasoned contractors within the services marketplace, Finn is a new contractor who has not yet looked for a job within the services marketplace. Aria, Abigail, Finn and Kristin have all indicated that they will be available to start work right away. However, Ethan has indicated that he is currently unavailable.
The present invention potentially eliminates most of the steps required in a traditional hiring process, such as that illustrated in
For another example, there is no longer a need for a contractor to do a search through job postings or business leads (step 105b), and/or submit a resume or proposal to each opening (step 115b) since the present invention advantageously presents the best business leads or available jobs to the contractor based on at least the contractor's requirements. Instead, in some embodiments, the contractor only needs to create or update his or her online profile, and indicate his or her availability and skill sets via the online profile. The contractor is able to wait for business leads to come to him or her.
At a step 205b, a contractor is able to complete an online resume or profile and provide availability information.
A recommendation engine, implementing a machine learning algorithm, then presents one or more candidates (e.g., 3 contractors) that it has determined to be the best or top matches. For example, the recommendation engine intelligently serves Abigail, Finn and Kristin as the top candidates, because the recommendation engine has determined that choosing any of them will result in a successful outcome. In some embodiments, the recommendation engine considers the client's hiring requirements and each contractor's employment requirements when making the determination. Details of the recommendation engine are discussed below.
At step 210, the client evaluates the presented candidates, such as by reviewing their profiles to see, for example, their job histories, job certificates, licenses, what time zones they are in, etc.
At an optional step 215, the client is able to interview any one of the served candidates, such as by using a communication mechanism located in their profiles. In some embodiments, a profile is configured to indicate whether a contractor is presently online. In some embodiments, a profile includes at least one communication mechanism configured to allow a direct live communication between the client and the associated contractor directly from the profile. An exemplary live communication is a telephone call, instant messaging, or video chatting. Other live communication methods are contemplated. The at least one communication mechanism allows the client to interview the contractor to thereby make a more informed hiring decision. In some embodiments, a contractor's rate is non-negotiable since it is already made known to the client. Regardless, the client is able to feel confident that choosing one from the served candidates to work with will more likely than not result in a success.
At a step 220, the client makes hiring decisions. The client is able to explicitly select or reject candidates.
At a step 225, both the client and the contractor know that the outcome will be a success (e.g., happy with each other, would want to work with each other on the present project and other projects), because the recommendation engine takes into consideration at least the client's requirements and each contractor's requirements to determine one or more matches. The determination is thus not made using one or single sided requirements.
Continuing with the example, when Aaden enters the services marketplace, he is able to indicate that he is looking to hire a PHP developer who is available today. Abigail, Finn, Kristin, Ethan and Aria all have indicated that they are familiar with PHP. All, except for Ethan, have indicated that they are currently available to start work immediately. The recommendation engine determines and presents the top 3 best matched candidates—Abigail, Kristin and Finn—to Aaden. Top matched candidates are preferably those who are available, who can do the job and who has the track record of doing the job. As such, the recommendation engine does not present Ethan as a candidate since he is currently unavailable for work. Likewise, the recommendation engine does not present Aria as a candidate since the recommendation engine has determined that Aria has only worked for and will probably work only for corporations and not for individuals. Aaden is able to thereafter correspond with any of the candidates and is able to explicitly hire Abigail on the spot because, after interviewing or talking with Abigail, she is the one whom Aaden feels the most comfortable with. Although not necessary, Aaden is able to explicitly reject Kristin, Finn or both when making a decision.
The present invention advantageously transforms the hiring process from a stop and go series of actions to a streamlined, a shopping-like exercise. The recommendation engine, as it will become apparent, significantly increases the chance of a successful outcome of a match because not only does the recommendation engine take into consideration Aaden's requirements in a hire but the recommendation engine also takes into consideration each contractor's requirements in an employment.
Recommendation Engine
The client's requirements 305 include job details, function/role/skills, geography, time zone, languages, availability, budget, social graph, and/or behavior. Other client requirements are contemplated. More or less client requirements can be considered by the recommendation engine 300. A simple questionnaire can be used to determine the type or details of job that the client is looking to be filled. The client can simply indicate that the client is looking for a graphic designer or can provide additional information, such as a logo with specific attributes (e.g., interlocking hearts representing mother and child). The client can also specify the function/role/skills of the job and preferences such as geography, time zone, languages. The client can also specify a budget range associated with the job opening. The client can also specify social networks the client is a part of to allow the recommendation engine to access social graphs in these social networks. The recommendation engine is able to take into consideration who the client's connections have hired before since it is likely that one has a more successful outcome of hiring someone that a connection has used before. The recommendation engine is also able to gather and use the client's behavior data in the services marketplace. For example, the recommendation engine could determine that Aaden in the services marketplace subconsciously hires people only from India, or hires people only in the $20-$30/hour range, even though Aaden does not explicitly state these preferences.
A contractor's requirements include job history, function/role/skills, geography, time zone, languages, availability, budget, social graph, and/or behavior. Other contractor requirements are contemplated. More or less contractor requirements can be considered by the recommendation engine 300. The contractor's job history, both within the services marketplace and offline, is based on the contractor's online profile completed by the contractor. The contractor can also specify the function/role/skills the contractor can fill or has, and preferences such as geography, time zone, languages. The contractor can also specify a budget range the contractor desires. The contractor can also specify social networks the contractor is a part of to allow the recommendation engine to access social graphs in these social networks. The recommendation engine is able to take into consideration who the contractor's connections have worked for before since it is likely that one has a more successful outcome of working for someone that a connection has worked for before. The recommendation engine is also able to gather and use the contractor's behavior data in the services marketplace. For example, the recommendation engine could determine that Abigail in the services marketplace subconsciously works for people only from India, or works only for individuals rather than big corporations, even though Abigail does not explicitly state these preferences.
The recommendation engine ensures that every aspect of data regarding a user (e.g., client, contractor) is factored in, not just structured data explicitly provided by the user but also unstructured data (e.g., behavior data) implicitly provided by the user. Unstructured data are those that are not or cannot be explicitly stated but can be learned from past behavior on the services marketplace. For example, there are two types of contractors within the services marketplace: one who does freelancing and another that is an established business. A client can have a strong preference for one over another without explicitly stating such. The recommendation engine is able to determine such preference and will only serve candidates who are individuals in future matches to the client.
For another example, even though a client had previously explicitly indicated that they prefer contractors who have at least a 3 star rating but ultimately have always chosen in the past ones that have a 5 star rating, the recommendation engine is able to determine such preference and will only present or serve candidates with a 5 star rating in future matches to the client.
For yet another example, the recommendation engine is able to determine that a client does not like to hire a contractor who have only held consulting jobs in the past or have only been involved on tertiary work (e.g., nothing core or strategic to company). The client does not indicate this in any structured manner. However, every time a contractor includes consulting positions or indicates tertiary work in his or her profile, the client does not end up hiring that contractor. The recommendation engine is able to determine such preference and will only serve candidates who have worked on core projects and have held full time jobs in future matches to the client.
For yet another example, the recommendation engine is able to determine that a contractor has consistently declined invitations to work on Christmas themed projects. The contractor has not indicated this in any structured manner. However, every time the “Christmas” word appears in the job title, the contractor declines the invitation. The recommendation engine is able to determine such preference and will not present future job leads involving Christmas to the contractor.
For yet another example, the recommendation engine is able to determine that a contractor has consistently declined invitations to work on projects for Forma, a company that the contractor for one reason or another refuses to work for. The contractor has not indicated this in any structures manner. However, every time the invitation from Forma is sent to the contractor, the contractor declines the invitation. The recommendation engine is able to determine such preference and will not present future Forma job leads to the contractor.
As discussed, the recommendation engine considers every single aspect or activity in serving an intelligent match. An activity can be as subtle as clicking on one profile over another profile for viewing. For example, Aaden's viewing of Finn's online profile is an indicator to the recommendation engine that there is something about Finn that is of interest to Aaden and to factor that into the machine learning algorithm.
In some embodiments, an action can be considered as a positive action or as a negative action. For example, Aaden's clicking on Finn's profile can be considered a positive action. For another example, Aaden explicitly rejecting Finn and Kristin as candidates can be considered negative actions. With a positive or a negative action, there is a high percentage of certainty that this is what Aaden wanted to do. Therefore, in some embodiments, activities within the services marketplace are given weights. For example, an action that is associated with a higher percentage of certainty can be given more weight than an action that is associated with a lower percentage of certainty. For another example, an action that is considered more meaningful can be given more weight than an action that is considered less meaningful. In some embodiments, the weights are tunable. Fundamentally, all actions are tracked, recorded and associated with weights, and are factored into the machine learning algorithm.
As a member (e.g., client, contractor) transacts more and more on the services marketplace, the recommendation engine will continually learn therefrom and improve the matches provided to the member based on the behavior data collected on that member. However, in some instances, the recommendation engine will not have any behavior data to collect and/or learn from because a member is new and has no activity on the services marketplace (aside from perhaps creating a job detail or a profile). In such an instance, the recommendation engine typically factors in only the new member's job detail or online profile for the new member's requirements during a matching process. However, the recommendation engine will begin to collect and learn from the new member's behavior data.
In
The recommendation engine 300 looks at all these requirements 305, 310, 315 to determine and present a client with a strong selection of highly relevant candidate(s) for the client to make a hire.
A contractor approaches a job hunt from the opposite direction. The contractor typically knows skills he or she possesses, is able to determine the kinds of roles he or she can lead, and perhaps is able to explore the different functions he or she can serve. However, often times, a contractor does not know that he or she can serve in functions other those that the contractor has previously served in.
In some embodiments, the recommendation engine uses this taxonomy, which is an essential piece of tying clients and contractors together within the services marketplace. For example, if Aaden is looking for a web developer opening to be filled, the recommendation engine will match Aaden with those who have the skills required. Aaden does not need to know the specific skills (e.g., PHP, HTML, JavaSript, CSS) required for the opening. The recommendation engine advantageously determines those skills for Aaden to find candidates.
The present invention supports role or positioned based jobs and deliverable based jobs. A role or position based job is typically an ongoing service. If a client wants to build a team, the contract typically looks for someone who is looking to fill a role or position based job. However, if the client has a deliverable that needs completed, the client typically looks for someone who is looking to fill a deliverable.
At a step 510, the recommendation engine determines a second set of requirements for each member belonging to a group of members. The group of members can include contractors, like Abigail, Finn, Kristin, Aria and Ethan, within the services marketplace. A contractor's requirements are also discussed with respect to
Each set of requirements can include at least one structured datum, at least one unstructured datum or a combination thereof. Structured datum is typically explicit and unstructured datum is typically implicit.
At a step 610, unstructured data of the user based on past behavior of the user in the community is determined. For example, unstructured datum can be a positive user action, a negative user action, or any other behavior datum.
At a step 615, a weight is assigned to each datum of the structured data and unstructured data. Typically, a datum, such as an action, that is considered more meaningful can be given more weight than a datum that is considered less meaningful. After the step 615, the method 600 ends.
Each set of requirements can also include one or more social graphs associated with one or more social networks. As discussed above, the recommendation engine can take into consideration the connections of each of the client and contractors. Typically, the client and the contractors are able to give the services marketplace the login information to these social networks. In some embodiments, the connections are also weighted.
Referring back to
In some embodiments, the recommendation engine not only uses the client's requirements and the contractors' requirements, the recommendation engine also uses requirements of a community (e.g., services marketplace) in making the suggestion. As discussed above, the requirements of the community typically are those that best benefit the community as a whole. For example, the recommendation engine has served Finn as a candidate, even though there is no behavior data on Finn, to help Finn find a job in the services marketplace, without compromising the likelihood of success of a match.
Although the scenarios above illustrate matching contractors with a client's job opening, it should be understood that the recommendation engine not only is able to provide a client with best matched contractors, the recommendation engine is also able to provide a contractor with best matched job leads. Furthermore, the present invention has been described relative to matches in a services marketplace. However, the present invention can be applied to other types of matches.
In general, a hardware structure suitable for implementing the computing device 700 includes a network interface 705, a memory 710, processor 715, I/O device(s) 720, a bus 735 and a storage device 740. The choice of processor is not critical as long as the processor 715 has sufficient speed. The memory 710 is any conventional computer memory known in the art. The storage device 740 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 705. An example of a network interface includes a network card connected to an Ethernet or other type of LAN. The I/O device(s) 720 are able to include one or more of the following: keyboard, mouse, monitor, display, printer, modem and other devices. Software applications 730 are likely to be stored in the storage device 740 and memory 710 and are executed by the processor 715. Software applications 730 include an application configured to implement the recommendation engine. More or less components shown in
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.
Advantages
The recommendation engine of the present invention is configured to advantageously perform predictive analysis to intellectually pair an individual with at least one selected member of the services marketplace such that the pairing is based at least on behavior characteristics of the individual and the at least one selected member. The behavior characteristics are typically determined by the machine learning algorithm implemented by the recommendation engine. The recommendation engine is also configured to determine a first success rate of an outcome of a match between the individual and a first member, to determine a second success rate of an outcome of a match between the individual and a second member, and to advantageously present one of the two matches with the higher success rate. In some embodiments, success is defined by a hire and an eventual positive feedback after completion of the job.
While the invention has been described with reference to numerous specific details, one of ordinary skill in the art will recognize that the invention can be embodied in other specific forms without departing from the spirit of the invention. Thus, one of ordinary skill in the art will understand that the invention is not to be limited by the foregoing illustrative details, but rather is to be defined by the appended claims.
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 |
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 et al. | 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 |
6292792 | Baffles et al. | Sep 2001 | B1 |
6311178 | Bi et al. | Oct 2001 | B1 |
6336105 | Conklin et al. | Jan 2002 | B1 |
6374292 | Srivastava et al. | Apr 2002 | B1 |
6415270 | Rackson 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 |
6735570 | Lacy et al. | May 2004 | B1 |
6832176 | Hartigan et al. | Dec 2004 | B2 |
6859523 | Jilk et al. | 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 et al. | Aug 2006 | B1 |
7155400 | Jilk et al. | Dec 2006 | B1 |
7310415 | Short | Dec 2007 | B1 |
7406443 | Fink et al. | Jul 2008 | B1 |
7437327 | Lam et al. | Oct 2008 | B2 |
7444374 | Baker | Oct 2008 | B1 |
7466810 | Quon et al. | Dec 2008 | B1 |
7587336 | Wallgreen et al. | Sep 2009 | B1 |
7752080 | Greener | Jul 2010 | B1 |
8024225 | Sirota et al. | Sep 2011 | B1 |
8224755 | Goodman | Jul 2012 | B2 |
8380709 | Diller et al. | Feb 2013 | B1 |
8512143 | Jung et al. | Aug 2013 | B2 |
20010011222 | McLauchlin et al. | Aug 2001 | A1 |
20010034630 | Mayer et al. | Oct 2001 | A1 |
20010041988 | Lin | Nov 2001 | A1 |
20020010685 | Ashby | Jan 2002 | A1 |
20020023046 | Callahan et al. | Feb 2002 | A1 |
20020032576 | Abbot et al. | Mar 2002 | A1 |
20020054138 | Hennum | May 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 |
20030014294 | Yoneyama et al. | Jan 2003 | A1 |
20030046155 | Himmel et al. | Mar 2003 | A1 |
20030055780 | Hansen et al. | Mar 2003 | A1 |
20030101126 | Cheung et al. | May 2003 | A1 |
20030120603 | Kojima et al. | Jun 2003 | A1 |
20030191684 | Lumsden et al. | Oct 2003 | A1 |
20030220843 | Lam et al. | Nov 2003 | A1 |
20040063463 | Boivin | Apr 2004 | A1 |
20040064436 | Breslin et al. | Apr 2004 | A1 |
20040122926 | Moore et al. | Jun 2004 | A1 |
20040215560 | Amalraj et al. | Oct 2004 | A1 |
20040230511 | Kannan et al. | Nov 2004 | A1 |
20050043998 | Bross et al. | Feb 2005 | A1 |
20050131830 | Juarez et al. | Jun 2005 | A1 |
20050222907 | Pupo | Oct 2005 | A1 |
20060031177 | Rule | Feb 2006 | A1 |
20060122850 | Ward et al. | Jun 2006 | A1 |
20060136324 | Barry et al. | Jun 2006 | A1 |
20060185609 | Sato | Aug 2006 | A1 |
20060195428 | Peckover | Aug 2006 | A1 |
20060212359 | Hudgeon | Sep 2006 | A1 |
20070005536 | Caswell et al. | Jan 2007 | A1 |
20070027746 | Grabowich | Feb 2007 | A1 |
20070027792 | Smith | Feb 2007 | A1 |
20070067196 | Usui | Mar 2007 | A1 |
20070073610 | Marugabandhu et al. | Mar 2007 | A1 |
20070078699 | Scott 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 |
20070192130 | Sandhu | Aug 2007 | A1 |
20070233510 | Howes | Oct 2007 | A1 |
20080010598 | Smilowitz et al. | Jan 2008 | A1 |
20080059523 | Schmidt et al. | Mar 2008 | A1 |
20080065444 | Stroman et al. | Mar 2008 | A1 |
20080082662 | Dandliker 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 et al. | Aug 2008 | A1 |
20080294631 | Malhas et al. | Nov 2008 | A1 |
20090011395 | Schmidt et al. | Jan 2009 | A1 |
20090017788 | Doyle et al. | Jan 2009 | A1 |
20090055404 | Heiden et al. | Feb 2009 | A1 |
20090055476 | Markus 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 |
20090177691 | Manfredi et al. | Jul 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 |
20090265205 | Stinchcombe et al. | Oct 2009 | A1 |
20090287592 | Brooks et al. | Nov 2009 | A1 |
20090327081 | Wang et al. | Dec 2009 | A1 |
20100017253 | Butler et al. | Jan 2010 | A1 |
20100088749 | Steeples | Apr 2010 | A1 |
20100115040 | Sargent et al. | May 2010 | A1 |
20100162167 | Stallings et al. | Jun 2010 | A1 |
20100191591 | Silbert | Jul 2010 | A1 |
20100287525 | Wagner | Nov 2010 | A1 |
20110107088 | Eng et al. | May 2011 | A1 |
20110238505 | Chiang et al. | Sep 2011 | A1 |
20110238768 | Habets et al. | Sep 2011 | A1 |
Number | Date | Country |
---|---|---|
0 952 536 | Oct 1999 | EP |
0173645 | Oct 2001 | WO |
Entry |
---|
Paolucci et al., Semantic Matching of Web Services Capabilities, 2002. |
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, Inc. [retrieved on 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. |
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>. |
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/>. |
“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>. |
Humphreys, Paul et al., “A Just-in-Time Evaluation Strategy for International Procurement,” MCB UP Limited, 1998, pp. 1-11. |
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. |
morebusiness.com, “How to Write Winning Business Proposals: Writing Strategies,” Office Action dated Oct. 6, 2011, <http://www.morebusiness.com/running—your—business/management/v1n11.brc>, published Aug. 1, 1998. |
“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 pages [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>. |
madbid.com [online] <URL: http://web.archive.org.web/20080829025830//http://uk.nadbid.com/faq/>. |
Massimo Paolucci et al. “Semantic Matching of Web Services Capabilities” Carnegie Mellon University, 2002, Springer-Verlag Berlin Heidelberg, p. 333-347. |