HK1153013A - System, method, and/or apparatus for reordering search results - Google Patents

Description

System, method and/or device for reordering search results

RELATED APPLICATIONS

This is a PCT application claiming priority from U.S. non-provisional application No. 12/047,069 filed on 12.3.2008, which is hereby incorporated by reference in its entirety.

Technical Field

Embodiments of the invention relate to the field of search engines and, more particularly, to modifying search results.

Background

In view of the large amount of content and/or information available on the internet, it would be beneficial to have a way to organize and/or search for one or more areas of interest. For example, a user may identify potentially relevant content using one or more internet search engines, e.g., by searching based on one or more keywords related to a domain of interest. The results from one or more search engines may be organized according to one or more formulas based on the determined relevance of the particular page to the one or more keywords. As another example, a user may bookmark one or more locations of information and/or content that they would like to browse again at a later time. Bookmarks may be organized into one or more folders, e.g., into a directory structure. However, given the large amount of content and/or information available, new solutions for organization and searching may be beneficial.

Drawings

The subject matter is particularly pointed out and distinctly claimed in the concluding portion of the specification. The claimed subject matter, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings in which:

FIG. 1 is a schematic diagram of an embodiment of one or more computing platforms in communication with one or more servers, for example;

FIG. 2 is a flow diagram of an embodiment of a method, for example, for reordering one or more search results;

FIG. 3 is a flow diagram of an embodiment of a second method, for example, for reordering one or more search results;

FIGS. 4A and 4B are diagrams of interfaces for indicating one or more user preferences and displaying one or more reordered search results to a user.

FIGS. 5A and 5B are diagrams of an interface for displaying one or more reordered search results to a user.

Detailed Description

In the following detailed description, numerous specific details are set forth to provide a thorough understanding of claimed subject matter. However, it will be understood by those skilled in the art that claimed subject matter may be practiced without these specific details. In other instances, methods, procedures, and/or components that would be known by one of ordinary skill have not been described in detail so as not to obscure claimed subject matter.

Reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of claimed subject matter. Thus, the appearances of the phrases "in one embodiment" and/or "an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, and/or characteristics may be combined in one or more embodiments.

By using the internet, users can access a large amount of information about various topics. However, in some situations, it may be difficult for users to locate information that is of interest to them. To address this problem, a mechanism called a "search engine" may be employed to index a large number of web pages and provide an interface for searching the indexed information, for example, by entering keywords or phrases.

The search engine may include or otherwise employ, for example, a "crawler" (also known as a "spider" or "robot") that may "crawl" the internet in some manner to locate web documents. After finding the location of a web document, the crawler may store the URL of the document and possibly follow any hyperlinks associated with the web document to find the location of other web documents.

The search engine may include, for example, an information extraction and/or indexing mechanism adapted to extract and/or otherwise index certain information about web documents located by crawlers. Such index information may be generated, for example, based on the content of an HTML file associated with the web document. The indexing mechanism may store the index information in a database. The search engine may provide search tools that allow the user to search the database. The search tools may include a user interface that allows a user to enter or otherwise specify search terms (e.g., keywords) and receive and/or browse search results. The search engine may present the search results in a particular order, for example, according to a ranking scheme and/or ranking process.

In some cases, the user may want to provide input related to the search results. For example, a user may provide an indication that a particular search result is not relevant to the search query that they initiated. As another example, the user may provide an indication that another search result is more relevant to such a search query. Additionally, it may be desirable to store and/or associate those user preferences with particular users so that future search results may be modified in view of preferences provided by particular users. For example, it may be desirable to re-order search results associated with one or more keywords of a particular user such that positively or positively ranked (e.g., more relevant or useful) results are displayed more prominently, while negatively ranked (e.g., less relevant or less useful) results are displayed less prominently or are removed from the search results displayed to the user. It may also be desirable to provide the user with one or more indications that the search results associated with one or more keywords displayed to the user have been reordered. However, it should be noted that these are merely illustrative examples relating to reordering search results and claimed subject matter is not limited in this respect.

