Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2004-08-16
2009-02-17
Alam, Hosain T (Department: 2166)
Data processing: database and file management or data structures
Database design
Data structure types
C706S029000, C707S793000
Reexamination Certificate
active
07493320
ABSTRACT:
A method, device, and computer program product for ranking documents using link analysis, with remedies for sinks, including forming a metagraph from an original graph containing a link and a node; and one of reversing a link in the metagraph, and pumping a source in the metagraph.
REFERENCES:
patent: 5889999 (1999-03-01), Breternitz et al.
patent: 6112202 (2000-08-01), Kleinberg
patent: 6112203 (2000-08-01), Bharat et al.
patent: 6182065 (2001-01-01), Yeomans
patent: 6285999 (2001-09-01), Page
patent: 6321220 (2001-11-01), Dean et al.
patent: 6353825 (2002-03-01), Ponte
patent: 6356899 (2002-03-01), Chakrabarti et al.
patent: 6457028 (2002-09-01), Pitkow et al.
patent: 6526440 (2003-02-01), Bharat
patent: 6560600 (2003-05-01), Broder
patent: 6591261 (2003-07-01), Arthurs
patent: 6665665 (2003-12-01), Ponte
patent: 6701312 (2004-03-01), Lau et al.
patent: 6799176 (2004-09-01), Page
patent: 6922696 (2005-07-01), Lincoln et al.
patent: 6993475 (2006-01-01), McConnell et al.
patent: 6999963 (2006-02-01), McConnell
patent: 7058628 (2006-06-01), Page
patent: 7178112 (2007-02-01), Ciolfi et al.
patent: 7188106 (2007-03-01), Dwork et al.
patent: 7231399 (2007-06-01), Bem et al.
patent: 7281005 (2007-10-01), Canright et al.
patent: 2002/0038350 (2002-03-01), Lambert et al.
patent: 2002/0129014 (2002-09-01), Kim et al.
patent: 2002/0198869 (2002-12-01), Barnett
patent: 2003/0003707 (2003-01-01), Yamaha
patent: 2003/0037074 (2003-02-01), Dwork et al.
patent: 2003/0041041 (2003-02-01), Cristianini
patent: 2004/0006742 (2004-01-01), Slocombe
patent: 2005/0060297 (2005-03-01), Najork
patent: 2005/0086260 (2005-04-01), Canright et al.
patent: 2005/0171946 (2005-08-01), Maim
patent: 2005/0256887 (2005-11-01), Eiron et al.
patent: 2006/0059113 (2006-03-01), Kuznar et al.
patent: 2001-319129 (2001-11-01), None
patent: WO 01/84351 (2001-11-01), None
patent: WO 03/098370 (2003-11-01), None
Harary, Graph Theory, Dec. 1969, Addison-Wesley Publishing Co., P. V, 150-151, 198-211, 213, 226-227.
Cormen et al., Introduction to Algorithms, Dec. 2001, MIT Press, 2nd Ed., p. 520-522, 526, 528-531, 552-559, 581, 644-648.
xreferplus.com, definitions and contexts of “pumping source”, Retrieved Jan. 30, 2006, p. 1-6.
Oxford English Dictionary, Definition of “pumping”, Dec. 1989, 2nd ed., p. 1-3.
Kleinberg, “Authoritative Sources in a Hyperlinked Environment”, Sep. 5, 1999, Journal of the ACM, p. 604-632.
Kao et al., “Simple and Efficient Graph Compression Schems for Desnse and Complement Graphs”, Journal of Combinatorial Optimization, Dec. 1998, Springer-Verlag, vol. 2, No. 4,p. 451-459.
Ding et al., “PageRank, HITS and a Unified Framework for Link Analysis”, Sep. 2002, LBNL Tech Report 49372, p. 1-12.
Forman, “A Pitfall and Solution in Multi-Class Feature Selection for Text Classification”, Jul. 4, 2004, 21st International Conference on Machine Learning, p. 1-9.
Eiron et al., “Ranking the Web Frontier”, May 17, 2004, WWWW2004, ACM Press, p. 309-318.
Yuwono, et al., “Searching and Ranking Algorithms for Locating Resources on the World Wide Web”, IEEE, p. 164-171.
Ravi Kumar, Prabhakar Reghavan and Sridhar Rajagopalan and Andrew Tomkins (2002), The Web and Social Networks, pp. 32-36.
R. Lempel et al., “The Stochastic Approach for Link-Structure Analysis (SALSA) and The TKC Effect”; Jul. 21, 2003; p. 1-23.
Kazunari Sugiyama, Kenji Hatano, Masatoshi Yoshikawa and Shunsuke Uemura (2003), Refinement of TF-IDF Schemes for Web Pages using their Hyperlinked Neighboring Pages, pp. 198-207.
R. Lempel and S. Moran (2001), Salsa: The Stochastic Approach for Link-Structure Analysis, pp. 131-160.
Robert Endre Tarjan: Depth-First Search and Linear Graph Algorithms. SIAM J. Comput. 1(2): 146-160 (1972).
Stuart K. Card, et al., “The WebBook and the Web Forager: An Information Workspace for the World-Wide Web”; Xerox Palo Alto Research Center: Apr. 13, 1996; pp. 111-113; CHI '96 Vancoouver; XP 000657809.
Esko Nuutila, et al.; “On Finding the Strongly Connected Components In Directed Graph”; Laboratory of Information Processing Science Helsinki University of Technology, Otakaari 1, SF-02150 Espoo, Finland, pp. 1-14, 1994.
Botafogo et al., “Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics”, ACM Transactions on Information Systems, vol. 10, No. 2, Apr. 1992, pp. 142-180.
Griffith et al., “The Structure of Scientific Literatures II: Toward a macro- and Microstructure for Science”, Science Studies, 4 (1974), pp. 339-365.
Larson, R.R., “Bibliometrics of the World Wide Web: An Exploratory Analysis of the Intellectual Structure of Cyberspace”, Proceedings of the 1996 American Society for Information Science Annual Meeting, pp. 1-13.
Small, H., “Co-citation in the Scientific Literature: A New Measure of the Relationship Between Two Documents”, Journal of the American Society for Information Science, Jul.-Aug. 1973, pp. 265-269.
Warry, EPO Office Action App No. 05784352.6-1225, Apr. 17, 2007.
Feibing, Chinese—Patent—Office, Text of 1st Office Action, App—No—20050028110.8, May 30, 2008.
Canright et al, “Roles in Networks”, Science of Computer Programming, Jul. 17, 2004, Elsevier, p. 195,-214. <Retrieved from www.sciencedirect.com>.
Xiaodi Huang, et al., “Identification of Clusters in the Web Graph Based on Link Topology”, Proceedings of the Seventh International Database Engineering and Application Symposium (IDEAS'03), XP-010647158, Jul. 16, 2003, pp. 117-122.
Ricardo Baeza-Yates, et al., “Relating Web Characteristics with Link Based Web Page Ranking”, String Processing and Information Retrieval, SPIRE 2001, XP-010583172, Nov. 13, 2001, pp. 21-32.
Zheng Chen, et al., “A Unified Framework for Web Link Analysis”, Proceedings of the 3rdInternational Conference on Web Information Systems Engineering (WISE'02), XP-010632781, Dec. 12, 2002, pp. 63-70.
Michelangelo Diligenti, et al., “Web Page Scoring Systems for Horizontal and Vertical Search”, Proceedings of the 11thInternational Conference on World Wide Web—WWW 2002, XP-002353433, May 7, 2002, pp. 508-516.
Brian D. Davison, “Unifying Text and Link Analysis”, Eighteenth International Joint Conference on Artificial Intelligence, ′Online! 2003, XP-002353434, 2003, 3 pages.
Henry Lieberman; “Letizia: An Agent That Assists Web Browsing”; Media Laboratory, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95); 1995; Massachusetts Institute Of Technology.
R. Lempel et al., “The Stochastic Approach for Link-Structure Analysis (SALSA) and The TKC Effect”; Jul. 21, 2003: p. 1-23.
Krishma Bharat, “A Search Engine based on Expert Documents”; Aug. 27, 2003; pp. 1-4.
The PageRank Citation Ranking: Bringing Order to the Web; Jan. 29, 1998; p. 1-17.
Taher H. Haveliwala; “Efficient Computation of PageRank”; Stanford University; Oct. 18, 1999; pp. 1-15.
Esko Nuutila, et al.; “On Finding the Strongly Connected Components in Directed Graph”; Laboratory of Information Processing Science Helsinki University of Technology, Otakaari 1, SF-02150 Espoo, Finland, pp. 1-14.
Soumen Chakrabarti et al., “Mining the Link Structure of the World Wide Web”; Feb. 1999; p. 1-12.
Jon M. Kleinberg, “Authoritative Sources in a Hyperlinked Environment”; Journal of the ACM, vol. 46, No. 5; Sep. 1999; p. 604-632.
Chris Ding et al. “PageRank, HITS and a Unified Framework for Link Analysis”, The Twenty-Fifth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval; Aug. 11-15, 2002, p. 353-354.
Sergey Brin, Lawrence Page, “The anatomy of a large-scale hypertextual Web search engine”, Computer Networks and ISDN Systems 30; 1998; pp. 107-117.
Allan Borodin et al.
Burgess Mark
Canright Geoffrey
Engø-Monsen Kenth
Alam Hosain T
Oblon & Spivak, McClelland, Maier & Neustadt P.C.
Telenor ASA
Wong Joseph D
LandOfFree
Method, system, and computer program product for ranking of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method, system, and computer program product for ranking of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method, system, and computer program product for ranking of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4084107