SELECTION OR RELIABLE KEY WORDS FROM UNRELIABLE SOURCES IN A SYSTEM AND METHOD FOR CONDUCTING A SEARCH

• US 20090132236A1
• Filed: 11/16/2007
• Published: 05/21/2009
• Est. Priority Date: 11/16/2007
• Status: Abandoned Application

• Current Assignee: IAC Search & Media Incorporated (IAC/InterActiveCorp)
• Original Assignee: IAC Search & Media Incorporated (IAC/InterActiveCorp)
• Inventors: McKee, Aaron Kameron, Vegnaduzzo, Stefano, Putivsky, Yuri, Kislyuk, Oleg S.
• Application Number:
  US11/941,871
• Publication Number:
  US 20090132236A1
• Time in Patent Office: Days
• US Class Current: 704/9
• CPC Class Codes: G06F 16/9537 Spatial or temporal dependent retrieval, e.g. spatiotemporal queries

Abstract

The invention provides for a system to select data including a reception component that receives at least one data entry from at least one data source, a processor component to determine the entropy of a word extracted from the at least one data entry, a filtering component to select reliable words, wherein reliable words are words with low entropy values, the filtering component further excluding words with high entropy values, and a transmission component to output a set of reliable words, wherein the set of reliable words is associated with the at least one data entry from which the reliable words were extracted.

Claims

1. A system to select data, comprising:

a reception component that receives at least one data entry from at least one data source;

a processor component to determine the entropy of a word extracted from the at least one data entry;

a filtering component to select reliable words, wherein reliable words are words with low entropy values, the filtering component further excludes words with high entropy values; and

a transmission component to output a set of reliable words, wherein the set of reliable words is associated with the at least one data entry from which the reliable words were extracted.

2. The system of claim 1, wherein entropy is defined as:

$\mathrm{Entropy}=\underset{n=1}{\overset{k}{\sum <br><br>}}<br><br><br><br>\mathrm{pn}<br><br><br><br>\log \left(\frac{1}{\mathrm{pn}}\right)$

where

p is probability,

n is category.

3. A method for selecting data, comprising:

receiving at least one data entry from at least one data source;

determining the entropy of a word extracted from the at least one data entry;

selecting reliable words, wherein reliable words are words with low entropy values, and excluding words with high entropy values; and

outputting a set of reliable words, wherein the set of reliable words is associated with the at least one data entry from which the reliable words were extracted.

4. The method of claim 3, wherein entropy is defined as:

$\mathrm{Entropy}=\underset{n=1}{\overset{k}{\sum <br><br>}}<br><br><br><br>\mathrm{pn}<br><br><br><br>\log \left(\frac{1}{\mathrm{pn}}\right)$

where

p is probability,

n is category.

5. A computer-readable medium, having stored thereon a set of instructions which, when executed by at least one processor of at least one computer, executes a method for selecting data comprising:

receiving at least one data entry from at least one data source;

determining the entropy of a word extracted from the at least one data entry;

selecting reliable words, wherein reliable words are words with low entropy values, and excluding words with high entropy values; and

outputting a set of reliable words, wherein the set of reliable words is associated with the at least one data entry from which the reliable words were extracted.

6. The computer-readable medium of claim 5, wherein entropy is defined as:

$\mathrm{Entropy}=\underset{n=1}{\overset{k}{\sum <br><br>}}<br><br><br><br>\mathrm{pn}<br><br><br><br>\log \left(\frac{1}{\mathrm{pn}}\right)$

where

p is probability,

n is category.