FIG. 1 is a schematic diagram of an embodiment 100 that includes one or more computing platforms, such as computing platforms 102 and/or 104. In this embodiment, for example, computing platforms 102 and/or 104 may communicate with one or more servers (e.g., servers 106, 108, and/or 110). In a particular embodiment, a user may initiate one or more searches by using an application, such as a web browser, executed by a computing platform, such as computing platform 102 or computing platform 104, to communicate with one or more search engines. In one embodiment, the search engine may comprise, for example, one or more applications and/or databases running on one or more servers, such as servers 106, 108, and/or 110. In this embodiment, server 106 may search, at least in part, one or more databases to generate one or more search results in response to a user search query. The server 106 may also send the one or more search results to the computing platform 102 via a network. As described above, the generated search results may be ranked according to a ranking scheme and/or ranking process. In one embodiment, the ranking scheme may attempt to rank the results, at least in part, such that results that are more likely to be relevant are presented to the user in a more obvious manner than results that are less likely to be relevant. Additionally, the ranking scheme may alter the ranking of particular results over time, for example, in response to one or more changes in the content of one or more web sites listed in the results and/or changes in the perceived relevance of the content at one or more web sites.

FIG. 2 is a flow diagram of an embodiment 200, the embodiment 200 being, for example, a method or process for reordering one or more search results. For block 202, the search engine may generate a list of one or more search results in response, at least in part, to the search query. For example, a user may enter the search term "black cat" (black cat) in a search engine. The search engine may then generate a list of one or more search results corresponding to the search term "black cat". In some cases, the generated list of search results may be sent to a computing platform for display to the user via an application such as a web browser, for example, as shown with respect to FIG. 4A. Alternatively, as discussed more fully below, the generated list of search results may be modified, for example by reordering the generated search results, before being sent for display to the user.

For block 204, the generated search results may be modified or reordered, for example, by one or more of servers 106, 108, and/or 110. In one embodiment, one or more user preferences may have been associated with the search query. For example, one or more user preferences associated with search results and/or search terms may have been previously stored, for example, in one or more tables associated with a search engine and/or at one or more servers (e.g., one or more of servers 106, 108, and/or 110). In one embodiment, for example, one or more user preferences may be associated with one or more search terms and stored in a hash table or other lookup table. For example, the user may have previously provided positive and/or negative feedback to the search engine regarding one or more search results. In one embodiment, the search engine may use the provided feedback to reorder the user's search results for subsequent presentation to the user on the display. For example, in response to receiving a positive or otherwise positively ranked search result, the search engine may reorder the search results such that the positively ranked search result may be more prominently displayed, e.g., at or near the top of the search result list. For another example, in response to receiving a negatively ranked search result, the search engine may reorder the search results such that the negatively ranked search result may be displayed less prominently, e.g., displayed at the bottom of the search result list or may be removed entirely from the search result list.

For block 206, the search engine may provide one or more indications to the user that the search results have been reordered. For example, the search engine may generate one or more graphical elements to associate with each search result that has been reordered in the display. In one embodiment, this may include associating a positive graphical element (e.g., a graphical representation of a push pin) with search results that have been more prominently displayed based on a positive user ranking, as shown in more detail with respect to fig. 4B. In addition, the search engine may associate a negative graphical element (e.g., a graphical representation of scissors) with search results that have been displayed less prominently based on a negative user ranking, as shown in more detail with respect to fig. 5A. Alternatively, the search engine may provide an indication that the results have been reordered and/or scratched from the search results, in some cases, an indication including a clickable URL that allows the user to see the generated search results without reordering, such as shown with respect to FIG. 5B.

FIG. 3 is a flow diagram of an embodiment 300, such as another method or process for reordering one or more search results. For block 302, the search engine may receive one or more user inputs related to one or more search results. For example, in response to a user input of a search query, such as "black cat," a search engine may generate a list of one or more search results and send the generated list to a computing platform, such as computing platforms 102 and/or 104, for display to the user. In one embodiment, the search engine may provide one or more user-selectable elements along with the generated search results. In at least one embodiment, the user-selectable elements may include one or more user-clickable buttons that, in some cases, may enable the search engine to receive input from the user regarding the generated search results. For example, the search engine may provide positive and/or negative user clickable elements associated with each search result displayed to the user. In one embodiment, if the user clicks on one of the user clickable elements, the user preferences and/or input may be sent to and/or received by a search engine.

