Method and system for optimizing website searching with user pathing

Information

  • Patent Grant
  • 10970769
  • Patent Number
    10,970,769
  • Date Filed
    Thursday, March 2, 2017
    8 years ago
  • Date Issued
    Tuesday, April 6, 2021
    4 years ago
  • Inventors
    • Iqbal; Nasreen (Midvale, UT, US)
  • Original Assignees
  • Examiners
    • Smith; Jeffrey A.
    • Smith; Lindsey B
    Agents
    • Clayton Howarth, P.C.
Abstract
A system and method for creating an e-commerce, dynamic, internal search engine are disclosed. The system and method include providing a server having a memory and a processor, and providing the server with a search engine configured to perform the steps of: identifying a first user search term that results in a first search result and the number of occurrences the first search term is input into the search engine. The search engine then identifies a second user search term input into the search engine subsequent to the first user search term and the number of occurrences the second search term is input into the search engine and identifies the number of occurrences when the second search term yields a successful search result. The search engine then modifies subsequent search results facilitated by the first user search term to reflect the number of successful search results of the second search term.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS

Not applicable.


STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable.


BACKGROUND
1. The Field of the Invention

The present disclosure relates generally to managing products listed on e-commerce websites, and more particularly, but not necessarily entirely, to improving internal searching of an e-commerce website to compensate and adjust user product searches based on historical data on user pathing and related products.


2. Description of Related Art

Sellers have long been able to list items for sale on e-commerce websites. These e-commerce websites are often created having user search engines to identify and locate products and product inventory available for sale.


Inherent problems often result from the users' use of these product search engines. For example, a user may misspell a key word or name of a product, resulting in no search results or irrelevant search results. Users may also be unfamiliar with industry naming conventions and taxonomy resulting in the users being unsatisfied with the search results and leaving or abandoning the website. Users may also become frustrated with multiple searches and “refining” searches resulting in cumbersome search results.


These search engine problems often result in users failing to locate desired products on the e-commerce website, even though such desired products may be available on the website, but are not located or found by the user.


Another problem with product search engines results from trending products or product terms. Some search terms may be used in higher frequency at specific times of the year and relate to different types of products depending on the season or proximity to a popular holiday. Therefore, there is a significant need for a product search engine that is dynamic and can modify search results on a rolling basis to better ensure that users are able to identify and locate desired products on an e-commerce website regardless of the season.


The features and advantages of the disclosure will be set forth in the description that follows, and in part will be apparent from the description or may be learned by the practice of the disclosure without undue experimentation. The features and advantages of the disclosure may be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims.





BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the disclosure will become apparent from a consideration of the subsequent detailed description presented in connection with the accompanying drawings in which:



FIG. 1 is a diagram of a computing device suitable for use with the present invention;



FIG. 2 is a diagram of a computing server and network suitable for use with the present invention;



FIG. 3 is an example of a data table utilized by an embodiment of the present invention;



FIG. 4 is a method of creating a product search engine according to an embodiment of the present invention;



FIG. 5 is a method of creating a product search engine according to another embodiment of the present invention; and



FIG. 6 is a data table utilized by a further embodiment of the present invention.





DETAILED DESCRIPTION

For the purposes of promoting an understanding of the principles in accordance with the disclosure, reference will now be made to the embodiments illustrated in the drawings and specific language will be used to describe them. It will nevertheless be understood that no limitation of the scope of the disclosure is thereby intended. Any alterations and further modifications of the inventive features illustrated herein, and any additional applications of the principles of the disclosure as illustrated herein, which would normally occur to one skilled in the relevant art and having possession of this disclosure, are to be considered within the scope of the disclosure claimed.


It must be noted that, as used in this specification and the appended claims, the singular forms “a,” “an,” and “the” include plural referents unless the context clearly dictates otherwise. In describing and claiming the present disclosure, the following terminology will be used in accordance with the definitions set out below. As used herein, the terms “comprising,” “including,” “containing,” “characterized by,” and grammatical equivalents thereof are inclusive or open-ended terms that do not exclude additional, unrecited elements or method steps.


Reference throughout this specification to “one embodiment,” “an embodiment” or “illustrative embodiment,” or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present disclosure. Thus, appearances of the phrases “in one embodiment,” “in an embodiment,” and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.


Reference to a computer program may take any form capable of generating a signal, causing a signal to be generated, or causing execution of a program of machine-readable instructions on a digital processing apparatus. A computer program may be embodied by a transmission line, an optical storage medium, digital-video disk, a magnetic tape, a Bernoulli drive, a magnetic disk, a punch card, flash memory, integrated circuits, or other digital processing apparatus memory device.


Furthermore, the described features, structures, or characteristics of the disclosure may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided, such as examples of programming, software modules, user selections, network transactions, database queries, database structures, hardware modules, hardware circuits, hardware chips, etc., to provide a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the disclosure may be practiced without one or more of the specific details, or with other methods, components, materials, and so forth. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the disclosure.


Referring now to FIG. 1, there is shown an exemplary embodiment of a computer 100, that may be used for the computing devices used in the present disclosure. It will be appreciated that the computing devices may have more or fewer features than shown in FIG. 1 as the individual circumstances require. Further, the computer 100 shown in FIG. 1 may have various forms, including a desktop PC, a laptop or a portable tablet form, or a hand held form. The features shown in FIG. 1 may be integrated or separable from the computer 100. For example, while a monitor 146 is shown in FIG. 1 as being separate, it may be integrated into the computer 100, such as the case of a laptop or tablet type computer.


The computer 100 may include a system memory 102, and a system bus 104 that interconnects various system components including the system memory 102 to the processing unit 106. The system bus 104 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures as is known to those skilled in the relevant art. The system memory may include read only memory (ROM) 108 and random access memory (RAM) 110. A basic input/output system (BIOS) 112, containing the basic routines that help to transfer information between elements within the computer 100, such as during start-up, is stored in ROM 108. The computer 100 may further include a hard disk drive 114 for reading and writing information to a hard disk (not shown) and an optical disk drive 120 for reading from or writing to a removable optical disk 122 such as a CD ROM, DVD, or other optical media.


It will be appreciated that the hard disk drive 114 and optical disk drive 120 may be connected to the system bus 104 by a hard disk drive interface 124 and an optical disk drive interface 128, respectively. The drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules and other data for the computer 100. Although the exemplary environment described herein employs a hard disk and a removable optical disk 122, it will be appreciated by those skilled in the relevant art that other types of computer readable media that can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, random access memories, read only memories, and the like may also be used in the exemplary operating environment.


A number of program modules may be stored on the hard disk 114, optical disk 122, ROM 108 or RAM 110, including an operating system 130, one or more applications programs 132, other program modules 134, and program data 136. A user may enter commands and information into the computer 100 through input devices such as a keyboard 138 and a pointing device 140, such as a mouse. Other input devices (not shown) may include a joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 106 through a serial port interface 140 that is coupled to the system bus 104. Such devices can be connected by a universal serial bus (USB) interface 142 with a USB port 144 and to which other hubs and devices may be connected. Other interfaces (not shown) that may be used include parallel ports, game ports, and the IEEE 1394 specification.


A monitor 146 or other type of display device is also connected to the system bus 104 via an interface, such as a video adapter 148. In addition to the monitor 146, computers 100 typically include other peripheral output or input devices. A resistive finger touch screen may also be used.


A USB hub 150 is shown connected to the USB port 144. The hub 150 may in turn be connected to other devices such as a digital camera 152 and modem 154. Although not shown, it is well understood by those having the relevant skill in the art that a keyboard, scanner, printer, external drives (e.g., hard, disk and optical) and a pointing device may be connected to the USB port 144 or the hub 150. Thus, it should be understood that additional cameras and devices may be directly connected to the computer through the USB port 144. Thus, the system depicted is capable of communicating with a network and sending/receiving audio, video, and data.


