Listings optimization using a plurality of data sources

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07617203

ABSTRACT:
A system is provided for allocating combinations of search results, types of space, and/or other information from different sources (e.g., search engines) in which a type of space, search results, and/or other information from at least one source or type or from each source or type, for example, are optimized to obtain an optimum commercial value. Using the example of a search, a commercial metric and a user satisfaction metric are established for search terms and used in the optimization process. In calculating the commercial value and the user satisfaction value for a set of search results, the weight given to the commercial value and the user satisfaction value of a search result is different depending on its source. Optionally, keeping the user satisfaction value above a certain threshold is treated as a constraint while optimizing the commercial value. Alternatively, a tradeoff may be allowed between the minimum threshold for the user satisfaction and a better commercial value. For example, a commercial value may be associated with the commercial metric and quality metric so that the total commercial value may be calculated and optimized.

REFERENCES:
patent: 5724521 (1998-03-01), Dedrick
patent: 5724571 (1998-03-01), Woods
patent: 5752238 (1998-05-01), Dedrick
patent: 5924090 (1999-07-01), Krellenstein
patent: 5991756 (1999-11-01), Wu
patent: 6012053 (2000-01-01), Pant et al.
patent: 6014664 (2000-01-01), Fagin et al.
patent: 6078866 (2000-06-01), Buck et al.
patent: 6128623 (2000-10-01), Mattis et al.
patent: 6128627 (2000-10-01), Mattis et al.
patent: 6209003 (2001-03-01), Mattis et al.
patent: 6269361 (2001-07-01), Davis et al.
patent: 6289358 (2001-09-01), Mattis et al.
patent: 6292880 (2001-09-01), Mattis et al.
patent: 6327590 (2001-12-01), Chidlovskii et al.
patent: 6359633 (2002-03-01), Balasubramaniam et al.
patent: 6360215 (2002-03-01), Judd et al.
patent: 6385602 (2002-05-01), Tso et al.
patent: 6421675 (2002-07-01), Ryan et al.
patent: 6449251 (2002-09-01), Awadallah et al.
patent: 6453315 (2002-09-01), Weissman et al.
patent: 6453319 (2002-09-01), Mattis et al.
patent: 6526440 (2003-02-01), Bharat
patent: 6553364 (2003-04-01), Wu
patent: 6564208 (2003-05-01), Littlefield et al.
patent: 6580786 (2003-06-01), Yarlagadda
patent: 6631372 (2003-10-01), Graham
patent: 6647383 (2003-11-01), August et al.
patent: 6665837 (2003-12-01), Dean et al.
patent: 6675161 (2004-01-01), Suchter
patent: 6691112 (2004-02-01), Siegel et al.
patent: 6701317 (2004-03-01), Wiener et al.
patent: 6704727 (2004-03-01), Kravets
patent: 6711567 (2004-03-01), Littlefield et al.
patent: 6795820 (2004-09-01), Barnett
patent: 6799176 (2004-09-01), Page
patent: 6826572 (2004-11-01), Colace et al.
patent: 6868389 (2005-03-01), Wilkins et al.
patent: 6873982 (2005-03-01), Bates et al.
patent: 6910192 (2005-06-01), McConaghy
patent: 6947930 (2005-09-01), Anick et al.
patent: 6961723 (2005-11-01), Faybishenko et al.
patent: 6973436 (2005-12-01), Shkedi
patent: 7016892 (2006-03-01), Kokkonen et al.
patent: 7058516 (2006-06-01), Mascarenhas
patent: 7155510 (2006-12-01), Kaplan
patent: 7181438 (2007-02-01), Szabo
patent: 7188106 (2007-03-01), Dwork et al.
patent: 7243102 (2007-07-01), Naam et al.
patent: 7251624 (2007-07-01), Lee et al.
patent: 7272612 (2007-09-01), Birdwell et al.
patent: 7302429 (2007-11-01), Wanker
patent: 7428500 (2008-09-01), Linden
patent: 2002/0046002 (2002-04-01), Tang et al.
patent: 2002/0078025 (2002-06-01), Tanaka
patent: 2002/0165860 (2002-11-01), Glover et al.
patent: 2003/0036848 (2003-02-01), Sheha et al.
patent: 2003/0050865 (2003-03-01), Dutta et al.
patent: 1 282 051 (2003-02-01), None
patent: WO 99/41694 (1999-08-01), None
patent: WO 01/46780 (2001-06-01), None
Manmatha, R. and Sever, H. 2002. A Formal Approach to Score Normalization for Meta-search. HLT'02, Mar. 26, 2002, available online at: http://ciir.cs.umass.edu/pubfiles/ir-242.pdf.
Dreilinger, D. and Howe, A. E. 1997. Experiences with selecting search engines using metasearch. ACM Trans. Inf. Syst. 15, 3 (Jul. 1997), 195-222. DOI= http://doi.acm.org/10.1145/256163.256164.
“Topix.net Weblog: The Secret Source of Google's Power” Available online at http://blog.topix.net/archives/000016.html posted Apr. 4, 2004, accessed Feb. 20, 2007.
“Moore's Law—Wikipedia” Available online at http://en.wikipedia.org/wiki/Moore's—law last modified Feb. 19, 2007, accessed Feb. 20, 2007.
Lebanon, G. and Lafferty, J. D. 2002. Cranking: Combining Rankings Using Conditional Probability Models on Permutations. In Proceedings of the Nineteenth international Conference on Machine Learning (Jul. 8-12, 2002). C. Sammut and A. G. Hoffmann, Eds. Morgan Kaufmann Publishers, San Francisco, CA, 363-370.
International Searching Authorioty, Notification of Transmittal of The International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, Nov. 23, 2004, pp. 1-14.
Current Claims of PCT/US2004/022553, pp. 1-7.
PCT International Bureau, “Notification Concerning Transmittal of International Preliminary Report on Patentability (Chapter 1 of the Patent Cooperation Treaty),” PCT/US2004/022553, Dated Feb. 16, 2006, 9 pages.
Google, “Google Search: flowers,” 2004, http://www.google.com/search?hl=en&ie=UTF-8&q=flowers, data retrieved May 17, 2004, pp. 1-2.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Listings optimization using a plurality of data sources does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Listings optimization using a plurality of data sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Listings optimization using a plurality of data sources will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4094340

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.