With respect to block 304, the search engine may associate the received input with one or more of the user providing the input and/or the search term from the search query. For example, the search engine may store received user input into one or more tables, such as a hash table or other data table, and associate the stored input at least partially with the user and/or the search query, such that the stored input may be used in connection with one or more future search queries. In one embodiment, for example, the search engine may search one or more forms for stored user input prior to providing future search results to a particular user (e.g., registered and/or registered user). In at least one embodiment, the search engine may look up the user and/or search query to determine, at least in part, stored user preferences to determine whether one or more subsequent search results should be modified.

For block 306, the search engine may reorder the results of one or more subsequent searches based at least in part on the received user input. For example, if the user has previously provided input regarding search results associated with the search query "black cat," the search engine may modify subsequent search results for the query for the user, e.g., by displaying the positively ranked search results more prominently and the less prominently negatively ranked search results. In this manner, a user may be able to more quickly reach search results that the user finds particularly relevant to one or more search terms. In one embodiment, reordering may include placing a positively ranked search result at or near the beginning of a displayed search result while removing or de-emphasizing a negatively ranked search result.

With respect to block 308, the search engine may also provide one or more indications of the re-ordered search results to the user. For example, the search engine may associate one or more graphical elements with any re-ordered search results on the display. In one embodiment, for example, on the display, a positive graphical element (e.g., a needle) may be associated with a positively ranked search result, and a negative graphical element (e.g., a scissors) may be associated with a negatively ranked search result. As another example, negatively ranked search results may be removed from the displayed search results. In this example, the search engine may provide an indication to the user that the positively ranked results have been removed, for example a clickable link that may enable the user to request that the search engine display the negatively ranked results. In this manner, the user may browse search results that were previously negatively ranked, or, in some cases, the user may cancel a previous negative ranking.

In the specifically illustrated implementation, in fig. 4A, 4B, 5A, and 5B, the search engine interface may be displayed to the user in a browser and may receive input from the user through a Graphical User Interface (GUI). For example, a user may access a search engine using a web browser executing on a computing platform capable of communicating with a network, as described above with respect to FIG. 1. The Web browser may enable a user to input one or more queries to a search engine and/or provide other feedback via the GUI. For example, the GUI may enable the user to initiate one or more searches based on one or more search queries. Also, in some cases, the GUI may enable the user to provide feedback regarding one or more displayed search results.

FIG. 4A is a diagram of a search engine interface 400 for indicating one or more user preferences. With respect to fig. 4A, a user may, for example, enter a search query, such as one or more search terms, in block 402. In response to a user submitting a search query, a search engine may generate one or more search results. In one embodiment, the search results may be displayed to the user as a list, with individual search results in that list being placed based at least in part on one or more ranking algorithms and/or ranking processes associated with the search engine. For example, the ranking process may attempt to display more likely relevant results to the user before less likely relevant results at least in part by placing the more likely results at or near the top of the search result list. In some cases, the search engine may provide an interface for the user to provide feedback regarding the displayed results. In this embodiment, the interface may include one or more user-selectable graphical elements, such as one or more URLs, Java elements, or the like displayed in a GUI that may receive user input from an input device (e.g., a mouse or other pointing device) associated with the computing platform. For example, a push pin icon (e.g., push pin icon 404) may represent a positive ranking, while a scissors icon (e.g., scissors icon 406) may represent a negative ranking. In this example, the user may click on one of the push-pin icons to indicate that adjacent search results have a particular degree of relevance to the user. Likewise, the user may click on one of the scissors icons to indicate that adjacent search results are not particularly relevant to the user. Any user feedback provided through the user-selectable graphical elements may be sent to the search engine using one or more network protocols. The search engine, in turn, may associate the user feedback with the user and/or any search terms from the search query, such as by storing the information in one or more tables, for example.