The computer 100 may operate in a networked environment using logical connections to one or more remote computers. The types of connections between networked devices include dial up modems, e.g., modem 154 may be directly used to connect to another modem, ISDN, xDSL, cable modems, wireless and include connections spanning users connected to the Internet. The remote computer may be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 100 in FIG. 1. The logical connections depicted in FIG. 1 include a local area network (LAN) 156 and a wide area network (WAN) 158. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.


When used in a LAN networking environment, the computer 100 is connected to the local network 156 through a network interface or adapter 160. The computer 100 may also connect to the LAN via through any wireless communication standard. When used in a WAN networking environment, the computer 100 typically uses modem 154 or other means for establishing communications over the wide area network 158. It should be noted that modem 154 may be internal or external and is connected to the system bus 104 through USB port 144. A modem may optionally be connected to system bus 104 through the serial port interface 140. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used, e.g., from a LAN gateway to WAN.


Further, the computer 100 may take many forms as is known to those having relevant skill in the art, including a desk top personal computer, a lap top computer, a hand held computer, tablet, and the like.


Generally, the data processors of computer 100 are programmed by means of instructions stored at different times in the various computer-readable storage media of the computer. At execution, they are loaded at least partially into the computer's primary electronic memory. The disclosure described herein includes these and other various types of computer-readable storage media when such media contain instructions or programs for implementing the steps described herein in conjunction with a microprocessor or other data processor. The disclosure also includes the computer itself when programmed according to the methods and techniques described herein.


A server may also take substantially the same form as the computer 100 shown in FIG. 1. The server and corresponding data analysis programs and processor must be capable of processing and analyzing tera-bytes of data and more than 55 million records or data entries on a daily basis. Without such unique servers and processors, having such processor speed and server capabilities the disclosed embodiments of the present invention would not be able to perform the analysis and calculations in such a way that would enable the invention. For example, Hadoop clusters, Matchpath, Spark, or other similarly capable data processors are required to enable the extreme quantity of data analyzed by the present invention and the output of the invention be far less effective, and possibly ineffective, without the requisite server and processor speed and capacity. The disclosed embodiments are dynamic and depend upon the ability to process very large amounts of data on a daily basis, or even multiple times a day, without which the disclosed invention would be inoperable.


Referring now to FIG. 2, there is shown a system 200 pursuant to one embodiment of the present disclosure for allowing e-commerce between buyers and sellers via a seller website hosted on a server 202. As used herein, the term “e-commerce” refers to the buying and selling of goods and services on the Internet or the offer to buy or sell goods and services on the Internet. In one embodiment, the server 202 is operated and controlled by a seller. This seller may be referred to herein as the “Website Operator.”


The Website Operator provides a service to allow buyers to engage in e-commerce using its server 202. Typically, the seller may offer its goods through the server 202 to create an online marketplace. Numerous buyers may also access the server 202 as well. Access to server 202 by buyers may be accomplished through a login procedure as is known to one having ordinary skill in the art, or may be openly accessible to the public.


The server 202 is connected to an electronic storage medium 204. Residing on the storage medium 204 are data related to seller's products and/or services, hereinafter referred to generally as Product Information, and customer or user path data and click history. The Product Information may be uploaded directly from a seller's computer terminal 206 over a network.


The Product Information is uploaded in a manner such that the Product Information is associated with the seller. The Product Information may be updated as often as is necessary over a network, including, without limitation, daily, weekly and monthly.


The seller may also access server 202 remotely, before or after the Product Information has been uploaded to allow the seller to manage its listings.


The server 202 may provide webpages to a prospective buyers' terminals 208 and 210 when requested over a network. The webpages may provide the necessary Product Information to the prospective buyer. The webpages may also allow the buyer to search, place a bid, make an offer, request additional information, or purchase the product at the asking price. The webpages may allow for advanced searching of the products offered through server 202 by sellers.


It will be appreciated by those having ordinary skill in the art that the seller's computer terminal 206 and the buyers' terminals 208 and 210 may take the form of terminal 100 discussed in relation to FIG. 1 above. Moreover, the server 202 may also take the form of any host computer on a network that holds information and responds to requests for information from it. It should be noted that the term “server” as used herein is also used to refer to the software that makes the act of serving information possible. The term “server” also refers to commerce servers, for example, that use software to run the main functions of an e-commerce Website, such as product display, online ordering, and inventory management. The term “server” as used herein also refers to application servers, web servers, database servers, and so forth necessary to carry out the present disclosure as is known to one having ordinary skill in the art.


Further, as alluded to above, the storage medium 204 stores information and applications used by server 202 to provide the features described herein. This may include webpages to be served to client computers and data regarding e-commerce, including product and sales information. It should be understood that the storage medium 204 may be utilized to store any information and/or computer applications necessary to carry out the present invention. The networks referred to herein may include any data communications system that interconnects computer systems at various different sites. A network may be composed of any combination of LANs, WANs, or the Internet, for example.


As discussed above, sellers are constantly trying to aid buyers in “successful” e-marketing experiences. On an e-commerce website, a buyer or user can search an e-commerce website database to identify desired products. This product search is typically done by having the user enter a key term or terms that the user believes identify or describe the desired product into a search engine maintained by the seller.


For use in this application a “successful” user search determination occurs when, after a user-initiated products search has been performed, the user clicks on a product webpage and stays on the resulting product webpage for a predetermined amount of time (for example, 7 seconds or more). A successful user determination can also result from a refinement search, where a user is satisfied or somewhat satisfied with the initial product search, but further refines the search to further limit the resulting list of products. Ultimately, a successful determination should represent the user finding the product or products the user desires. Examples of unsuccessful determinations include abandoning a resulting product webpage very quickly, a product search that results in no listed products, a second search that is in a different product category from the initial product search (reflecting a bad initial search), clicking on a main or alternative menu link on the webpage, and a user abandoning the seller e-commerce website without selecting a product.


The present invention overcomes many of the contributing factors that lead to unsuccessful searches by creating a dynamic computer program that analyzes users' behavior on the seller's e-commerce website including identifying how users correct or modify unsuccessful product searches. The computer program then applies the resulting corrections to subsequent user product searches.


For example, the present invention corrects product search errors caused by industry specific terminology, misspellings, product term synonyms, compound nouns, plurals, and product brand name substitutions by taxonomy.


In an illustrative embodiment of the present invention, a computer program will identify a first term (term 1) entered by a user into an e-commerce product search engine. If the initial search is unsuccessful, the program will then identify the second term (term 2) entered by the user. The program keeps track of each occurrence (count 1) of term 1 and each time the user uses both term 1 and term 2 (co-occurrence or cntb). The program can then calculate a confidence score (conf score) that can reflect how often the term 2 resulted in a successful determination.



FIG. 3 is an exemplary table of search terms (term 1 and term 2) entered by users and the resulting confidence score (conf score) calculated by the present invention. The confidence score can be calculated in an exemplary embodiment, by dividing the cntb by the count 1. The computer program can be configured to identify occurrences where the confidence score is significant, for example if the confidence score is above 0.5. If the program determines that a confidence score is significant, then the program can be configured to modify the search results of subsequent user product searches to include the product results of term 2 whenever term 1 is entered by the user. This modification of search results will improve the success rate of user initiated searches without the user having to enter a second term (term 2).


In an illustrative embodiment of the present invention, the program can cluster common terms relevant to the users frequently using the e-commerce product search engine and facilitate more useful and successful product searches. These clusters of common terms can also be considered synonym lists and can be generated using Frequent Pattern-Growth models, which utilize the confidence scores of terms to determine when search term results should be modified to account for commonly used, and commonly successful, synonyms and/or terms clusters. The program can also be configured to be dynamic, having a rolling history that can update term synonyms and cluster lists and modify subsequent product search results on a rolling basis, for example daily, weekly, monthly, etc.


