Search engine system and associated content analysis methods...

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

C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

10909134

ABSTRACT:
A search engine system assists users in locating web pages from which user-specified products can be purchased. Web pages located by a crawler program are scored, based on a set of criteria, according to likelihood of including a product offering. A query server accesses an index of the scored web pages to locate pages that are both responsive to a user's search query and likely to include a product offering. In one embodiment, the responsive web pages are listed on a composite search results page together with products that satisfy the query.

REFERENCES:
patent: 5640553 (1997-06-01), Schultz
patent: 5675819 (1997-10-01), Schuetze
patent: 5848396 (1998-12-01), Gerace
patent: 5895454 (1999-04-01), Harrington
patent: 5913210 (1999-06-01), Call
patent: 5918214 (1999-06-01), Perkowski
patent: 5960429 (1999-09-01), Peercy et al.
patent: 5963915 (1999-10-01), Kirsch
patent: 6006218 (1999-12-01), Breese et al.
patent: 6009459 (1999-12-01), Belfiore et al.
patent: 6014664 (2000-01-01), Fagin et al.
patent: 6064979 (2000-05-01), Perkowski
patent: 6064980 (2000-05-01), Jacobi et al.
patent: 6073135 (2000-06-01), Broder et al.
patent: 6085226 (2000-07-01), Horvitz
patent: 6125395 (2000-09-01), Rosenberg et al.
patent: 6144958 (2000-11-01), Ortega et al.
patent: 6182050 (2001-01-01), Ballard
patent: 6230153 (2001-05-01), Howard et al.
patent: 6233571 (2001-05-01), Egger et al.
patent: 6247130 (2001-06-01), Fritsch
patent: 6266649 (2001-07-01), Linden et al.
patent: 6304864 (2001-10-01), Liddy et al.
patent: 6401118 (2002-06-01), Thomas
patent: 6405175 (2002-06-01), Ng
patent: 6415320 (2002-07-01), Hess et al.
patent: 6418434 (2002-07-01), Johnson et al.
patent: 6421675 (2002-07-01), Ryan et al.
patent: 6460072 (2002-10-01), Arnold et al.
patent: 6484149 (2002-11-01), Jammes et al.
patent: 6523027 (2003-02-01), Underwood
patent: 6535896 (2003-03-01), Britton et al.
patent: 6601233 (2003-07-01), Underwood
patent: 6633878 (2003-10-01), Underwood
patent: 6640238 (2003-10-01), Bowman-Amuah
patent: 6640244 (2003-10-01), Bowman-Amuah
patent: 6640249 (2003-10-01), Bowman-Amuah
patent: 6718535 (2004-04-01), Underwood
patent: 6963871 (2005-11-01), Hermansen et al.
patent: 7133870 (2006-11-01), Tripp et al.
patent: 2002/0161673 (2002-10-01), Lee et al.
patent: 2007/0005567 (2007-01-01), Hermansen et al.
patent: A-53031/98 (1998-08-01), None
patent: 0 827 063 (1998-04-01), None
patent: 0866408 (1998-09-01), None
patent: 2 331 166 (1999-12-01), None
patent: 9819259 (1998-05-01), None
patent: WO 99/45487 (1999-10-01), None
Gloria Yan et al., “Banking on the Internet and its Applications”, IEEE, 1998, pp. 275-284.
Kim, et. al. “Intelligent Information Recommend System on the Internet,” IEEE, 1999, pp. 1-5.
Seki, et. al. “User's behavior and URL analysis at EC sites,” IEEE, Oct. 1999, pp. 87-92.
K. Matsuda and T. Fukushima,“Task-Oriented World Wide Web Retrieval by Document Type Classification,” Proceedings of the Eighth International Conference on Information Knowledge Management, pp. 109-113 (Nov. 1999).
International Search Report for PCT/US00/42645.
E. Voorhees, N. Gupta and B. Johnson-Laird, “Learning Collection Fusion Strategies,” SIGIR'95, ACM 0-89791-714, pp. 172-179, dated Jun. 1995.
B. Bartell, G. Cottrell and R. Belew, “Automatic Combination of Multiple Ranked Retrieval Systems,” Proceedings of the Twelfth International Conference on Machine Learning, pp. 173-181, dated Jul. 9-12, 1995.
G. Towell, E. Voorhees, N. Gupta and Ben Johnson-Laird, “Learning Collection Fusion Strategies for Information Retrieval,” SIGIR'95, Proceedings of the 18thAnnual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 540-548, dated Jul. 1995.
P. Foltz and S. Dumais, “Personalized Information Delivery: An Analysis of Information Filtering Methods,” Communications of the ACM, 35(12), pp. 51-60, dated 1992.
L. Magid, “SwipingShoppers,” UPSIDE today, 2 pages, dated Oct. 21, 1999.
M. Roscheisen, C. Mogensen and T. Winograd, “Beyond browsing: shared comments, SOAPs, trails, and on-line communities,” Computer Networks and ISDN Systems 27, pp. 739-749, dated 1995.
R. Doorenbos, O. Etzioni and D. Weld, “A Scalable Comparison-Shopping Agent for the World-Wide Web,” ACM Press, Proceedings of the First International Conference on Autonomous Agents, pp. 39-48, dated Feb. 5-8, 1997.
A. Wexelblat and P. Maes, “Footprints: History-Rich Tools for Information Foraging,” CHI'99, pp. 270-277, dated May 1999.
P. Lewis, “Searching For Less, Not More,”New York Times, 2 pages, dated Sep. 30, 1999.
P. Maes, R. Guttman and A. Moukas, “Agents that Buy and Sell,” Communications of the ACM, vol. 42, No. 3, pp. 81-91, dated Mar. 1999.
Keller, A.M., “Smart catalogs and virtual catalogs,” Proceedings of the USENIX Workshop of Electronic Commerce, dated Jul. 11, 1995, pp. 125-131, XP002086428.
Schwartz, S., “Ordering it right the first time: The UPC Electronic Catalog and EDI,” EDI Forum, EDI Group, Oak Park, IL, US, vol. 5, No. 4, (1992), pp. 58-62.

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

Search engine system and associated content analysis methods... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Search engine system and associated content analysis methods..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search engine system and associated content analysis methods... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3940854

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