FIG. 4B is a diagram of a search engine interface 450 for displaying one or more reordered search results to a user. With respect to fig. 4B, the search engine may reorder the search results based at least in part on previously received user input. For example, if the user again enters the search query "black cat," the search engine may look up, at least in part, the user and/or the search terms to determine whether one or more user preferences have been stored in association with the entered search query. For example, if a user has verified their identity to a search engine, e.g., by logging into a web site associated with the search engine, the search engine can determine stored user preferences associated with the user and/or search query. In this example, the user may have previously provided a positive ranking of the search results 452. The search engine can determine one or more user-provided preferences based on the user's identity and/or search terms, and can reorder the search results such that results 452 are displayed more prominently than other search results. In one embodiment, the search engine may also provide an indication to the user that the search results have been reordered. Here in this example, the indication that the search results have been reordered may include a graphical indication, such as a push pin 454, which may be shown as graphically "pinning" the search results 452.

FIG. 5A is a diagram of an interface 500 for displaying one or more re-ordered search results to a user. With respect to fig. 5A, the search engine may reorder the search results based at least in part on previously received user input. For example, if the user again enters the search query "blackcat," the search engine looks up, at least in part, the user and/or the search terms to determine whether one or more user preferences have been stored in association with the entered search query. For example, if a user has verified their identity to a search engine, e.g., by logging into a web site associated with the search engine, the search engine can determine stored user preferences associated with the user and/or search query. In this example, the user may have previously provided a negative ranking of one or more search results (e.g., search results 502, 504, and/or 506). The search engine can determine one or more user-provided preferences based on the identity of the user and/or the search terms, and can reorder the search results such that results 502, 504, and/or 506 are displayed less prominently than other search results. In one embodiment, the search engine may also provide an indication to the user that the search results have been reordered. Here, in this example, the indication that the search results have been reordered may include a graphical indication, such as scissors 510, which may be shown as graphically "scratching out" the search results 502. In addition, the search engine may depict the results 502 as having been scratched out by displaying the text associated with the search results 502 in a strikethrough format. In some cases, the search engine may also provide the user with additional options regarding modifying the display of the reordered search results. For example, the user may click on link 512 to hide the scratched-out results from view so that search results that receive negative feedback are not displayed in response to a search query.

FIG. 5B is a diagram of an interface 550 for displaying one or more re-ordered search results to a user. With respect to fig. 5B, the search engine may reorder the search results based at least in part on previously received user input. For example, if the user again enters the search query "black cat," the search engine may look up, at least in part, the user and/or the search terms to determine whether one or more user preferences have been stored in association with the entered search query. For example, if a user has verified their identity to a search engine, e.g., by logging into a web site associated with the search engine, the search engine can determine stored user preferences associated with the user and/or search query. In this example, the user may have previously provided a negative ranking of one or more search results (shown above with respect to fig. 5A). The search engine can determine one or more user-provided preferences based on the identity of the user and/or the search terms, and can reorder the search results such that negatively ranked search results are displayed less prominently than other search results. In this example, the negatively ranked search results are not shown in the list of search results. In one embodiment, the search engine may also provide an indication to the user that the search results have been reordered. Here, in this example, the search engine provides an indication 552 to the user that the search results have been previously scratched out, and provides a selectable option 554 to show the previously scratched out results to the user. In this way, the user may use the option if the user wants to see the results that were previously scratched out. Additionally, in some situations, a user may want to alter preferences associated with one or more search results. For example, the user may wish to remove and/or switch a negative ranking to a positive ranking, or vice versa. By allowing the user to access the previous ranking, the search engine allows the user to change their preferences over time while still reordering subsequent search results based on the previously received user ranking.