Another illustrative embodiment of the present invention is illustrated by the flow diagram in FIG. 4. A computer program of the present invention can be configured to execute each of the steps of the internal search method 400. First, the program will identify a user search term A and the number of occurrences the term is used 402 in a e-commerce product search engine. Second, the program will identify when a subsequent search term B is used by the user and the number of occurrences the term B is used 404. The program will then identify a co-occurrence number 406, which indicates when term A and term B were both used. A confidence score is then calculated 408 by the program on a rolling basis, enabling the confidence number to be continuously updated.


Once the confidence score has been calculated, the program will then determine if and how a subsequent product search should be modified to account for statistically significant confidence scores 410. For example a confidence score threshold can be determined or evaluated based on the counts of each term, the co-occurrence number, or a z-score. The z-score can be determined by the following formula, z=(X−μ)/σ, where z is the z-score, X is the value of the element, μ is the population mean, and σ is the standard deviation. In other exemplary embodiments, additional “scores” can be calculated to better reflect the likelihood of successful searches resulting from the utilization of term B with term A. Lastly, the program will modify future search term results to reflect the corresponding confidence scores 412. For example, the program may add term B search results to every term A search performed by a user. Alternatively, the program can substitute the search results of term B with the search results of term A (for example, if term A is a misspelling).


Another illustrative embodiment of the present invention is illustrated by the flow diagram in FIG. 5. A computer program of the present invention can be configured to execute each of the steps of the internal search method 500. First, the program will identify a user search term 502 and the resulting URL generated by the search term 504. Then the program will identify the categorization of the URL 506 and identify the action (click) taken by the user 508 and the categorization of the action 510. The program will then count the total search occurrences (using the identified search term 502) and the number that were successful 512. Using the number of successful searches, the program can then calculate the success rate of the search 514. This internal search method 500 can account for and “correct” searches that may be seasonally based or only relevant during the holidays. For example, the term “snow white” may be used to identify a storybook character more frequently during certain times of year and used to reference a color during other times of year. Based on the success rate and identification of user actions, the program can then modify the search term results to reflect the success rate in real time 516. This method of internal search modification can dynamically change and adjust product search results for trends that may occur intermittently in the marketplace.



FIG. 6 illustrates a table that can be utilized by another embodiment of the present invention. The table includes search terms (term A and term B) entered by users and the resulting success score (Success A and Success B) calculated by the present invention and a corresponding confidence score (Conf Score). The confidence score can be calculated in an exemplary embodiment as a factor of Success A and Success B. The computer program can be configured to identify occurrences where the confidence score is significant, for example if the confidence score is above 0.5, or some other selected value. If the program determines that a confidence score is significant, then the program can be configured to modify the search results of subsequent user product searches to include the product results of term B whenever term A is entered by the user, or vice versa. This modification of search results will improve the success rate of user initiated searches without the user having to enter a second term (Terms A and B).


The computer program can also be configured to redirect the search results of Term A to the search results of Term B or use Term A and Term B as synonyms. In further embodiments the program can configure the website to include the search results of Term B in a “related search” or “results also found in” sections of the Term A search result. Each of these embodiments can utilize the calculated confidence score on a rolling dynamic basis.


In each of the embodiments of the present invention, the confidence scores and success rate can be used to evaluate search terms such that poorly performing terms can be removed from “auto-complete” or “auto-redirect” features. Additionally, the disclosed embodiments can also modify filters and facets, such that the terms and search results having the highest confidence scores can by positioned at the top (or first) in subsequent product searches.


In an embodiment of the present invention, the program can cluster common terms relevant to the users frequently using the e-commerce product search engine and facilitate more useful and successful product searches. These clusters of common terms can also be considered synonym lists and can be generated using Frequent Pattern—Growth models, which utilize the confidence scores of terms to determine when search term results should be modified to account for commonly used, and commonly successful, synonyms and/or terms clusters. The program can also be configured to be dynamic, having a rolling history that can update term synonyms and cluster lists and modify subsequent product search results on a rolling basis, for example daily (even multiple times a day), weekly, monthly, etc.


In the foregoing Detailed Description, various features of the present disclosure are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed disclosure requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the following claims are hereby incorporated into this Detailed Description of the Disclosure by this reference, with each claim standing on its own as a separate embodiment of the present disclosure.


It is to be understood that the above-described arrangements are only illustrative of the application of the principles of the present disclosure. Numerous modifications and alternative arrangements may be devised by those skilled in the art without departing from the spirit and scope of the present disclosure and the appended claims are intended to cover such modifications and arrangements. Thus, while the present disclosure has been shown in the drawings and described above with particularity and detail, it will be apparent to those of ordinary skill in the art that numerous modifications, including, but not limited to, variations in size, materials, shape, form, function and manner of operation, assembly, and use may be made without departing from the principles and concepts set forth herein.

Claims
  • 1. A method for creating an e-commerce, dynamic, internal search engine, said method comprising the steps of: providing a server having a memory, and a processor;providing the server with a search engine on an e-commerce website to identify and locate products and product inventory available for sale and configured to perform the steps of: identifying a first user search term input into the search engine that results in a first search result and a number of occurrences the first search term is input into the search engine;identifying a number of occurrences when the first search term yields a successful search result, wherein the successful search result of the first search term occurs when a user clicks on a product that was contained in the results of the first search result and either stays on the resulting product webpage for a predetermined amount of time or enters a refinement search on the results of the first search;identifying a second user search term input into the search engine subsequent to the first user search term that results in a second search result and a number of occurrences the second search term is input into the search engine;identifying a number of occurrences when the second search term yields a successful search result, wherein the successful search result of the second search term occurs when the user clicks on a product that was contained in the results of the second search result and either stays on the resulting product webpage for a predetermined amount of time or enters a refinement search on the results of the second search;modifying subsequent search results facilitated by the first user search term based on the successful search results of the second search term; andproviding, to an end user's computing device, the search results of the second search term with the search results of the first search term when the number of successful search results of the second search term are significant as compared with the number of successful search result of the first search term when an input for a search for the first term is received by the server from the user's computing device via the e-commerce website,wherein the significance of the successful search results of the second term is significant as compared with the number of successful search results of the first search term when a confidence score is greater than a predetermined confidence score threshold,wherein the confidence score is calculated by dividing the number of successful search results yielded by the second search term by the occurrences of the first search term;wherein the confidence score threshold is determined to be a number where the search results of the second term are based on one of three methods including examining the counts of each term, determining the co-occurrence number, and determining a statistically significant z-score, wherein the z-score is determined by the formula z=(X−μ)/σ where z k the z-score, his the value of the element, μ is the population mean, and σ is the standard deviation;wherein the search results of the first term and the search results of the second term are representative of products available for sale on the e-commerce website.
  • 2. The method of claim 1, further comprising: the search engine performing the step of: calculating a confidence score that reflects the number of successful search results yielded by the second search term when compared to the number of occurrences of the first search term.
  • 3. The method of claim 2, wherein the calculating of the confidence score includes dividing the number of successful search results yielded by the second search term by the occurrences of the first search term.
  • 4. The method of claim 3, wherein the modifying of subsequent search results only occurs if the confidence score is above 0.5.
  • 5. The method of claim 1, wherein the modifying of subsequent search results includes combining the search results of the first search term and the second search term.
  • 6. The method of claim 1, wherein the modifying of subsequent search results includes replacing the search results of the first search term with the search results of the second search term.
  • 7. The method of claim 1, wherein the modifying of subsequent search result is performed dynamically on a rolling basis.
  • 8. The method of claim 1, wherein the modifying of subsequent search result is performed at predetermined time intervals.
  • 9. The method of claim 1, wherein the successful search result is defined by a user engaging a product webpage for a predetermined amount of time.
  • 10. The method of claim 9, wherein the successful search result is defined by a user engaging a product webpage for more than 7 seconds.
  • 11. A system for dynamically adjusting an e-commerce, internal search engine, comprising: a server having a memory and a processor;the search engine on an e-commerce website to identify and locate products and product inventory available for sale, wherein the search engine is operable by the server and configured to: identify a first user search term input into the search engine that results in a first search result and a number of occurrences the first search term is input into the search engine;identify a number of occurrences when the first search term yields a successful search result, wherein the successful search result of the first search term occurs when a user clicks on a product that was contained in the results of the first search result and either stays on the resulting product webpage for a predetermined amount of time or enters a refinement search on the results of the first search;identify a second user search term input into the search engine subsequent to the first user search term that results in a second search result and a number of occurrences the second search term is input into the search engine;identify a number of occurrences when the second search term yields a successful search result, wherein the successful search result of the second search term occurs when the user clicks on a product that was contained in the results of the second search result and either stays on the resulting product webpage for a predetermined amount of time or enters a refinement search on the results of the second search;modify subsequent search results facilitated by the first user search term based on the successful search results of the second search term; andprovide, to an end user's computing device, the search results of the second search term with the search results of the first search term when the number of successful search results of the second search term are significant as compared with the number of successful search result of the first search term when an input for a search for the first term is received by the server from the user's computing device via the e-commerce website,wherein the search results of the second term are significant as compared with the number of successful search results of the first search term when a confidence score is greater than a predetermined confidence score threshold,wherein the confidence score is calculated by dividing the number of successful search results yielded by the second search term by the occurrences of the first search term;wherein the confidence score threshold is determined to be a number where the search results of the second term are based on one of three methods including examining the counts of each term, determining the co-occurrence number, and determining a statistically significant z-score, wherein the z-score is determined by the formula z=(X−μ)/σ where z is the z-score, X is the value of the element, μ is the population mean, and σ is the standard deviation;wherein the search results of the first term and the search results of the second term are representative of products available for sale on the e-commerce website.
  • 12. The system of claim 11, wherein the search engine is also configured to: calculate a confidence score that reflects the number of successful search results yielded by the second search term when compared to the number of occurrences of the first search term.
  • 13. The system of claim 12, wherein the calculating of the confidence score includes dividing the number of successful search results yielded by the second search term by the occurrences of the first search term.
  • 14. The system of claim 13, wherein the modifying of subsequent search results only occurs if the confidence score is above 0.5.
  • 15. The system of claim 11, wherein the modifying of subsequent search results includes combining the search results of the first search term and the second search term.
  • 16. The system of claim 11, wherein the modifying of subsequent search results includes replacing the search results of the first search term with the search results of the second search term.
  • 17. The system of claim 11, wherein the modifying of subsequent search result is performed dynamically on a rolling basis.
  • 18. The system of claim 11, wherein the modifying of subsequent search result is performed at predetermined time intervals.
  • 19. The system of claim 11, wherein the successful search result is defined by a user engaging a product webpage for a predetermined amount of time.
  • 20. The system of claim 19, wherein the successful search result is defined by a user engaging a product webpage for more than 7 seconds.
