Method and apparatus to reorder search results in view of identified information of interest

Abstract

Various embodiments described herein provide systems, methods, and software to automatically reorder search results presented to users based on information specific to the user or the computing environment of the user. Some embodiments include a data store holding user or environment specific data that is used to identify search results that are more likely to be relevant to the user. These and other embodiments are described in greater detail herein.

Description

BACKGROUND INFORMATION

Searching for data using online searching tools often yields irrelevant results. Such search results are often irrelevant because searching utilities provide results based on what the public as a whole may be looking for rather than the specific user. Further, a user may not know how to search for the desired information. For example, a user searching for information on setting up a wireless router may not know or have much information about the router being set up. Thus, when such a user submits a query such as “wireless router setup,” the user may receive search results about brand X routers when the user has a brand Y router.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a block diagram of in exemplary networked environment including a host platform according to an example embodiment.

FIG. 2 illustrates a multi-processor host platform system as presented in FIG. 1 in further detail, according to an example embodiment.

FIG. 3 illustrates a logical block diagram of a system according to an example embodiment.

FIG. 4 is a block flow diagram of a method according to an example embodiment.

DETAILED DESCRIPTION

Various embodiments described herein provide systems, methods, and software to automatically reorder search results presented to users based on information specific to the user or the computing environment of the user. Some embodiments include a data store holding user or environment specific data that is used to identify search results that are more likely to be relevant to the user. These and other embodiments are described in greater detail herein.

In the following detailed description, reference is made to the accompanying drawings that form a part hereof, and in which is shown by way of illustration specific embodiments in which the inventive subject matter may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice them, and it is to be understood that other embodiments may be utilized and that structural, logical, and electrical changes may be made without departing from the scope of the inventive subject matter. Such embodiments of the inventive subject matter may be referred to, individually and/or collectively, herein by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any single invention or inventive concept if more than one is in fact disclosed.

The following description is, therefore, not to be taken in a limited sense, and the scope of the inventive subject matter is defined by the appended claims.

The functions or algorithms described herein are implemented in hardware, software or a combination of software and hardware in one embodiment. The software comprises computer executable instructions stored on computer readable media such as memory or other type of storage devices. Further, described functions may correspond to modules, which may be software, hardware, firmware, or any combination thereof. Multiple functions are performed in one or more modules as desired, and the embodiments described are merely examples. The software is executed on a digital signal processor, ASIC, microprocessor, or other type of processor operating on a system, such as a personal computer, server, a router, or other device capable of processing data including network interconnection devices.

Some embodiments implement the functions in two or more specific interconnected hardware modules or devices with related control and data signals communicated between and through the modules, or as portions of an application-specific integrated circuit. Thus, the exemplary process flow is applicable to software, firmware, and hardware implementations.

FIG. 1 illustrates a block diagram of an exemplary networked environment including a host platform according to an example embodiment. Specifically, a host platform 110a, 110b, or 110c is illustrated as being coupled to a variety of different remote home network devices (e.g. 112-165). The host platform 110a, 110b, or 110c receives device specific information 310 from each of the network devices 112-165 connected to the network. In various embodiments, the device specific information may be shared by each of the host platforms and/or network devices within the network. The digital home network 100 may also connect by way of a home network site exit, such as a gateway, router 150 to an Internet Service Provider (ISP) 160. The ISP 160 provides the home network devices with access to the Internet 165, a worldwide, publicly accessible network of interconnected computer networks that transmit data by packet switching using standard communication protocols.

The network connections of the various network capable devices may be direct connections as illustrated by the host platform 110a, media center 112a, personal multimedia device 114a, personal digital assistant 116a, and printer 118a in Room 1 or indirect connections using another network capable device as illustrated in Room 2 by the host platform 110b connecting the personal multimedia device 114b, personal digital assistant 116b, the video camera 117b, the printer 118b, and the camera 119b to the home network 100. The digital home network 100 may include both wired and wireless connections to the different home network devices (110-165) as seen.

For illustrative purpose, home networks 100 may have a number of complex devices (e.g. 112-165) in which problems arise and induce the consumer to seek technical support. For example, home network 100 may contain a media center 112a in which the Compact Disk Player will not stream certain file formats. More specifically, the consumer may attempt to access information regarding this issue via the internet with a query similar to, “what file formats can my CD Player stream?”

In accordance with one embodiment, digital devices or appliances incorporating the processor host platform described in greater detail in FIG. 2 may be configured to perform the task of modifying the consumer query with device specific information 310 previously or presently obtained by the processor host platform. The modified query 302 may then be submitted to the internet or other technical support service. In the above illustration, the query may be expanded to, “what file formats can my Philips MC-i250 CD Player stream?” In various other embodiments, the host platform may be configured to perform a task of modifying a consumer query, an answer to a consumer query, or both.