In the preceding description, various aspects of claimed subject matter have been described. For purposes of explanation, specific components, systems and/or configurations were set forth in order to provide a thorough understanding of claimed subject matter. It should be noted, however, that while various embodiments have been described with respect to the above examples, the above examples are merely illustrative examples relating to search results and claimed subject matter is not limited in these respects. However, it will be apparent to one skilled in the art having the benefit of the present disclosure that claimed subject matter may be practiced without the specific details. In other instances, features that would be understood by one of ordinary skill in the art are omitted and/or simplified in order not to obscure claimed subject matter. While certain features have been illustrated and/or described herein, many modifications, substitutions, changes, and/or equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and/or changes as fall within the true spirit of claimed subject matter.

Claims (26)

1. A method, comprising:

generating search results based on the received search query; and

the generated search results are reordered based at least in part on one or more user inputs provided in relation to one or more prior search results, the user inputs having been previously associated with the user and/or the search query in a storage coupled to a computing platform.

2. The method of claim 1, wherein the one or more user inputs comprise a positive ranking or a negative ranking.

3. The method of claim 1, wherein the reordering comprises prioritizing one or more search results.

4. The method of claim 3, wherein the reordering comprises removing one or more search results.

5. The method of claim 4, further comprising: providing one or more indications of the reordering to the user.

6. The method of claim 4, wherein prioritizing one or more search results comprises moving the one or more results to at or near the beginning of the search results.

7. A method, comprising:

receiving input from a user relating to one or more search results;

associating, in a storage device coupled to a computing platform, the user input with the user and/or a search query; and

results of one or more subsequent searches are reordered based at least in part on the received input.

8. The method of claim 7, wherein the one or more subsequent searches are initiated in association with the user.

9. The method of claim 7, wherein the received input comprises a positive ranking and/or a negative ranking.

10. The method of claim 7, wherein the reordering comprises prioritizing one or more results from the one or more subsequent searches.

11. The method of claim 10, wherein the reordering comprises removing one or more results from the one or more subsequent searches.

12. The method of claim 11, and further comprising providing one or more indications of the reordering with results of the one or more subsequent searches.

13. The method of claim 11, wherein prioritizing one or more search results comprises moving the one or more results to at or near the beginning of the search results.

14. A system, comprising:

one or more computing platforms operable to generate search results based on a search query, the one or more computing platforms further operable to reorder the generated search results based at least in part on one or more user inputs provided in relation to one or more prior search results, the user inputs having been previously associated with the user and/or the search query.

15. The system of claim 14, wherein the one or more user inputs comprise a positive ranking or a negative ranking.

16. The system of claim 14, wherein the one or more computing platforms are operable to reorder the generated search results at least in part by prioritizing one or more search results.

17. The system of claim 16, wherein the one or more computing platforms are operable to reorder the generated search results at least in part by removing one or more search results.

18. The system of claim 17, wherein the one or more servers are further operable to provide one or more indications to the user that the search results are reordered.

19. The system of claim 18, wherein the one or more servers are further operable to prioritize at least in part by moving the one or more results to at or near the beginning of the search results.

20. An article of manufacture, comprising: a storage medium storing instructions that, if executed by a computing platform, are adapted to cause the computing platform to:

receiving input from a user relating to one or more search results;

associating the user input with the user and/or search query; and

results of one or more subsequent searches are reordered based at least in part on the received input.

21. The article of manufacture of claim 20, wherein the one or more subsequent searches are initiated in association with the user.

22. The article of claim 20, wherein the received input comprises a positive ranking and/or a negative ranking.

23. The article of claim 20, wherein said instructions, if executed by a computing platform, are further adapted to enable said computing platform to prioritize one or more results from said one or more subsequent searches.

24. The article of claim 23, wherein said instructions, if executed by a computing platform, are further adapted to enable said computing platform to remove one or more results from said one or more subsequent searches.

25. The article of claim 24, wherein said instructions, if executed by a computing platform, are further adapted to enable said computing platform to provide one or more indications, along with results of said one or more subsequent searches, that said results have been reordered.

26. The article of claim 24, wherein said instructions, if executed by a computing platform, are further adapted to enable said computing platform to move said one or more results to at or near the beginning of said search results.