US Referenced Citations (431)
Number Name Date Kind
3573747 Adams et al. Apr 1971 A
3581072 Nymeyer May 1971 A
4412287 Braddock, III Oct 1983 A
4674044 Kalmus et al. Jun 1987 A
4677552 Sibley, Jr. Jun 1987 A
4789928 Fujisaki Dec 1988 A
4799156 Shavit et al. Jan 1989 A
4808987 Takeda et al. Feb 1989 A
4823265 Nelson Apr 1989 A
4854516 Yamada Aug 1989 A
4903201 Wagner Feb 1990 A
RE33316 Katsuta et al. Aug 1990 E
5027110 Chang et al. Jun 1991 A
5053956 Donald et al. Oct 1991 A
5063507 Lindsey et al. Nov 1991 A
5077665 Silverman et al. Dec 1991 A
5101353 Lupien et al. Mar 1992 A
5136501 Silverman et al. Aug 1992 A
5168446 Wiseman Dec 1992 A
5205200 Wright Apr 1993 A
5243515 Lee Sep 1993 A
5258908 Hartheimer et al. Nov 1993 A
5280422 Moe et al. Jan 1994 A
5297031 Gutterman et al. Mar 1994 A
5297032 Trojan et al. Mar 1994 A
5301350 Rogan et al. Apr 1994 A
5305200 Hartheimer et al. Apr 1994 A
5325297 Bird et al. Jun 1994 A
5329589 Fraser et al. Jul 1994 A
5347632 Filepp et al. Sep 1994 A
5375055 Togher et al. Dec 1994 A
5377354 Scannell et al. Dec 1994 A
5394324 Clearwater Feb 1995 A
5407433 Loomas Apr 1995 A
5411483 Loomas et al. May 1995 A
5426281 Abecassis Jun 1995 A
5485510 Colbert Jan 1996 A
5493677 Balogh et al. Feb 1996 A
5553145 Micali Sep 1996 A
5557728 Garrett et al. Sep 1996 A
5579471 Barber et al. Nov 1996 A
5596994 Bro Jan 1997 A
5598557 Doner et al. Jan 1997 A
5621790 Grossman et al. Apr 1997 A
5640569 Miller et al. Jun 1997 A
5657389 Houvener Aug 1997 A
5664111 Nahan et al. Sep 1997 A
5664115 Fraser Sep 1997 A
5689652 Lupien et al. Nov 1997 A
5694546 Reisman Dec 1997 A
5706457 Dwyer et al. Jan 1998 A
5710889 Clark et al. Jan 1998 A
5715314 Payne et al. Feb 1998 A
5715402 Popolo Feb 1998 A
5717989 Tozzoli et al. Feb 1998 A
5721908 Lagarde et al. Feb 1998 A
5722418 Bro Mar 1998 A
5727165 Orish et al. Mar 1998 A
5737599 Rowe et al. Apr 1998 A
5760917 Sheridan Jun 1998 A
5761496 Hattori Jun 1998 A
5761655 Hoffman Jun 1998 A
5761662 Dasan Jun 1998 A
5771291 Newton et al. Jun 1998 A
5771380 Tanaka et al. Jun 1998 A
5778367 Wesinger, Jr. et al. Jul 1998 A
5790790 Smith et al. Aug 1998 A
5794216 Brown Aug 1998 A
5794219 Brown Aug 1998 A
5796395 de Hond Aug 1998 A
5799285 Klingman Aug 1998 A
5803500 Mossberg Sep 1998 A
5818914 Fujisaki Oct 1998 A
5826244 Huberman Oct 1998 A
5835896 Fisher et al. Nov 1998 A
5845265 Woolston Dec 1998 A
5845266 Lupien et al. Dec 1998 A
5850442 Muftic Dec 1998 A
5870754 Dimitrova et al. Feb 1999 A
5872848 Romney et al. Feb 1999 A
5873069 Reuhl et al. Feb 1999 A
5873080 Coden et al. Feb 1999 A
5884056 Steele Mar 1999 A
5890138 Godin et al. Mar 1999 A
5890175 Wong et al. Mar 1999 A
5905975 Asusbel May 1999 A
5907547 Foladare et al. May 1999 A
5913215 Rubinstein et al. Jun 1999 A
5922074 Richard et al. Jul 1999 A
5924072 Havens Jul 1999 A
5926794 Fethe Jul 1999 A
5948040 DeLorne et al. Sep 1999 A
5948061 Merriman et al. Sep 1999 A
5974396 Anderson et al. Oct 1999 A
5974412 Hazlehurst et al. Oct 1999 A
5986662 Argiro et al. Nov 1999 A
5987446 Corey et al. Nov 1999 A
5991739 Cupps et al. Nov 1999 A
5999915 Nahan et al. Dec 1999 A
6012053 Pant et al. Jan 2000 A
6029141 Bezos et al. Feb 2000 A
6035288 Solomon Mar 2000 A
6035402 Vaeth et al. Mar 2000 A
6044363 Mori et al. Mar 2000 A
6045477 Yoshizawa et al. Apr 2000 A
6047264 Fisher et al. Apr 2000 A
6055518 Franklin et al. Apr 2000 A
6058379 Odom et al. May 2000 A
6058417 Hess et al. May 2000 A
6058428 Wang et al. May 2000 A
6061448 Smith et al. May 2000 A
6065041 Lum et al. May 2000 A
6070125 Murphy et al. May 2000 A
6073117 Oyanagi et al. Jun 2000 A
6078914 Redfem Jun 2000 A
6085176 Woolston Jul 2000 A
6104815 Alcorn et al. Aug 2000 A
6119137 Smith et al. Sep 2000 A
6128649 Smith et al. Oct 2000 A
6141010 Hoyle Oct 2000 A
6167382 Sparks et al. Dec 2000 A
6178408 Copple et al. Jan 2001 B1
6185558 Bowman et al. Feb 2001 B1
6192407 Smith et al. Feb 2001 B1
6199077 Inala et al. Mar 2001 B1
6202051 Woolston Mar 2001 B1
6202061 Khosla et al. Mar 2001 B1
6226412 Schwab May 2001 B1
6243691 Fisher et al. Jun 2001 B1
6269238 Iggulden Jul 2001 B1
6271840 Finseth et al. Aug 2001 B1
6275820 Navin-Chandra et al. Aug 2001 B1
6275829 Angiulo et al. Aug 2001 B1
6356879 Aggarwal et al. Mar 2002 B2
6356905 Gershman et al. Mar 2002 B1
6356908 Brown et al. Mar 2002 B1
6366899 Kernz Apr 2002 B1
6370527 Singhai Apr 2002 B1
6373933 Sarkki et al. Apr 2002 B1
6374260 Hoffert et al. Apr 2002 B1
6381510 Amidhozour et al. Apr 2002 B1
6415320 Hess et al. Jul 2002 B1
6434556 Levin et al. Aug 2002 B1
6456307 Bates et al. Sep 2002 B1
6460020 Pool et al. Oct 2002 B1
6466917 Goyal et al. Oct 2002 B1
6484149 Jammes et al. Nov 2002 B1
6489968 Ortega et al. Dec 2002 B1
6522955 Colborn Feb 2003 B1
6523037 Monahan et al. Feb 2003 B1
6601061 Holt et al. Jul 2003 B1
6604107 Wang Aug 2003 B1
6625764 Dawson Sep 2003 B1
6643696 David et al. Nov 2003 B2
6661431 Stuart et al. Dec 2003 B1
6665838 Brown et al. Dec 2003 B1
6701310 Sugiura et al. Mar 2004 B1
6718536 Dupaquis Apr 2004 B2
6725268 Jacket et al. Apr 2004 B1
6728704 Mao et al. Apr 2004 B2
6732161 Hess et al. May 2004 B1
6732162 Wood et al. May 2004 B1
6801909 Delgado et al. Oct 2004 B2
6856963 Hurwitz Feb 2005 B1
6889054 Himmel et al. May 2005 B2
6907401 Vittal et al. Jun 2005 B1
7043450 Velez et al. May 2006 B2
7069242 Sheth et al. Jun 2006 B1
7076453 Jammes et al. Jul 2006 B2
7076504 Handel et al. Jul 2006 B1
7080030 Elgen et al. Jul 2006 B2
7100111 McElfresh et al. Aug 2006 B2
7100195 Underwood Aug 2006 B1
7117207 Kerschberg et al. Oct 2006 B1
7127416 Tenorio Oct 2006 B1
7165091 Lunenfeld Jan 2007 B2
7167910 Farnham et al. Jan 2007 B2
7216115 Walters et al. May 2007 B1
7254547 Beck et al. Aug 2007 B1
7318037 Solari Jan 2008 B2
7324966 Scheer Jan 2008 B2
7340249 Moran et al. Mar 2008 B2
7349668 Ilan et al. Mar 2008 B2
7353188 Yim et al. Apr 2008 B2
7366755 Cuomo et al. Apr 2008 B1
7379890 Myr et al. May 2008 B2
7380217 Gvelesiani May 2008 B2
7401025 Lokitz Jul 2008 B1
7447646 Agarwal et al. Nov 2008 B1
7454464 Puthenkulam et al. Nov 2008 B2
7457730 Degnan Nov 2008 B2
7493521 Li et al. Feb 2009 B1
7496525 Mitchell Feb 2009 B1
7496582 Farnham et al. Feb 2009 B2
7516094 Perkowski Apr 2009 B2
7539696 Greener et al. May 2009 B1
7546625 Kamangar Jun 2009 B1
7552067 Nephew et al. Jun 2009 B2
7565615 Ebert Jul 2009 B2
7606743 Orzell et al. Oct 2009 B2
7610212 Klett et al. Oct 2009 B2
7653573 Hayes, Jr. et al. Jan 2010 B2
7834883 Adams Nov 2010 B2
7912748 Rosenberg et al. Mar 2011 B1
7983950 DeVita Jul 2011 B2
8086643 Tenorio Dec 2011 B1
8112303 Eglen et al. Feb 2012 B2
8140989 Cohen et al. Mar 2012 B2
8214264 Kasavin et al. Jul 2012 B2
8260852 Cselle Sep 2012 B1
8312056 Peng et al. Nov 2012 B1
8494912 Fraser et al. Jul 2013 B2
8577740 Murray et al. Nov 2013 B1
8693494 Fiatal Apr 2014 B2
20010014868 Herz et al. Aug 2001 A1
20010034667 Petersen Oct 2001 A1
20010034668 Whitworth Oct 2001 A1
20010044751 Pugliese et al. Nov 2001 A1
20010047290 Petras et al. Nov 2001 A1
20010047308 Kaminsky et al. Nov 2001 A1
20010051996 Cooper et al. Dec 2001 A1
20020002513 Chiasson Jan 2002 A1
20020007356 Rice et al. Jan 2002 A1
20020013721 Capel et al. Jan 2002 A1
20020022995 Miller et al. Feb 2002 A1
20020023059 Bari et al. Feb 2002 A1
20020026390 Ulenas et al. Feb 2002 A1
20020029187 Meehan et al. Mar 2002 A1
20020038312 Donner et al. Mar 2002 A1
20020040352 McCormick Apr 2002 A1
20020042738 Srinivasan et al. Apr 2002 A1
20020099578 Eicher et al. Jul 2002 A1
20020099579 Scelzo et al. Jul 2002 A1
20020099602 Moskowitz et al. Jul 2002 A1
20020107718 Morrill et al. Aug 2002 A1
20020107853 Hofmann et al. Aug 2002 A1
20020120537 Campbell et al. Aug 2002 A1
20020123957 Notarius et al. Sep 2002 A1
20020129282 Hopkins Sep 2002 A1
20020138399 Hayes et al. Sep 2002 A1
20020147625 Kolke Oct 2002 A1
20020161648 Mason et al. Oct 2002 A1
20020188777 Kraft et al. Dec 2002 A1
20020194049 Boyd Dec 2002 A1
20020198784 Shaak et al. Dec 2002 A1
20020198882 Linden et al. Dec 2002 A1
20030004855 Dutta et al. Jan 2003 A1
20030005046 Kavanagh et al. Jan 2003 A1
20030009362 Cifani et al. Jan 2003 A1
20030009392 Perkowski Jan 2003 A1
20030014400 Siegel Jan 2003 A1
20030028605 Millett et al. Feb 2003 A1
20030032409 Hutcheson et al. Feb 2003 A1
20030035138 Schilling Feb 2003 A1
20030036914 Fitzpatrick et al. Feb 2003 A1
20030040970 Miller Feb 2003 A1
20030041008 Grey et al. Feb 2003 A1
20030046149 Wong Mar 2003 A1
20030069740 Zeidman Apr 2003 A1
20030069790 Kane Apr 2003 A1
20030069825 Burk et al. Apr 2003 A1
20030083961 Bezos et al. May 2003 A1
20030088467 Culver May 2003 A1
20030088511 Karboulonis et al. May 2003 A1
20030093331 Childs et al. May 2003 A1
20030105682 Dicker et al. Jun 2003 A1
20030110100 Wirth, Jr. Jun 2003 A1
20030119492 Timmins et al. Jun 2003 A1
20030131095 Kumhyr et al. Jul 2003 A1
20030139969 Scroggie et al. Jul 2003 A1
20030158792 Perkowski Aug 2003 A1
20030163340 Fitzpatrick et al. Aug 2003 A1
20030167213 Jammes et al. Sep 2003 A1
20030167222 Mehrotra et al. Sep 2003 A1
20030177103 Ivanov et al. Sep 2003 A1
20030187745 Hobday et al. Oct 2003 A1
20030200156 Roseman et al. Oct 2003 A1
20030204449 Kotas et al. Oct 2003 A1
20030217002 Enborg Nov 2003 A1
20040006509 Mannik et al. Jan 2004 A1
20040015416 Foster et al. Jan 2004 A1
20040029567 Timmins et al. Feb 2004 A1
20040044563 Stein Mar 2004 A1
20040055017 Delpuch et al. Mar 2004 A1
20040058710 Timmins et al. Mar 2004 A1
20040073476 Donahue et al. Apr 2004 A1
20040078388 Melman Apr 2004 A1
20040107136 Nemirofsky et al. Jun 2004 A1
20040117242 Conrad et al. Jun 2004 A1
20040122083 Lippert et al. Jun 2004 A1
20040122681 Ruvolo et al. Jun 2004 A1
20040122735 Meshkin Jun 2004 A1
20040122855 Ruvolo et al. Jun 2004 A1
20040128183 Challey et al. Jul 2004 A1
20040128320 Grove et al. Jul 2004 A1
20040148232 Fushimi et al. Jul 2004 A1
20040172323 Stamm Sep 2004 A1
20040172379 Mott et al. Sep 2004 A1
20040174979 Hutton et al. Sep 2004 A1
20040186766 Fellenstein et al. Sep 2004 A1
20040199496 Liu et al. Oct 2004 A1
20040199905 Fagin et al. Oct 2004 A1
20040204991 Monahan et al. Oct 2004 A1
20040240642 Crandell et al. Dec 2004 A1
20040249727 Cook, Jr. et al. Dec 2004 A1
20040267717 Slackman Dec 2004 A1
20050010925 Khawand et al. Jan 2005 A1
20050021666 Dinnage et al. Jan 2005 A1
20050038733 Foster et al. Feb 2005 A1
20050044254 Smith Feb 2005 A1
20050055306 Miller et al. Mar 2005 A1
20050060664 Rogers Mar 2005 A1
20050097204 Horowitz et al. May 2005 A1
20050114229 Ackley et al. May 2005 A1
20050120311 Thrall Jun 2005 A1
20050131837 Sanctis et al. Jun 2005 A1
20050144064 Calabria et al. Jun 2005 A1
20050193333 Ebert Sep 2005 A1
20050197846 Pezaris et al. Sep 2005 A1
20050197950 Moya et al. Sep 2005 A1
20050198031 Peraris et al. Sep 2005 A1
20050202390 Allen et al. Sep 2005 A1
20050203888 Woosley et al. Sep 2005 A1
20050216300 Appelman et al. Sep 2005 A1
20050262067 Lee et al. Nov 2005 A1
20050273378 MacDonald-Korth et al. Dec 2005 A1
20060009994 Hogg et al. Jan 2006 A1
20060010105 Sarukkai et al. Jan 2006 A1
20060031240 Eyal et al. Feb 2006 A1
20060041638 Whittaker et al. Feb 2006 A1
20060058048 Kapoor et al. Mar 2006 A1
20060069623 MacDonald Korth et al. Mar 2006 A1
20060085251 Greene Apr 2006 A1
20060173817 Chowdhury et al. Aug 2006 A1
20060206479 Mason Sep 2006 A1
20060230035 Bailey Oct 2006 A1
20060259360 Flinn et al. Nov 2006 A1
20060271671 Hansen Nov 2006 A1
20060282304 Bedard et al. Dec 2006 A1
20070005424 Arauz Jan 2007 A1
20070027760 Collins et al. Feb 2007 A1
20070073641 Perry et al. Mar 2007 A1
20070077025 Mino Apr 2007 A1
20070078726 MacDonald Korth et al. Apr 2007 A1
20070083437 Hamor Apr 2007 A1
20070100803 Cava May 2007 A1
20070160345 Sakai et al. Jul 2007 A1
20070162379 Skinner Jul 2007 A1
20070192168 Van Luchene Aug 2007 A1
20070192181 Asdourian Aug 2007 A1
20070206606 Coleman et al. Sep 2007 A1
20070214048 Chan et al. Sep 2007 A1
20070226679 Jayamohan et al. Sep 2007 A1
20070233565 Herzog et al. Oct 2007 A1
20070239534 Liu et al. Oct 2007 A1
20070245013 Saraswathy et al. Oct 2007 A1
20070260520 Jha et al. Nov 2007 A1
20070282666 Afeyan et al. Dec 2007 A1
20070299743 Staib et al. Dec 2007 A1
20080015938 Haddad et al. Jan 2008 A1
20080052152 Yufik Feb 2008 A1
20080071640 Nguyen Mar 2008 A1
20080082394 Floyd et al. Apr 2008 A1
20080103893 Nagarajan et al. May 2008 A1
20080126205 Evans et al. May 2008 A1
20080126476 Nicholas et al. May 2008 A1
20080133305 Yates et al. Jun 2008 A1
20080140765 Kelaita et al. Jun 2008 A1
20080162574 Gilbert Jul 2008 A1
20080201218 Broder et al. Aug 2008 A1
20080215456 West et al. Sep 2008 A1
20080288338 Wiseman et al. Nov 2008 A1
20080294536 Taylor et al. Nov 2008 A1
20080300909 Rikhtverchik et al. Dec 2008 A1
20080301009 Plaster et al. Dec 2008 A1
20090006190 Lucash et al. Jan 2009 A1
20090030755 Altberg et al. Jan 2009 A1
20090030775 Vieri Jan 2009 A1
20090106080 Carrier et al. Apr 2009 A1
20090106127 Purdy et al. Apr 2009 A1
20090119167 Kendall et al. May 2009 A1
20090164323 Byrne Jun 2009 A1
20090182589 Kendall et al. Jul 2009 A1
20090204848 Kube et al. Aug 2009 A1
20090222348 Ransom et al. Sep 2009 A1
20090234722 Evevsky Sep 2009 A1
20090240582 Sheldon-Neal et al. Sep 2009 A1
20090276284 Yost Nov 2009 A1
20090276305 Clopp Nov 2009 A1
20090292677 Kim Nov 2009 A1
20090293019 Raffel et al. Nov 2009 A1
20100042684 Broms et al. Feb 2010 A1
20100076816 Phillips Mar 2010 A1
20100076851 Jewell, Jr. Mar 2010 A1
20100094673 Lobo et al. Apr 2010 A1
20100146413 Yu Jun 2010 A1
20100228617 Ransom et al. Sep 2010 A1
20110055054 Glasson Mar 2011 A1
20110060621 Weller et al. Mar 2011 A1
20110103699 Ke et al. May 2011 A1
20110153383 Bhattacharjya et al. Jun 2011 A1
20110153663 Koren et al. Jun 2011 A1
20110191319 Nie Aug 2011 A1
20110196802 Ellis et al. Aug 2011 A1
20110225050 Varghese Sep 2011 A1
20110231226 Golden Sep 2011 A1
20110231383 Smyth et al. Sep 2011 A1
20110271204 Jones et al. Nov 2011 A1
20110276513 Erhart et al. Nov 2011 A1
20120005187 Chavanne Jan 2012 A1
20120030067 Pothukuchi et al. Feb 2012 A1
20120084135 Nissan et al. Apr 2012 A1
20120158715 Maghoul et al. Jun 2012 A1
20120166299 Heinstein et al. Jun 2012 A1
20120231424 Calman et al. Sep 2012 A1
20130073392 Allen et al. Mar 2013 A1
20130080200 Connolly et al. Mar 2013 A1
20130080426 Chen et al. Mar 2013 A1
20130085893 Bhardwaj et al. Apr 2013 A1
20130144870 Gupta et al. Jun 2013 A1
20130145254 Masuko et al. Jun 2013 A1
20130151331 Avner et al. Jun 2013 A1
20130268561 Christie et al. Oct 2013 A1
20140019313 Hu et al. Jan 2014 A1
20140025509 Reisz et al. Jan 2014 A1
20140032544 Mathieu et al. Jan 2014 A1
20140114680 Mills et al. Apr 2014 A1
20140136290 Schiestl et al. May 2014 A1
20140172652 Pobbathi et al. Jun 2014 A1
20140289005 Laing et al. Sep 2014 A1
20170344622 Islam Nov 2017 A1
Foreign Referenced Citations (20)
Number Date Country
2253543 Oct 1997 CA
2347812 May 2000 CA
0636993 Apr 1999 EP
0807891 May 2000 EP
1241603 Mar 2001 EP
2397400 Jul 2004 GB
2424098 Sep 2006 GB
2001283083 Oct 2001 JP
9717663 May 1997 WO
9832289 Jul 1998 WO
9847082 Oct 1998 WO
9849641 Nov 1998 WO
9959283 Nov 1999 WO
0025218 May 2000 WO
0109803 Feb 2001 WO
0182135 Nov 2001 WO
200197099 Dec 2001 WO
200237234 Nov 2002 WO
2003094080 Nov 2003 WO
2012093410 Jul 2012 WO
Non-Patent Literature Citations (99)
Entry
Alex, Neil, “Optimizing Search Results in Elasticsearch with Scoring and Boosting”, Mar. 18, 2015, Qbox.io, accessed at [https://qbox.io/blog/optimizing-search-results-in-elasticsearch-with-scoring-and-boosting] (Year: 2015).
Massimb et al., “Electronic Trading, Market Structure and Liquidity,” Financial Analysts Journal, Jan.-Feb. 1994, pp. 39-49.
McGinnity, “Build Your Weapon,” PC Magazine, Apr. 24, 2011, printed from www.pcmag.com/print_article2?0,1217,a%253D3955,00.asp.
Meade, “Visual 360: a performance appraisal system that's ‘fun,’” HR Magazine, 44, 7, 118(3), Jul. 1999.
“Mediappraise: Mediappraise Receives National Award for Web-Based Technology That Enables Companies to Solve Thorny HR Problem,” Dec. 14, 1998.
Medvinsky et al., “Electronic Currency for the Internet,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
metails.com, www.metails.com homepage, printed Oct. 13, 2004.
Microsoft Computer Dictionary, Fifth Edition, front matter and p. 33.
Microsoft Computer Dictionary, Fifth Edition, front matter, back matter, and pp. 479, 486.
Neches, “FAST—A Research Project in Electronic Commerce,” Electronic Markets—The International Journal, Oct. 1993, 4 pages, vol. 3., No. 3.
Neo, “The implementation of an electronic market for pig trading in Singapore,” Journal of Strategic Information Systems, Dec. 1992, pp. 278-288, vol. 1, No. 5.
O'Mahony, “An X.500-based Product Catalogue,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
“ONSALE: ONSALE Brings Thrill of Auctions and Bargain Hunting Online: Unique Internet retail services debuts with week-long charity auction for the Computer Museum in Boston,” May 24, 1995, printed from www.dialogweb.com/cgi/dwclient?dwcommand,DWEBPRINT%20810-489267.
“ONSALE joins fray as online shopping pcks up speed: INTERNET BOOMS,” Comptuer Reseller News, Jun. 5, 1995.
Palm, Inc., PalmTM Web Pro Handbook, copyright 2002-2003.
Post et al., “Application of Auctions as a Pricing Mechanism for the Interchange of Electric Power,” IEEE Transactions of Power Systems, Aug. 1995, pp. 1580-1584, vol. 10, No. 3.
Preist et al., “Adaptive agents in a persistent shout double auction,” International Conference on Information and Computation, Proceedings of the first international conference on information and computation economies, Oct. 25-28, 1998, Charleston, United States, pp. 11-18.
Qualcomm, “Brew Developer Support,” printed from web.archive.org/web/20020209194207/http://www.qualcomm.com/brew/developer/support/kb/52.html on Aug. 30, 2007.
RCR Wireless News, “Lockheed Martin to use 2Roam's technology for wireless platform,” RCR Wireless News, Sep. 10, 2001.
Reck, “Formally Specifying an Automated Trade Execution System,” J. Systems Software, 1993, pp. 245-252, vol. 21.
Reck, “Trading-Process Characteristics of Electronic Auctions,” Electronic Markets—The International Journal, Dec. 1997, pp. 17-23, vol. 7, No. 4.
repcheck.com, www.repcheck.com homepage, printed from web.archive.org/web/20020330183132/http://repcheck.com on Sep. 5, 2009.
Resnick et al., “Reputation Systems,” Communications of the ACM, Dec. 2000, pp. 45-48, vol. 43, No. 12.
Rockoff et al., “Design of an Internet-based system for remote Dutch auctions,” Internet Research: Electronic Networking Applications and Policy, 1995, pp. 10-16, vol. 5, No. 4.
Rose, “Vendors strive to undo Adobe lock-hold,” Computer Reseller News, Feb. 5, 1996, n 66669, p. 71(7).
Rysavy, “Mobile-commerce ASPs do the legwork,” Network Computing, Jan. 22, 2001, p. 71, 6 pgs., vol. 12, No. 2.
Saunders, “AdFlight to Offer WAP Ads,” Oct. 17, 2000, printed from clickz.com/487531/print.
Schmid, “Electronic Markets,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Schwankert, “Matsushita Taps 2Roam for Wireless Solutions,” www.internetnews.com/bus-news.article.php/674811, Feb. 2, 2001.
Sen, “Inventory and Pricing Models for Perishable Products,” Doctor of Philosophy Dissertation—University of Southern California, Aug. 2000.
Siegmann, “Nowhere to go but up,” PC Week, Oct. 23, 1995, 3 pages, vol. 12, No. 42.
Telephony Staff, “Air-ASP,” Telephony Online, Oct. 2, 2000, 3 pages.
Teo, “Organizational Factors of Success in Using EDIS: A Survey of Tradenet Participants,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Tjostheim et al., “A case study of an on-line auction for the World Wide Web,” printed from www.nr.no/gem/elcom/puplikasjoner/enter98e.html on Jun. 10, 1990, 10 pages.
Turban, “Auctions and Bidding on the Internet: An Assessment,” Electronic Markets—The International Journal, Dec. 1997, 5 pages, vol. 7, No. 4.
ubid.com, “How do I Updated my Address, Phone, Credit Card, Password, etc.?” printed from web.archive.org/web/20010208113903/www.ubid.com/help/topic13asp on Aug. 30, 2007.
ubid.com, “How do I track my shipment?” printed from web.archive.org/web/20010331032659/www.ubid.com/help/topic27.asp on Aug. 30, 2007.
ubid.com, “Can I track all of my bids from My Page?” printed from web.archive.org/web/20010208114049/www.ubid.com/help/topic14.asp on Aug. 30, 2007.
Van Heck et al., “Experiences with Electronic Auctions in the Dutch Flower Industry,” Electronic Markets—The International Journal, Dec. 1997, 6 pages, vol. 7, No. 4.
Verizon Wireless, “Verizon Wireless Customers Get It NowSM; Get Games, Get Pix, Get Ring Tones and Get Going in Full Color,” press release to PRNEWSWIRE, Sep. 23, 2002.
Warbelow et al., “AUCNET: TV Auction Network System,” Harvard Business School 9-190-001, Jul. 19, 1989, Rev. Apr. 12, 1996, pp. 1-15.
Weber, “How Financial Markets are Going On-line,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Wireless Internet, “DailyShopper Selects 2Roam to Enable Mobile Customers to Retrieve Nearby Sales and Promotions Information,” Wireless Internet, Apr. 2001.
Wireless Week, “Verizon Wireless Gets Going on BREW Agenda,” Wireless Week, Sep. 23, 2002.
xchanger.net, webpage printed from www.auctiva.com/showcases/as_4sale.asp?uid=exchanger, undated but at least as early as Oct. 12, 2000.
Yu et al., “Distributed Reputation Management for Electronic Commerce,” Computational Intelligence, 2002, pp. 535-549, vol. 18, No. 4.
Zetmeir, Auction Incentive Marketing, print of all pages of website found at home.earthlink.net/˜bidpointz/ made Oct. 8, 2004.
Zimmermann, “Integration of Financial Services: The TeleCounter,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Zwass, “Electronic Commerce: Structures and Issues,” International Journal of Electronic Commerce, Fall 1996, pp. 3-23, vol. 1, No. 1.
2Roam, Inc., multiple archived pages of www.2roam.com retrieved via Internet Archive Wayback Machine on Jun. 10, 2008.
Alt et al., “Bibliography on Electronic Commerce,” Electronic Markets—The International Journal, Oct. 1993, 5 pages, vol. 3, No. 3.
Alt et al., “Computer Integrated Logistics,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 1, No. 3.
Anonymous, Image manipulation (image-editing software and image-manipulation systems)(Seybold Special Report, Part II), Seybold Report on Publishing Systems, May 15, 1995, pS35(9), vol. 24, No. 18.
auctionwatch.com, multiple pages—including search results for “expedition,” printed Apr. 21, 2011.
auctiva.com, multiple pages, undated but website copyright date is “1999-2000.”
Ball et al., “Supply chain infrastructures: system integration and information sharing,” ACM SIGMOD Record, 2002, vol. 31, No. 1, pp. 61-66.
Berger et al., “Random Ultiple-Access Communication and Group Testing,” IEEE, 1984.
Braganza, “Is Resarch at Cranfield—A Look at the Future,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Brecht et al., “The IM 2000 Research Programme,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Business Wire business/technology editors, “Sellers Flock to OutletZoo.com as New Automatic Price Drop Method Moves Excess Inventory Online,” Business Wire, Oct. 25, 1999.
Business Wire business editors/high-tech writers, “PictureWorks Technology, Inc. Expands in Real Estate Market with Adoption of Rimfire on REALTOR.com,” Business Wire, Nov. 8, 1999.
Business Wire business editors/high-tech writers, “PictureWorks Technology, Inc. Shows Strong Revenue Growth in Internet Imaging Business,” Business Wire, Nov. 10, 1999.
Business Wire business editors/high-tech writers, “2Roam Partners with Pumatech to Delivery Wireless Alerts,” Business Wire, Dec. 18, 2000.
Business Wire business editors/high-tech writers, “2Roam Takes eHow's How-to Solutions Wireless: With 2Roam, the Web's One-Stop Source for getting Things Done is on More Wireless Devices, with Ability to Purchase Its Products from Anywhere,” Business Wire, Oct. 2, 2000.
Business Wire business editors/high-tech writers, “2Roam Drives Hertz to the Wireless Web: Number One Car Rental Company to Provide Customers Wireless Access from Any Device,” Business Wire, Aug. 7, 2001.
buy.com, www.buy.com homepage, printed Oct. 13, 2004.
Chen et al., “Detecting Web Page Structure for Adaptive Viewing on Small Form Factor Devices,” ACM, May 20-24, 2003.
Chen, M. (2007). Knowledge assisted data management and retrieval in multimedia database systems (Order No. 3268643).
Clarke, “Research Programme in Supra-organizational Systems,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Clemons et al., “Evaluating the prospects for alternative electronic securities markets,” Proceedings of the twelfth international conference on information systems, New York, New York, United States, pp. 53-64, 1991.
friendster.com, homepage and “more info” pages, printed Apr. 29, 2004.
Google News archive search for “2Roam marketing” performed over the date range 2000-2003.
Google News archive search for “2Roam SMS” performed over the date range 2000-2008.
Grabowski et al., “Mobile-enabled grid middleware and/or grid gateways,” GridLab—A Grid Application Toolkit and Testbed, Work Package 12—Access for Mobile Users, Jun. 3, 2003.
Graham, “The Emergence of Linked Fish Markets in Europe,” Electronic Markets—The International Journal, Jul. 1993, 4 pages, vol. 8, No. 2.
Gunthorpe et al., “Portfolio Composition and the Investment Horizon,” Financial Analysts Journal, Jan.-Feb. 1994, pp. 51-56.
Halperin, “Toward a Process Handbook for Organizational Coordination Processes,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Hess et al., “Computerized Loan Origination Systems: An Industry Case Study of the Electronic Markets Hypothesis,” MIS Quarterly, Sep. 1994, pp. 251-275.
IBM, “Anyonymous Delivery of Goods in Electronic Commerce,” IBM Technical Disclosure Bulletin, Mar. 1996, pp. 363-366, vol. 39, No. 3.
IBM, “Personal Optimized Decision/Transaction Program,” IBM Technical Disclosure Bulletin, Jan. 1995, pp. 83-84, vol. 38, No. 1.
ICROSSING, “ICROSSING Search Synergy: Natural & Paid Search Symbiosis,” Mar. 2007.
IEEE 100—The Authoritative Dictionary of IEEE Standard Terms, Seventh Edition, 2000. Entire book cited; table of contents, source list, and terms beginning with A included. ISBN 0-7381-2601-2.
Ives et al., “Editor's Comments—MISQ Central: Creating a New Intellectual Infrastructure,” MIS Quarterly, Sep. 1994, p. xxxv.
Joshi, “Information visibility and its effect on supply chain dynamics,” Ph.D. dissertation, Massachusetts Institute of Technology, 2000 (fig. 4.5; p. 45).
Klein, “Information Logistics,” Electronic Markets—The International Journal, Oct. 1993, pp. 11-12, vol. 3, No. 3.
Klein, “Introduction to Electronic Auctions,” Electronic Markets—The International Journal, Dec. 1997, 4 pages, vol. 7, No. 4.
Kubicek, “The Organization Gap,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Kuula, “Telematic Services in Finland,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Lalonde, “The EDI World Institute: An International Approach,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Lee et al., “Intelligent Electronic Trading for Commodity Exchanges,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Lee et al., “Electronic Brokerage and Electronic Auction: The Impact of IT on Market Structures,” Proceedings of the 29th Annual Hawaii International Conference on System Sciences, 1996, pp. 397-406.
Lee, “AUCNET: Electronic Intermediary for Used-Car Transactions,” Electronic Market—The International Journal, Dec. 1997, pp. 24-28, vol. 7, No. 4.
LIVE365 press release, “Live365 to Offer Opt-In Advertising on Its Website,” Oct. 15, 2004.
London Business School, “Overture and Google: Internet Pay-Per-Click (PPC) Advertising Options,” Mar. 2003.
M2 Presswire, “Palm, Inc.: Palm unveils new web browser optimised for handhelds; HTML browser offers high-speed web-browsing option,” Mar. 13, 2002.
Malone et al., “Electronic Markets and Electronic Hierarchies,” Communications of the ACM, Jun. 1987, pp. 484-497, vol. 30, No. 6.
Mansell et al., “Electronic Trading Networks: The Route to Competitive Advantage?” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Mardesich, “Onsale takes auction gavel electronic,” Computer Reseller News, Jul. 8, 1996, pp. 2, 32.
Marteau, “Shop with One Click, Anywhere, Anytime,” Information Management and Consulting, 2000, pp. 44-46, vol. 15, No. 4.
Related Publications (1)
Number Date Country
20180253776 A1 Sep 2018 US