FIG. 2 illustrates a multi-processor host platform system 200 as presented in FIG. 1 in further detail, according to an example embodiment. The system 200 includes a plurality of processors 210, a mass storage device 220, a network interface 230, memory 240, mid a chipset 250 coupled to each other as shown.

In one embodiment, the network interface 230 may be configured to monitor the network for packets of device information and descriptions of devices within the network, e.g. device specific information. In various embodiments, the network interface may monitor the network for device specific information from a dedicated virtual partition 233 on the host platform. In this manner, the monitoring and obtaining of device specific information may be accomplished with resources not allocated to the main partition, and accordingly, if the main partition 223 is busy or hibernating, the virtual partition 233 is able to continue monitoring for new devices. In the alternative, the network interface may monitor the network for device specific information from a main partition 233 along side other software components 227.

In one embodiment, system memory 240 may store a plurality of programming instructions designed to enable the chipset 250 and tie processors 210 to receive a query pertaining to a query subject and modify the query or an answer to the query based, at least in part, on information related to the query subject. In these and other embodiments, the system memory 240 may store a plurality of programming instructions designed to enable the chipset 250 and processors 210 to receive query results in a first order and reorder the results as a function of a scoring algorithm that takes into account stored data about devices present on the network.

The plurality of processors 210 are the primary resources allocated to the respective partitions and may include any variety of processors known in the art including, in one embodiment, processors having a plurality of processing cores, for example Intel® Pentium® D Processors, Intel® Core™ 2 Extreme, and Intel® Core™ 2 Duo. The processors may be adapted to function within generic computer systems, as well as, Intel® ViiV Embedded Personal Computers (“ViiV EPC”). The plurality of processors 210 may comprise an integrated circuit (“IC”), such as a semiconductor integrated circuit chip. In the embodiment illustrated in FIG. 2, the plurality of processors 210 may include a plurality of central processing units (“CPUs”). Additional or fewer processors may be used in various embodiments. The plurality of processors 210 may be logically and/or physically divided into a plurality of partitions. For example, in the illustrated embodiment, the processors 210 are divided into a main partition 223 and a virtual partition 233.

The at least one primary host processor associated with the main partition 223 is adapted to execute the one or more software components 227 and the operating system 225 which may include, for example, a general operating system such as Windows® operating systems, Linux, etc. The at least one processor associated with virtual partition 233 may be adapted to perform the monitoring and obtaining of device specific information from devices within or added to the network.

System memory 240 may include semiconductor firmware memory, programmable memory, non-volatile memory, read only memory, electrically programmable memory, random access memory, flash memory (which may include, for example, NAND or NOR type memory structures), magnetic disk memory, and/or optical disk memory. Either additionally or alternatively, memory 240 may comprise other and/or later-developed types of computer readable memory. Machines-readable firmware program instructions may be stored in memory 240. As described above, the instructions may be accessed and executed by the main partition 223 and/or the virtual partition 233 of host processor 210.

FIG. 3 illustrates a logical block diagram of a system according to an example embodiment. The system of FIG. 3 provides an example application of query modification based on home network configurations as presented in FIGS. 1 and 2 is illustrated, in accordance with various embodiments. More specifically, FIG. 3 depicts the task related interactions associated with performing a modification of a query based on device specific information 310 received from network devices 300.

In one embodiment, network devices 300 transmit device specific information 310 to a transmit/receive module 320 via a network interface 230. It is contemplated that the transmit/receive module may be implemented in a hardware configuration or a software configuration. In one embodiment, the transmit/receive module 320 may contain a packet monitor 420. The packet monitor 420 may be integrated into a network interface card (not shown), run in a dedicated virtual partition 233 on a computer system, or run in a main partition 223 along side other applications. In various embodiments, the packet monitor 420 extracts or receives device information from a network device 300. In one embodiment, the packet monitor 420 monitors for Universal Plug and Play advertisements and device descriptions and maintains a time ordered log of the device information it receives. This log allows far query modification, as discussed below, when the network device 300 is not present, not powered on, or incapable of transmitting device specific information 230.

In one embodiment, the packet monitor 420 transmits the time ordered log 311, from the transmit/receive module 320, to a configuration extractor 430 located in a processing module 330. The processing module 330 may be implemented in a hardware configuration or a software configuration similar to the transmit/receive module 320. The configuration extractor 430 takes the device specific information 311 and creates word groups that are correlated with each other. In one embodiment, the word groups are stored in a configuration table 312. The configuration table 312 may then be applied, in various embodiments, to a query for the purpose of modification as will be discussed more below.

In various embodiments, a query may be entered by either of a user interface 350 or a generator 351. The user interface may be any one of a keyboard, a mouse, a computer screen, a touch pad, or any other user device capable of submitting a query. The generator 351 may be implemented in a hardware or software configuration.

