Patent Application
20210287272
The present disclosure generally relates to data processing techniques. More specifically, the present disclosure relates to methods and systems for managing how search results are processed and presented to a user of a computer-based trading or e-commerce application.
Advancements in computer and networking technologies have enabled persons to conduct commercial and financial transactions “on-line” via computer-based applications. This has given rise to a new era of electronic commerce (often referred to as e-commerce.) A number of well-known retailers have expanded their presence and reach by operating websites that facilitate e-commerce. In addition, many new retailers, which operate exclusively online, have come into existence. The business models utilized by enterprises operating online are almost as varied as the products and services offered. For instance, some products and services are offered at fixed prices, while others are offered via various auction methods, and still others are offered via a system of classified ad listings. Some enterprises specialize in the selling of a specific type of product (e.g., books) or a specific service (e.g., tax preparation), while others provide a myriad of categories of items and services from which to choose. Some enterprises serve only as an intermediary, connecting sellers and buyers, while others sell directly to consumers.
Despite the many technical advances that have improved the state of e-commerce, a great number of technical challenges and problems remain. One such problem involves determining how to best present products and services (e.g., items) that are being offered for sale, so as to maximize the likelihood that a transaction (e.g., the sale of a product or service) will occur. For instance, when a potential buyer performs a search for a product or service, it may often be the case that the number of item listings that satisfy the potential buyer's query far exceeds the number of item listings that can practically be presented on a search results page. Furthermore, it is well established that the presentation of an item listing in a search results page—for example, the order or placement of the item listing in a list of listings, the font, font size, or color of the listing, and so on—can affect whether potential buyers select the listing, and ultimately purchase the listed product or service.
For enterprises that serve as an intermediary—for example, by connecting buyers with sellers—it is generally desirable that the presentation of item listings occur in a fair manner that strikes a balance between the needs and desires of the various sellers, the buyers or potential buyers, and the enterprise itself. If a preference is given to one seller, such that the one seller's item listings are consistently being presented in the most prominent position(s) on a search results page, other sellers may not participate, which will ultimately have a negative impact on the enterprise. Similarly, if item listings are presented in accordance with an algorithm that is too rigid and that cannot easily be altered or tweaked, such as a first-listed first-presented algorithm, some sellers may attempt to game the system, again negatively impacting other sellers, the potential buyers' experience, and ultimately the enterprise itself. Furthermore, using a simple and rigid algorithm for presenting item listings prevents the enterprise from optimizing the presentation of item listings to improve the overall conversion rate for item listings. This may lead potential buyers to shop elsewhere, which ultimately will negatively affect the e-commerce enterprise.
Some embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which:
Methods and systems for processing a search, and presenting search results, are described. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the various aspects of different embodiments of the present invention. It will be evident, however, to one skilled in the art, that the present invention may be practiced without these specific details.
In some embodiments, the on-line trading engine module 18 may consist of a variety of sub-components or modules, which provide some of the functions of an on-line trading application 16. As described more completely below, each module may be comprised of software instructions, computer hardware components, or a combination of both. To avoid obscuring the invention in unnecessary detail, only a few of the on-line trading engine functions (germane to the invention) are described herein. For example, the on-line trading engine module 18 may include an item listing management module (not shown) that facilitates the receiving and storing of data representing item attributes, which collectively form an item listing. When a user desires to list a single item, or multiple items, for sale, the user will provide information about the item(s) (e.g., item attributes). Such information may be submitted via one or more forms of one or more web pages, or via drop down lists, or similar user interface elements. The item listing management module receives the item attributes and stores the item attributes together within a database 22 as an item listing 24. In some instances, the item listings may be stored in an item listing database table. As described in greater detail below, the item attributes of each item listing are analyzed to determine a ranking score assigned to item listings and used in determining the position of item listings when the item listings are being presented in a search results page.
The on-line trading engine module 18 may also include one or more modules for receiving and storing historical data that is used to measure the likelihood that an item listing will, if presented in a search results page, result in a transaction being concluded. For instance, in some embodiments, data associated with user-initiated activities are analyzed and captured for the purpose of predicting future user activities. If a user submits a search request including certain search terms, and then proceeds to conclude a transaction for a particular item (e.g., purchase the item), information from the user's interaction with the online trading application will be captured and stored for the purpose of predicting future actions by other users. Some of the data used in this capacity is generally referred to as relevance data 26 because it is used to determine a measure of relevance between search terms used in a search query, and individual item listings. For instance, if a potential buyer submits a search request with the search terms, “mobile phone”, item listings that have certain item attributes are more likely to result in the conclusion of a transaction if presented in a search results page in response to the search request. For instance, continuing with the example search terms, “mobile phone”, given the specific search terms used in the search query, item listings that have been designated as being in a certain category of items, such as “Electronics”, or even more specifically, “Mobile Phones”, are more likely to result in a transaction if presented in a search results page than item listings in other categories, for example, such as “Automobiles” or “Jewelry”. Similarly, given the search terms, “mobile phone”, item listings with titles that include the search terms may prove more likely to result in a transaction than item listings without the search terms in the title. Accordingly, in some embodiments, the on-line trading engine 18 includes one or more modules for receiving and analyzing historical data to generate what is referred to herein as relevance data. The relevance data is used to derive a measure of the likelihood that item listings with certain item attributes will result in a transaction if displayed in response to certain search terms being submitted in a search request. The relevance data may be derived and used as described in related patent applications, U.S. application Ser. No. 11/679,973, entitled, “DETERMINING RELEVANCY AND DESIRABILITY OF TERMS”, filed on Feb. 28, 2007, and U.S. application Ser. No. 11/821,928, entitled, “ECONOMIC OPTIMIZATION FOR PRODUCT SEARCH RELEVANCY”, filed on Jun. 26, 2007, both of which are incorporated herein by reference.
The on-line trading engine module 18 may also include one or more modules for receiving and storing data representing, among other things, a measure of a seller's performance of obligations associated with transactions in which the seller has participated. For instance, in some embodiments, when a transaction is concluded, a buyer may be prompted to provide feedback information concerning the performance of a seller. The buyer may, for example, rate the accuracy of the seller's description of an item provided in the item listing. For instance, if the item received by the buyer is in poor condition, but was described in the item listing as being in good condition, the buyer may provide feedback information to reflect that the seller's description of the item in the item listing was inaccurate. As described more fully below, this information may be used in a variety of ways to derive a ranking score for an item listing. For instance, in some cases, the seller feedback information may be used to determine a ranking score for another item listing of the same seller. Such information may be stored in a database 22, as indicated in
As illustrated in
Referring again to
For instance, in some embodiments, a user operates a web browser application 32 on a client system 12 to interact with the on-line trading application residing and executing on the server system 14. As illustrated by the example user interface with reference number 34, a user may be presented with a search interface 34, with which the user can specify one or more search terms to be used in a search request submitted to the on-line trading application 16. In some embodiments, in addition to specifying search terms, users may be able to select certain item attributes, such as the desired color of an item, the item categories that are to be searched, and so on. After receiving and processing the search request, the on-line trading application 16 communicates a response to the web browser application 32 on the client system 12. For instance, the response is an Internet document or web page that, when rendered by the browser application 32, displays a search results page 36 showing several item listings that satisfy the user's search request. As illustrated in the example search results page 36 of
In general, the item listings are presented in the search results page in an order based on a ranking score that is assigned to each item listing that satisfies the query. In some embodiments, the item listings will be arranged in a simple list, with the item listing having the highest ranking score appearing at the top of the list, followed by the item listing with the next highest ranking score, and so on. In some embodiments, several search results pages may be required to present all item listings that satisfy the query. Accordingly, only a subset of the set of item listings that satisfy the query may be presented in the first page of the search results pages. In some embodiments, the item listings may be ordered or arranged in some other manner, based on their ranking scores. For instance, instead of using a simple list, in some embodiments the item listings may be presented one item listing per page, or, arranged in some manner other than a top-down list.
As described in greater detail below, the ranking score may be based on several component scores including, but by no means limited to: a relevance score, representing a measure of the relevance of an item listing with respect to search terms provided in the search request; a listing quality score, representing a measure of the likelihood that an item listing will result in a transaction based at least in part on historical data associated with similar item listings; and, a business rules score, representing a promotion or demotion factor determined based on the evaluation of one or more business rules. As used herein, a component score is a score that is used in deriving the overall ranking score for an item listing. However, a component score in one embodiment may be a ranking score in another embodiment. For instance, in some embodiments, the ranking score may be equivalent to a single component score, such as the listing quality score. Similarly, in some embodiments, the ranking score may be equivalent to the business rules score.
The ranking score assignment module 40 includes a search engine module 48 and a relevance score module 50. The ranking score assignment module 40 assigns a ranking score to each item listing that satisfies a search query, such that the ranking score can be used to order or arrange item listings when the item listings are presented in a search results page. In some embodiments, the ranking score will be determined based on a variety of component scores (e.g., relevance score, listing quality score, business rules score), however, it will be appreciated that the ranking score might be based on a single component score (e.g., the relevance score alone), or various combinations of the component scores. In some embodiments, after assigning a ranking score to each item listing that satisfies a specific user's search query, the ranking score assignment module 40 generates a list, or otherwise orders, the item listings that satisfy the search query. Alternatively, in some embodiments, a separate ordering module (not shown) might be utilized to order the item listings.
In some embodiments, the search engine module 48 provides the actual search function. For instance, the search engine module 48, in some embodiments, receives and processes a search request to identify the item listings that satisfy the search request. It will be appreciated by those skilled in the art that a variety of search techniques might be implemented to identify item listings that satisfy a search request. In general, however, the item attributes of item listings are analyzed for the presence of the user-provided search terms. For instance, in some embodiments, the title and/or user-provided item description are searched for the presence of search terms included in the search query. In some instances, particularly when a user is performing an advanced search, other item attributes such as a user-specified category for the item listing may be used to identify item listings satisfying the search query. The exact methods and algorithms used to execute a search, however, are beyond the scope of the present application.
In an alternative embodiment, the search engine module 48 may represent an interface to a search engine implemented as an external component or module, for example, as part of the on-line trading engine module 18, or as a separate external module. In such a scenario, the search engine module 48 may simply receive the set of item listings that satisfy a search query.
As illustrated in
The listing quality management module 42 determines a listing quality score, which, in some embodiments, is used as a component score in determining the ranking score for each item listing that satisfies a query. As described in greater detail below, the listing quality score represents a measure of the likelihood that an item listing, if presented in a search results page, will result in a transaction being concluded. The listing quality score, in some embodiments, is derived as a weighted sum of a first part—a predicted score based on item attributes of the item listing, and in some cases seller attributes, that are determinable at the time of listing—and a second part—a score based on demand metrics that are observed over time. As such, the listing quality management module is shown in
In some embodiments, the predicted score module 52 determines the predicted listing quality score (e.g., the first part) by comparing item attributes of the item listing to which the listing quality score is being assigned, with item attributes of item listings that are determined to be similar. For instance, if a particular item listing is offering for sale a television set at a particular price (e.g., $100), the particular price may be compared with the prices of similar television sets that have previously been sold. If, for example, the price of the television set is lower than the mean, mode, or median price (e.g., $200) of similar television sets, which have sold recently, then the listing quality score should reflect the “good” price of the television set offered via the item listing.
In some embodiments, the observed score module 54 determines the observed listing quality score (e.g., the second part) by deriving and analyzing demand metrics representing the actual historical performance of the item listing, or item listings determined to be similar. The actual historical performance may be based on some time-based metric. For instance, in some embodiments, the demand metric may be the number of transactions (e.g., sales) per search impression, which may generally be referred to as a conversion rate. Accordingly, if a particular item listing results in a transaction being concluded (e.g., a sale) every time the item listing is presented in a search results page, then this strong performance of the item listing should be reflected in the listing quality score. Similarly, if an item listing has lots of search impressions—that is, it has been presented in a search results page several times—but has no, or only a few, transactions, then the item listing may not be a strong performing item listing, and this poor performance should be reflected in a lower listing quality score.
Of course, a single quantity item listing—that is, an item listing offering only a single item—will not have the benefit of the demand metric, transactions per search impressions, as the item listing expires upon the first (and only) transaction (e.g., sale of the item). Accordingly, in some embodiments, for some types of item listings, such as auctions and single item fixed price listings, the demand metric for determining the observed listing quality score may be based on the number of views, the number of bids (for an auction), or the number of watch lists associated with the item listing. Alternatively, in some embodiments, the demand metric for singe-item listings (both auctions and fixed price) may be based on the performance of item listings determined to be similar to the single quantity item listing. The demand metric for a multi-quantity item listing, however, may be based on the performance of the actual item listing, item listings determined to be similar, or some combination.
When an item listing is first generated and initially listed, the item listing will not have any historical data available for assessing its actual performance. Therefore, the listing quality score of a new item listing is based primarily on a prediction (e.g., the predicted listing quality score), taking into consideration the historical performance of item listings with similar item attributes. However, over time, as the new item listing is presented in search results pages, historical data for assessing the performance of the item listing will become available. Consequently, in some embodiments, the listing quality score is based on a weighted sum of the predicted score and the observed score, such that, over time, the weight is shifted to move the emphasis from the predicted listing quality score to the observed listing quality score, as historical data becomes available to assess the actual performance of the item listing, and thus the demand for the item offered via the item listing. For instance, the weighting may be adjusted over time, such that, in the beginning, when an item listing is new, the emphasis is on the predicted score component. This is because the observed data for determining the demand metrics may not yet be available. Over time, however, as the item listing is displayed in search results pages, the actual historical data used for deriving the observed demand metric may be collected. As such, over time, the weight applied to the predicted listing quality score may be reduced, and the weight applied to the observed listing quality score (e.g., the demand metric(s)) may be increased. Accordingly, as shown in
In some embodiments, item listings may be grouped by some item attribute, such that item listings from each group are intermingled with one another, according to some predefined ratio, when presented in a search results page. For example, in some embodiments, item listings may have an item attribute that indicates whether the item(s) offered via the item listing is being offered via an auction process, or via a fixed price. The intermingler module 44 may ensure that the search results page includes item listings from both groups (e.g., auction and fixed price) in quantities established by some predefined ratio. Similarly, item listings may be grouped into “known” item listings and “unknown” item listings, where “known” item listings represent item listings for which historical data is available to derive one or more demand metrics for the purpose of assessing their actual performance, and “unknown” item listings represent newer item listings for which there is insufficient historical data available to confidently derive a demand metric for use in assessing the performance of the item listing. Accordingly, the format mix enforcement module 58 may specify and enforce a certain mix of item listings, based on some item attribute, such as an item attribute indicating the offering is via auction or fixed price, or that an item listing is in the “known” group, or the “unknown” group. Other item attributes may also be used by the format mix enforcement module 58 and intermingler module 44.
Another module may provide for the general administration, evaluation and enforcement of one or more business rules, as indicated in
IF (CATEGORY=JEWELRY & SELLER QUALITY SCORE<3)=>−20% In this example, an item listing that has been designated as being in the category, “JEWELRY”, is to have its ranking score decreased by twenty percent if the seller quality score is less than three. This business rule reflects the desire to ensure that, when a potential buyer is interested in an item of jewelry, the item listings presented in the most prominent positions of the search results page are from sellers who have good seller quality scores, and thus can generally be trusted. Other business rules may be formulated to promote or demote items based on a variety of seller attributes and item attributes, including an item listing's proposed shipping method and/or cost.
In some embodiments, when processing a query resulting from a potential buyer's search request, the item listings that satisfy the search request are ordered or otherwise positioned or arranged in a search results page (e.g., an Internet document or web page) based on a ranking score calculated for, and assigned to, each item listing. For instance, in response to receiving and processing a search request, one or more algorithms are used to assign ranking scores (sometimes referred to as a Best Match Score) to each item listing that satisfies the search request. The ranking scores assigned to the item listings that satisfy the search request are then used to determine where each individual item listing is to appear when presented to a user in a search results page. Accordingly, in some embodiments, the item listings that are assigned the highest ranking scores are placed in the positions deemed to be most prominent, and therefore most likely to be seen and selected by a user. For example, the item listings with the highest ranking scores may be positioned at the top of a first page of several search results pages that together comprise a long list of item listings that satisfy a potential buyer's search request.
In some embodiments, the ranking score is itself comprised of several sub-scores or component scores. For instance, as illustrated in
As illustrated in
As illustrated in
The part of the listing quality score representing the predicted score is based on an analysis of item attributes of the item listing, in comparison with item attributes of item listings determined to be similar. Although many item attributes may be considered in various embodiments, in some embodiments the price of the item and the shipping cost are the primary predictors of quality. For instance, the price of an item listing relative to the prices of similar item listings that have previously resulted in transactions is used as a metric to indicate the likelihood that an item listing will result in a transaction. If the price for the item listing is below the median price for similar item listings, the likelihood that a transaction will conclude if the item listing is presented increases. Similarly, if the price for the item listing is greater than the median price for similar item listings, the likelihood of a transaction concluding decreases. The same general analysis can be undertaken for shipping cost as well. In some embodiments, the shipping cost is analyzed separately from the price of the item, and in some cases, the shipping cost and price are summed to derive a total price that is used in the analysis.
The listing quality score is also based in part on an observed score representing a demand metric or combination of demand metrics. A demand metric represents a measure of the demand for an item based at least in part on historical data. For instance, in some embodiments, a demand metric used for calculating a listing quality score is calculated as a ratio of the number of transactions concluded per search impressions for an item listing, or for item listings determined to be similar. For example, in the case of a multi-quantity item listing—that is, an item listing offering multiple items (e.g., one-hundred mobile phones)—the observed demand metric may be derived as the ratio of the number of transactions concluded per the number of search impressions for the item listing. Again referring to the example item listing for a mobile phone, if five out of ten times the item listing is presented in a search results page a buyer concludes a transaction by purchasing a mobile phone, then the transactions per search impressions ratio is fifty percent (50%). This demand metric may be normalized, such that the final observed score takes into consideration the performance of the item listing in relation to the performance of other item listings for similar items. For instance, for certain categories of items (e.g., Automobiles, Coins, Stamps, Mobile Phones, and so on), different observed scores may be interpreted differently. For instance, ratio of the transactions per search impressions with value fifty percent (50%) may be viewed as a “good” ratio, indicating a strong item listing performance, for one category (e.g., Automobiles), but a “bad” ratio, indicating a weak item listing performance for another category (e.g., Mobile Phones).
In general, if the ratio of the number of transactions per search impressions for an item listing is high, the likelihood that the item listing will result in a transaction is also high. However, if the total number of search impressions for a given item listing is low, the confidence in the demand metric may be low. For instance, if the item listing has only one search impression, and that search impression ultimately resulted in a transaction, it may be difficult to predict whether the item listing is a “good” item listing. Accordingly, and as described more completely below, the weighting factor for the demand metric may be a function of the number of search impressions for the item listing, or a metric referred to as time on site (TOS), representing the length or duration of time the item listing has been active.
In some embodiments, the weighting factor is a function of a time-based metric, such that, when the item listing is first listed, the emphasis is on the predicted score, but over time, the emphasis is shifted to the observed score. For example, in some embodiments, the weighting factor is a function of the number of search impressions that an item listing has received. For instance, when the search impression count (i.e., the number of times an item listing has been presented in a search results page) reaches some minimum threshold, the weighting factor applied to the predicted score is decreased, resulting in less emphasis on the predicted score, and the weighting factor applied to the observed metric is increased, resulting in greater emphasis on the observed metric component of the listing quality score.
In some embodiments, a single algorithm is used to assign a score to each item listing. For example, after determining which item listings satisfy a search request, a single algorithm is used to assign a score to each item listing determined to satisfy the search request. This score (e.g., the Best Match Score) is then used to determine the position of each item listing when the item listings are presented to a user, for example, in a search results page. Alternatively, in some embodiments, several algorithms are utilized to assign scores to item listings. For instance, in some embodiments, a separate algorithm is used to assign scores to item listings based on a characteristic of the item listings, such that the algorithm used for any particular item listing is selected based on a particular characteristic or attribute value of the item listing. For instance, when the total population of item listings includes both auction listings and fixed-price listings, one algorithm may be used to assign a score to all item listings that include a fixed price, while a separate algorithm may be used for item listings that are offered at auction. Similarly, with multiple-quantity item listings offered at a fixed price—that is, item listings that offer multiple units of the same item at a fixed price—separate algorithms may be used to assign scores to those item listings that are new—and thus do not have available historical data for assessing the quality of the item listing—and those item listings that are older—and thus have available historical data for assessing the quality of the item listing. Similarly, different algorithms may be used to assign listing quality scores to item listings in different categories. For instance, some categories (e.g., Mobile Phones) may use transactions per search impressions as the observed demand metric for the observed listing quality score, whereas item listings in another category (e.g., Automobiles) may use the ratio of views per search impression as the demand metric for the observed listing quality score.
At method operation 72, for each item listing satisfying the search query, a listing quality score is determined. Because the listing quality is not dependent upon the search terms used in the search query, in some embodiments, the listing quality score for each item listing may be pre-calculated—that is, calculated prior to the search request being processed. Accordingly, in some embodiments, the listing quality score can simply be retrieved, for example, by looking up the listing quality score in a database. Alternatively, in some embodiments, only a portion of the underlying data used for deriving the listing quality score may be pre-calculated. Therefore, in some embodiments, the listing quality score for each item may be calculated in response to the execution of the search query and the identification of the item listings satisfying the query.
In any case, at method operation 74, one or more business rules are evaluated for the item listings satisfying the search query. The evaluation of a business rule will, for some item listings, result in a business rules score that has the effect of promoting or demoting an item listing, for instance, by increasing or decreasing the overall ranking score of the item listing. For instance, when the business rules are evaluated, if the ranking score is equivalent to the relevance score multiplied by the listing quality score, upon evaluating the business rules, the ranking score will be multiplied by a business rules score. In some embodiments, a business rules score of one hundred percent (100%) is equivalent to no change—that is, no demotion, and no promotion. Likewise, a business rules score less than one hundred percent will result in a demotion, while a business rules score greater than one hundred percent will result in a promotion.
At method operation 76, the relevance score, listing quality score, and business rules score are multiplied together to derive a ranking score for each item listing. Finally, at method operation 78, the item listings are sorted in accordance with their corresponding ranking score, and presented in a search results page.
Although not shown in
As briefly noted above, in some embodiments, the ranking score (e.g., the Best Match Score) assigned to an individual item listing is based in part on a listing quality score representing a measure of the overall quality of an item listing. For instance, the quality of an item listing may be viewed as the probability that an item being offered for sale via the item listing will be purchased if the item listing is presented in a search results page. In general, with all else equal, those item listings that satisfy the user's search query and have the highest listing quality scores are presented in the most prominent positions of the search results page. As described in detail below, many factors or sub-components may go into determining the listing quality score for an item listing. Additionally, item listings may be assigned to different groups or “buckets” based on certain characteristics of the item listings, such that a different algorithm is used to determine the listing quality score used in deriving an item listing's ranking score, based on the assigned group or bucket. Similarly, item listings assigned to certain groups may be intermingled (e.g., rearranged or re-ranked) to ensure that a certain ratio or mix of item listings, based on their assigned category, are presented in a search results page.
As illustrated in
Because a new item listing will not yet have been presented in a search results page, a new item listing will not have any associated historical data by which its performance can be measured. Accordingly, for new item listings, the listing quality score 82 is based primarily upon the predicted listing quality score 84, and is essentially a prediction of how the item listing will perform, based on an analysis of the item attributes, and in some cases seller attributes, of the item listing. In particular, the analysis used in determining the predicted listing quality score 84 involves comparing the item attributes of the item listing with item attributes of other similar item listings for which historical performance data is available. For example, if the price of an item is higher or lower than some measure of central tendency (e.g., median, mean or mode) for the prices of similar items, then this information can be used to predict how the new item listing will perform.
In addition to the price of an item, a variety of other item attributes may be considered in deriving the predicted listing quality score 84 for the overall listing quality score 82, including: the condition of the item, the shipping method and cost, the duration or length of time the item listing has been active, a seller's prior conversion rate for all items or items in a particular category, as well as a seller's rating (e.g., based on feedback provided by buyers). In general, a high price will result in a lower listing quality score 82—particularly a high price relative to the mean, median or mode price of similar item listings. Similarly, the higher the cost of shipping relative to the cost of shipping for similar item listings, the lower the listing quality score will be. With respect to the condition of the item, the better the condition stated by the seller, typically the better the listing quality score will be. Of course, a great number of other item or seller attributes might be considered when deriving the predicted listing quality score 84.
Various methods may be used to identify those item listings deemed similar to the item listing to which the listing quality score is being assigned. For instance, a comparison of the titles may be made, such that item listings using one or more of the same key words in their titles may be deemed similar. Additionally, two item listings may be deemed similar only when the item listings have similar titles and they are assigned to the same category, or are listed on the same website. Additional constraints may also be used. For instance, an item listing may be deemed similar to the item listing to which the listing quality score is being assigned if the prices of the item listings are within a certain percentage of one another. For example, this prevents an unreasonable comparison of a Mercedes Benz toy car priced at $3.00, with a Mercedes Benz classic car priced at $300, 000. In some embodiments, only a certain percentage of the most similar items are used when determining the predicted listing quality score. For instance, when determining the median price of similar item listings, the median price of the top 10% of most similar item listings may be determined for comparison purposes.
In addition, when deriving the predicted listing quality score 84 for an item listing, the actual performance of item listings determined to be similar may be considered. Accordingly, the similar item listings that are of interest are the item listings that have resulted in transactions, or have some historical data available to assess their performance. For instance, if an analysis of historical data indicates that the conversion rate for a certain product is 90% when the product is priced at or below a particular price, then a prediction can be made that the likelihood that an item listing for that product with a price at or below the particular price is 90%. This may result in a high listing quality score. The number of search impressions, number of views, number of watch lists, and/or number of transactions concluded for item listings determined to be similar may provide an indication of how a new item listing will perform. In this case, a search impression is defined as the presentation of an item listing in a search results page. Accordingly, every time an item listing appears in a search results page, a search impression counter for the item listing is increased. A view occurs when an item listing presented in a search results page is selected by, and presented to, a user. A watch list is a mechanism for monitoring an item listing. For example, a potential buyer may add an item listing to a watch list so that the potential buyer receives notifications about certain events, such as, the conclusion of a transaction via an auction, and so forth. The number of unique users who add an item listing to a watch list can be used as a measure of the interest (demand) in an item listing. A transaction is the sale of an item. In some embodiments, when a user purchases an item in quantity, a single transaction will be counted. For instance, if a user buys five items via a single multi-quantity item listing, the sale of the five items is viewed as a single transaction for the purpose of determining a demand metric used in calculating the predicted score component of a listing quality score.
In some embodiments, a measure of central tendency (e.g., a median, mean or mode) is calculated for a particular item attribute, or demand metric, for a certain sized subset of similar item listings. For instance, for a certain sized subset of the most similar item listings, the median selling price, median shipping cost, median number of search impressions, and so forth, are calculated. Then, the item attributes of the item listing being assigned the predicted listing quality score are compared to these median values. If, for example, the median price at which transactions were concluded for a set of similar item listings is greater than the price of an item listing being assigned a listing quality score, then the lower price of the item listing, compared to the median price of similar item listings, should be reflected in the listing quality score as a positive (e.g., a higher score). Similarly, if the item listing being assigned a predicted listing quality score has a shipping cost that is higher than the median shipping cost for the set of similar item listings under consideration, this high shipping cost—relative to the median shipping cost of similar items—is reflected in the predicted listing quality score as a negative (e.g., lower score).
In some embodiments, the predicted listing quality score 84 may be used as the overall listing quality score 82. However, as shown in the equation 80 of
One of the issues that exists with conventional methods for assessing the quality of an item listing is that exposure (e.g., search impressions) leads to transactions (sales), which leads to more exposure. Consequently, when a listing quality score depends in part on a demand metric, such as transactions (sales), those item listings that have performed well in the past tend to be deemed as high quality, and are therefore positioned in the search results page in the most prominent positions (e.g., at the top of the first page). Of course, being placed in a prominent position on the search results page will naturally result in additional transactions (sales), leading one to believe the item listing is high in quality. This of course makes it difficult for new item listings, with no historical data available for assessing quality, to break-in to the high quality tier of item listings and receive placement in the most prominent positions in the search results page.
Some embodiments of the invention address this issue in at least two ways. First, as illustrated in
Referring now to
Referring now to
By basing the listing quality score of an item listing on a weighted combination of a predicted score and observed demand metrics, new item listings are not unduly penalized for their lack of performance data. Moreover, by shifting the emphasis over time from the predicted listing quality score to the observed listing quality score, those item listings that perform well are still rewarded over time by achieving higher listing quality scores, and thus being positioned prominently in the search results page.
Another mechanism used to ensure that new item listings are not unduly penalized for their lack of historical data by which their performance can be measured is the concept intermingling item listings that have been assigned to different “buckets” or groups. For example, as illustrated in
As briefly noted above, in some embodiments, the ranking score (e.g., the Best Match Score) assigned to each item listing that satisfies a user's search query may be adjusted (up or down) to reflect a promotion or demotion, based on the evaluation of one or more business rules. For example, it may be desirable to promote or demote item listings that have certain item attributes or seller attributes. If, for example, an item listing has free shipping, the listing may be promoted. Similarly, if a seller has a low seller quality score (based in part on feedback from buyers), an item listing of the seller may be demoted to reflect the poor seller quality score. In some cases, when the business rules are transparent and therefore known to both the sellers and buyers, promotions and demotions might be used to encourage certain behavior.
In some embodiments, rules can be expressed using Boolean logic, with “AND” and “OR” expressions, and using any number and combination of item and seller attributes. The business rule 120 expressed in
Referring again to
The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented modules that operate to perform one or more operations or functions. The modules referred to herein may, in some example embodiments, comprise processor-implemented modules.
Similarly, the methods described herein may be at least partially processor-implemented. For example, at least some of the operations of a method may be performed by one or more processors or processor-implemented modules. The performance of certain of the operations may be distributed among the one or more processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the processor or processors may be located in a single location (e.g., within a home environment, an office environment or as a server farm), while in other embodiments the processors may be distributed across a number of locations.
The one or more processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as a “software as a service” (SaaS). For example, at least some of the operations may be performed by a group of computers (as examples of machines including processors), these operations being accessible via a network (e.g., the Internet) and via one or more appropriate interfaces (e.g., Application Program Interfaces (APIs).)
The example computer system 1500 includes a processor 1502 (e.g., a central processing unit (CPU), a graphics processing unit (GPU) or both), a main memory 1501 and a static memory 1506, which communicate with each other via a bus 1508. The computer system 1500 may further include a display unit 1510, an alphanumeric input device 1517 (e.g., a keyboard), and a user interface (UI) navigation device 1511 (e.g., a mouse). In one embodiment, the display, input device and cursor control device are a touch screen display. The computer system 1500 may additionally include a storage device (e.g., drive unit 1516), a signal generation device 1518 (e.g., a speaker), a network interface device 1520, and one or more sensors 1521, such as a global positioning system sensor, compass, accelerometer, or other sensor.
The drive unit 1516 includes a machine-readable medium 1522 on which is stored one or more sets of instructions and data structures (e.g., software 1523) embodying or utilized by any one or more of the methodologies or functions described herein. The software 1523 may also reside, completely or at least partially, within the main memory 1501 and/or within the processor 1502 during execution thereof by the computer system 1500, the main memory 1501 and the processor 1502 also constituting machine-readable media.
While the machine-readable medium 1522 is illustrated in an example embodiment to be a single medium, the term “machine-readable medium” may include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more instructions. The term “machine-readable medium” shall also be taken to include any tangible medium that is capable of storing, encoding or carrying instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present invention, or that is capable of storing, encoding or carrying data structures utilized by or associated with such instructions. The term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, and optical and magnetic media. Specific examples of machine-readable media include non-volatile memory, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.
The software 1523 may further be transmitted or received over a communications network 1526 using a transmission medium via the network interface device 1520 utilizing any one of a number of well-known transfer protocols (e.g., HTTP). Examples of communication networks include a local area network (“LAN”), a wide area network (“WAN”), the Internet, mobile telephone networks, Plain Old Telephone (POTS) networks, and wireless data networks (e.g., Wi-Fi® and WiMax® networks). The term “transmission medium” shall be taken to include any intangible medium that is capable of storing, encoding or carrying instructions for execution by the machine, and includes digital or analog communications signals or other intangible medium to facilitate communication of such software.
Although an embodiment has been described with reference to specific example embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense. The accompanying drawings that form a part hereof, show by way of illustration, and not of limitation, specific embodiments in which the subject matter may be practiced. The embodiments illustrated are described in sufficient detail to enable those skilled in the art to practice the teachings disclosed herein. Other embodiments may be utilized and derived therefrom, such that structural and logical substitutions and changes may be made without departing from the scope of this disclosure. This Detailed Description, therefore, is not to be taken in a limiting sense, and the scope of various embodiments is defined only by the appended claims, along with the full range of equivalents to which such claims are entitled.
This patent application is a continuation of U.S. patent application Ser. No. 15/613,946, filed on Jun. 5, 2017, which is a continuation of U.S. patent application Ser. No. 14/530,482, filed on Oct. 31, 2014, which is a continuation of U.S. patent application Ser. No. 12/476,046, filed on Jun. 1, 2009, which claims the benefit of U.S. Provisional Patent Application Ser. No. 61/167,796, filed on Apr. 8, 2009, the benefit of priority of each of which is claimed hereby, and each are incorporated herein by reference in their entirety.
| Number | Date | Country | |
|---|---|---|---|
| 61167796 | Apr 2009 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15613946 | Jun 2017 | US |
| Child | 17334256 | US | |
| Parent | 14530482 | Oct 2014 | US |
| Child | 15613946 | US | |
| Parent | 12476046 | Jun 2009 | US |
| Child | 14530482 | US |
