Data processing: database and file management or data structures – Database and file access – Post processing of search results
Reexamination Certificate
2011-04-05
2011-04-05
Vo, Tim T. (Department: 2168)
Data processing: database and file management or data structures
Database and file access
Post processing of search results
C707S731000
Reexamination Certificate
active
07921106
ABSTRACT:
Search results are ranked by applying sub-relevancies within a search result list. This permits search result lists to be further refined into more manageable relevant groupings from a user's perspective. The sub-relevancies or ‘group-by’ parameters are derived from search result attributes. Attribute values from the attributes are employed in a ranking scheme to group the search results based on attribute value relevancy. The grouped search results can then be displayed to users via a search result page. In one instance users can select which attribute value is used to group the search result list. Ranking processes are based on object ranking algorithms that consider each attribute value as an object type. Some instances provide for search result list group condensing based on relevancy of the attribute values as well. A top-k instance can be employed to limit the search results to control the amount of time required for processing groupings.
REFERENCES:
patent: 5999664 (1999-12-01), Mahoney et al.
patent: 6047284 (2000-04-01), Owens et al.
patent: 6304864 (2001-10-01), Liddy et al.
patent: 6353825 (2002-03-01), Ponte
patent: 6385602 (2002-05-01), Tso et al.
patent: 6418434 (2002-07-01), Johnson et al.
patent: 6418448 (2002-07-01), Sarkar
patent: 6460036 (2002-10-01), Herz
patent: 6519585 (2003-02-01), Kohli
patent: 6601075 (2003-07-01), Huang et al.
patent: 6631369 (2003-10-01), Meyerzon et al.
patent: 6636853 (2003-10-01), Stephens, Jr.
patent: 6665665 (2003-12-01), Ponte
patent: 6813616 (2004-11-01), Simpson et al.
patent: 6847977 (2005-01-01), Abajian
patent: 6907424 (2005-06-01), Neal et al.
patent: 6931595 (2005-08-01), Pan et al.
patent: 6944612 (2005-09-01), Roustant et al.
patent: 6996778 (2006-02-01), Rajarajan et al.
patent: 7058913 (2006-06-01), Siegel et al.
patent: 7062488 (2006-06-01), Reisman
patent: 7231395 (2007-06-01), Fain et al.
patent: 7346621 (2008-03-01), Zhang et al.
patent: 7383254 (2008-06-01), Wen et al.
patent: 7720830 (2010-05-01), Wen et al.
patent: 2002/0174089 (2002-11-01), Tenorio
patent: 2002/0198875 (2002-12-01), Masters
patent: 2003/0093423 (2003-05-01), Larason et al.
patent: 2003/0115193 (2003-06-01), Okamoto et al.
patent: 2003/0177118 (2003-09-01), Moon et al.
patent: 2003/0212663 (2003-11-01), Leno
patent: 2004/0034652 (2004-02-01), Hofmann et al.
patent: 2004/0181749 (2004-09-01), Chellapilla et al.
patent: 2004/0194141 (2004-09-01), Sanders
patent: 2004/0199497 (2004-10-01), Timmons
patent: 2005/0108200 (2005-05-01), Meik et al.
patent: 2005/0144158 (2005-06-01), Capper et al.
patent: 2005/0171946 (2005-08-01), Maim
patent: 2005/0192955 (2005-09-01), Farrell
patent: 2006/0026152 (2006-02-01), Zeng et al.
patent: 2006/0031211 (2006-02-01), Mizuno
patent: 2006/0031214 (2006-02-01), Solaro et al.
patent: 2006/0036567 (2006-02-01), Tan
patent: 2006/0074881 (2006-04-01), Vembu et al.
patent: 2006/0080353 (2006-04-01), Miloushev et al.
patent: 2006/0098871 (2006-05-01), Szummer
patent: 2006/0101060 (2006-05-01), Li et al.
patent: 2006/0167928 (2006-07-01), Chakraborty et al.
patent: 2006/0253437 (2006-11-01), Fain et al.
patent: 2007/0033171 (2007-02-01), Trowbridge
patent: 2007/0150486 (2007-06-01), Wen et al.
patent: 2008/0027910 (2008-01-01), Wen et al.
patent: 1158422 (2001-11-01), None
patent: 0057311 (2000-09-01), None
patent: 0073942 (2000-12-01), None
Authoritative Dictionary of IEEE Standards Terms, Seventh Edition, IEEE Press, 2000.
Carrot Search “Lingo”: Get Your Search Organised Downloaded from http://www.carrot-search.com/resources/lingo-datasheet.pdf.
The Search Appliance + Grokker : Add value to enterprise search application Downloaded from http://www.groxis.com/service/grokker/search—solutions.html.
Hua-Jun Zheng, et al., “Learning to Cluster Web Search Results” Downloaded from http://research.microsoft.com/users/hjzeng/p230-zeng.pdf.
Anton V. Leouski, et al., “An Evaluation of Techniques for Clustering Search Results” Downloaded from http://people.ict.usc.edu/˜leuski/publications/papers/ir-76.pdf.
Office Action mailed Aug. 27, 2007 in U.S. Appl. No. 11/106,017, 20 pages.
Office Action mailed Feb. 22, 2008 in U.S. Appl. No. 11/106,017, 26 pages.
Office Action mailed Sep. 22, 2008 in U.S. Appl. No. 11/106,017, 10 pages.
Berger, Adam L., Stephen A. Della Pietra and Vincent J. Della Pietra, “A Maximum Entropy Approach to Natural Language Processing,” Computational Linguistics, vol. 22, No. 1 1996 Association for Computational Linguistics, 36 pages.
Besag, Julian, “Spatial Interaction and the Statistical Analysis of Lattice Systems,” Journal of The Royal Statistical Society, Series B, vol. 36, No. 2, 1974, pp. 192-236.
Bunescu, Razvan C. and Raymond J. Mooney, “Relational Markov Networks for Collective Information Extraction,” Proceedings of the ICML 2004 Workshop on Statistical Relational Learning and Its Connections to Other Fields (SLR-2004), Banff, Canada, Jul. 2004, 7 pages.
Buttler David, Ling Liu and Calton Pu, “A Fully Automated Object Extraction System for The World Wide Web,” Proceedings of IEEE ICDCS-21, 2001, 11 pages.
Cai, Deng, et al., “VIPS: A Vision-Based Page Segmentation Algorithm,” Nov. 1, 2003 Microsoft Technical Report MSR-TR-2003-79, pp. 1-29.
Chang, Chia-Hui and Shao-Chen Lui, “IEPAD: Information Extraction Based on Pattern Discovery,” WWW10, May, Hong Kong, 2001 ACM, pp. 681-688.
Clarke, Charles L.A., “Controlling Overlap in Content-Oriented XML Retrieval,” SIGIR '05, Salvador, Brazil, 2005 ACM, 8 pages.
Collins, Michael, “Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms,” 2002, 8 pages.
Collins, Michael, “Ranking Algorithms for Named-Entity Extraction: Boosting and the Voted Perceptron,” Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, Philadelphia, Jul. 2002, pp. 489-496.
Crescenzi, Valter, Giansalvatore Mecca and Paolo Merialdo, “Roadrunner: Towards Automatic Data Extraction from Large Web Sites,” Proceedings of the 27th VLDB Conference, Italy, 2001, 10 pages.
Embley, D.W., Y.S. Jian and Y. K. Ng, “Record-Boundary Discovery in Web Documents,” In Proceedings of SIGMOD '99, 1999, pp. 1-24.
Fagin, Ronald, et al., “Searching the Workplace Web,” WWW2003, Budapest, Hungary, ACM, 10 pages.
Fine, Shai, Yorma Singer and Naftali Tishby, “The Hierarchical Hidden Markov Model: Analysis and Applications,” Machine Learning, vol. 32, 1988, 1998 Kluwer Academic Publishers, pp. 41-62.
Freitag, Dayne and Andrew Kachites Mccallum, “Information Extraction with HMMs and Shrinkage,” In Proceedings of the AAAI-99 Workshop on Machine Learning for Information Extraction, 1999, 6 pages.
Gravano, Luis and Hector Garcia-Molina, “Generalizing GLOSS to Vector-Space Databases and Broker Hierachies,” Proceedings of the 21st VLDB Conference, Zurich, Switzerland, 1995, 12 pages.
He, Xuming, et al., “Multiscale Conditional Random Fields for Image Labeling,” Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 1-8.
Jensen, F.V., S.L. Lauritzen and K.G. Olesen, “Bayesian Updating in Causal Probabilistic Networks by Local Computations,” Computational Statistics Quarterly 4, 1990, Physica-Verlag, pp. 269-282.
Kamps, Jaap, et al., “Length Normalization in XML Retrieval,” SIGIR '04, Sheffield, South Yorkshire, UK, 2004 ACM, 8 pages.
Kobayashi, Mei and Koichi Takeda, “Information Retrieval on the Web,” ACM Computing Surveys, vol. 32, No. 2, Jun. 2000, pp. 144-173.
Kschischang, Frank R., Brendan, J. Frey and Hans-Andrea Loeliger, “Factor Graphs and the Sum-Product Algorithm,” IEEE Transactions on Information Theory, vol. 47, No. 2, Feb. 2001, 2001 IEEE, pp. 498-519.
Kumar, Sanjiv and Martial Hebert, “Discriminative Fields for Modeling Spatial
Chen Hua
Liu Yue
Ma Wei-Ying
Nie Zaiqing
Wu Qiang
Brook, Hardy & Bacon LLP
Microsoft Corporation
Sanders Aaron
Vo Tim T.
LandOfFree
Group-by attribute value in search results does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Group-by attribute value in search results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Group-by attribute value in search results will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2674358