In one embodiment, the generator 351 automatically generates a query 301 upon an occurrence of a network device being detected or a problem occurring within the network. The query 301 may pertain to common issues regarding the network deice or specific issues relating to the network device or the network in general. Similarly, in other embodiments, the user may generate a query 301 upon an occurrence of a problem with a device or a network.

In various embodiments, the query 301 initiated by the generator 351 or the user interface 350 is received by the transmit/receive module 320 and transmitted to at least one of a configuration based query expander 440 in a processing module 330, or a query processing system 450. In one embodiment, the transmit/receive module 320 sends the query 301, as received, directly to a query processing system 450. The query processing system may be any of an internet search engine, a telephony system, an online chat-room, or any other software or hardware configuration capable of receiving queries. In response to receiving the query 301, the query processing system returns query answers 360. In various embodiments, the configuration extractor 430 may then apply the configuration table 312 to the query answers to perform the post processing function of ranking the answers resulting in ranked answers 361. The ranked answers 361 may provide a fast and viable solution to a user's query or, in one embodiment, provide a list of the most likely causes of a problem or a list of the most common problems associated with a device should the generator 351 initiate the query.

In another embodiment, the query 301 is received by the transmit/receive module 320 and transmitted to a configuration based query expander 440 located in a processing module 330. Once a query 301 is received, the configuration based query expander 440 may apply the configuration table 312 from the configuration extractor 430 in order to concatenate or expand the query 301 with synonymous terms from the table 312. The expansion may include simply adding terms, deleting terms while adding others, or simply concatenating terms. In one embodiment, the configuration based query expander 440 then sends the modified query 302 to a query processing system 450 which returns query answers 360. The process of modifying the query prior to submitting it to a query processing system, or pre-processing, may create a more well-framed query which returns more relevant answers.

In yet another embodiment, preprocessing on a query 301 is performed and returns query answers 360. The query answers nay then undergo a similar post processing procedure to that describe above in which the configuration extractor applies the configuration table 312 to the pre-processed query answers returning ranked answers 361. In such a manner the system may incorporate pre-processing and post processing; only post processing; or only pre-processing. The post processing in such embodiments, may include re-ranking of at least some of the answers, such as Internet search engine query results. Further detail of such embodiments is described in greater detail below.

Although most embodiments described herein pertain to a home network environment and use of the configuration extractor 430 to build a configuration table 312, other embodiments are contemplated. For example, some embodiments may include one or both of pre and post-processing based on virtually any type of information of interest. That information may be represented in a table as words and the table may be used to expand searches or make theme more precise. The information may also be used to re-rank search results.

FIG. 4 is a block flow diagram of a method 400 according to an example embodiment. The example method 400 is a post-processing method of processing search results, such as search results from an Internet search engine or other searching tool. The example method 400 includes storing data of interest on a local computing device 402. The data of interest may be a configuration table as described above. However, the data of interest may include any data that a user or a system may be interested in. This data may be accumulated via a question and answer session, a tool that generates indexes as a function of the contents of files and documents stored on a computing device, or in another manner.

The method 400 further includes receiving query results in a first order in response to a user submitted query 404 and scoring each of at least a subset of the query results as a function of the data of interest 406. Based on the scoring, the method 400 also includes reordering the query results into a second order as a function of the scoring 408. The result is search results that are received based on a specific query, but are sorted based on information of interest to the query submitter.

In some embodiments, the scoring may include retrieving at least a subset of web pages represented in Internet search engine query results and identifying and counting unique features represented in the data of interest that occur in each of the retrieved web pages. The scoring may also include counting occurrences of each unique feature in each of the retrieved web pages scoring each of at least the subset of the query results as a function of a website from which the respective webpage is retrieved. The score may include one or more of these, and other, scoring mechanisms which may be considered individually or in sum.

Scoring each of at least the subset of the query results based on data of interest may also include scoring each of a plurality of features of a retrieved web page, weighting at least one feature, and summing each of the features, including weighted features, to determine a score for each retrieved webpage.

The re-ranking, or reordering, of search results may be considered in a more formal manner in view of contextual ranking. For a given user's query q_k with the corresponding context C_k (output of the configuration extractor), for each of the first P web pages p_jk returned by the search engine, its new rain DR (p_jk) (as for Device Rank) may be calculated as follows.

First, for each page p_jk a set of features f_ijk is extracted, such as, for example:

$f_{1\mathrm{jk}}=\sum _{c_k}C\left(c_k,p_{\mathrm{jk}}\right)$ where c_k are all the words in the context C_k and C(c_k, p_jk) is the count of all instances of c_k in p_jk (i.e. f_1jk is proportional to the total number of context words in p_jk), or:

$f_{2\mathrm{jk}}=\sum _{c_k}{C}^{\prime }\left(c_k,p_{\mathrm{jk}}\right)$ where C′ is 1 if c_k is in p_jk, 0 otherwise (i.e. f_2jk is proportional to the number of unique context words in p_jk). Another feature would indicate if the context words appear in the URL of p_jkor in its title. These features allows incorporation of contextual information. Any number of other types of information and constraints may be included through the features f_ijk. For example, A feature that would allow promoting of “high quality,” domain specific Web sites may be included, as for example:

$f_{3\mathrm{jk}}=\{\begin{array}{cc}1& \mathrm{if}{p}_{\mathrm{jk}}\in D\\ 0& \mathrm{otherwise}\end{array}$ where D is the set of all domain specific sites identified to contain important or noteworthy information.

A linear combination of these features f_ijk may then be calculated:

$S\left(p_{\mathrm{jk}}\right)=\sum _{i=1}^N{w}_i*f_{\mathrm{ijk}}$

Intuitively, one can see that the higher the value of this sum the more relevant is the page p_jk to the query and context, this sum is thus an example of a “score” for page p_jk. The parameters w_i are the weights assigned to each feature.

However, the original rank of the search engine may be used, SER(p_jk) in some embodiments. The original rank may be added to the score S(p_jk) as an additional feature multiplied by a factor w₀ which determines how much weight to give to the original search engine used. In such embodiments, the final score may be represented as:

$\mathrm{DRS}\left(p_{\mathrm{jk}}|q_k,C_K\right)=w_0*g\left(\mathrm{SER}\left(p_{\mathrm{jk}}\right)\right)+\sum _{i=1}^N{w}_i*f_{\mathrm{ijk}}$ where SER(p_jk) is the search engine rank for the query q_k which is just the position of the web page p_jk in the returned list (rank=1 being the rank of first page returned).

Given these scores DRS(p_jk), the web pages p_jk may be ranked by obtaining the Device Rank DR(p_jk), (rank=1 being the rank of the page with the highest score and so on). The ranked pages may then be presented via a web browsing application accordingly to DR(p_jk). In some embodiments, a “better” ranking DR(p_jk) may be made by learning the parameters W=(w₀, w₁, . . . , w_N) via a machine learning technique, such as logistic regression, or a variant thereof (as opposed to just setting them manually). The learning would find the optimal set of weights.

It is emphasized that the Abstract is provided to comply with 37 C.F.R. §1.72(b) requiring an Abstract that will allow the reader to quickly ascertain the nature and gist of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

In the foregoing Detailed Description, various features are grouped together in a single embodiment to streamline the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments of the inventive subject matter require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus, the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment.

It will be readily understood to those skilled in the art that various other changes in the details, material, and arrangements of the parts and method stages which have been described and illustrated in order to explain the nature of the inventive subject matter may be made without departing from the principles and scope of the inventive subject matter as expressed in the subjoined claims.

Claims

1. A method comprising: obtaining data of interest on a local computing device, the data of interest consisting essentially of device specific information and device descriptions of network devices connected to a local network to which the local computing device is also connected;receiving a query with regard to one of the network device connected to the local network;modifying the query based on the data of interest and submitting the query to at least one query processor;receiving query results in a first order in response to a submitted query pertaining to one of the network devices;scoring each of at least a subset of the query results as a function of the data of interest;reordering the query results into a second order as a function of the scoring; andwherein: the query results includes query results from an Internet search engine; andthe scoring each of at least the subset of the query results as the function of the data of interest includes: obtaining at least a subset of web page data of at least a subset of web pages represented in the Internet search engine query results; andidentifying and counting unique features represented in the data of interest that occur in the obtained data of each of the web pages including counting occurrences of each unique feature in the obtained data of each of the web pages.

2. The method of claim 1, wherein the data of interest is obtained from a data store holding the data of interest.

3. The method of claim 1, wherein the scoring further includes scoring each of at least the subset of the query results as a function of a website from which the a respective webpage is retrievable.

4. The method of claim 1, wherein the scoring each of at least the subset of the query results as a the function of the data of interest further includes: scoring each of a plurality of features in the web page data;weighting at least one feature; andsumming each of the features, including weighted features, to determine a score for each webpage.

5. The method of claim 1, further comprising: deriving a value for each search result from a position of the respective search result in the first order; andadding to a result of the scoring of each query result to the derived value of the respective search result.

6. The method of claim 5, further comprising: weighting one or more of the score of each search result and the value derived from a position of each search result in the first order.

7. The method of claim 1, wherein the submitted query is a query automatically generated by a query generator of the local computing device.

8. The method of claim 1, wherein the query, prior to submission by the local computing device, is modified.

9. A non-transitory machine-readable storage medium, with instructions thereon, which when executed cause a suitably configured machine to perform the method of claim 1.