Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-04-04
2006-04-04
Ali, Mohammad (Department: 2162)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
07024404
ABSTRACT:
Techniques to assign a ranking value to objects in a database such as a collection of cross referencing documents, the World-Wide Web or a hyperlinked database are described. The ranking value assigned to a given data object represents a cross-cluster strength metric and is a function of the object's importance across all groups or clusters in which the object is classified. The cross-cluster strength metric may be particularly beneficial in enhancing the performance of web-based search engines because it emphasizes the importance of objects that appear in multiple groups while de-emphasizing the importance of objects that, while highly linked within one or a few groups, are relatively unlinked to objects in other groups.
REFERENCES:
patent: 6192401 (2001-02-01), Modiri et al.
patent: 6285999 (2001-09-01), Page
patent: 6334131 (2001-12-01), Chakrabarti et al.
patent: 6684205 (2004-01-01), Modha et al.
patent: 6862586 (2005-03-01), Kreulen et al.
Haveliwala. T.H Topic-sensitive PageRank: a context-sensitive ranking algorithm for web search, Knowledge and Data Engineering, IEEE Transaction, Jul.-Aug., 2003, p. 784-796.
Chirita et al. Finding Related Pages Using the Link Structure of the WWW, Web Intelligent, Sep. 20-24, 2004, p. 631-635.
Greso et al. STED: a system for topic enumeration and distillation, Information Technology: Coding and Computing, Apr. 8-10, 2002, pp. 294-299.
Kerschberg et al. A semantic taxonomy-based personalizable meta-search agent, Web Information System Engineering, Dec. 3-6, 2001.
Soumen Chakrabarti, Intergrating the document object model with hyperlinks for enhanced topic distillation and information extraction, ACM Special Interest Group on Hypertext, Hypermedia and Web, 2001, p. 211-220. □□.
Behnak et al. Re-ranking search results uing network analysis a case study with google: a case study with Google, IBM Centre for Advanced Studies Conference, 2002, pp. 14,□□.
Krishma et al. Improved algorithms for topic distillation in a hyperlinked envirionment, Annual ACM Conferernce on Research and Development in Information Retrieval, 1998, p. 104-111.
Bharat, Krishna, Andrel Broder, Monika Henzinger, Puneet Kumar, and Suresh Venkatasubramanian. “The Connectivity Server: Fast Access to Linkage Information on the Web.” http://decweb.ethz.ch/WWW7/1938/com1938.htm. pp. 1-13.
Bharat, Krishna, and Monika R. Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” ACM, Inc.: Melbourne, Australia. 1998. pp. 1-9.
Brin, Sergey, Lawerence Page. “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” http://www7.scu.edu.au/programme/fullpapers/1921/com1921.htm. pp. 1-20.
Chakrabarti, Soumen, Byron E. Dom, Daivd Gibson, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. “Experiments in Topic Distillation.” http://www/almaden.ibm.com/cs/k53/abstract.html. pp. 1-6.
Chakrabarti, Soumen, Byron Dom, Prabhakar Raghavan, Sridhar Rajagopalan, Daivd Gibson, and Jon Kleinberg. “Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text.” http://www7.scu.edu.au/programme/fullpapers/1898/com1898.html. pp. 1-14.
Davison, Brian D., Apostolos Gerasoulis, Konstantinos Kleisouris, Yingfang Lu, Hyun-ju-Seo, Wei Wang, and Baohua Wu. “DiscoWeb: Applying Link Analysis to Web Search.” http://www.cs.rutgers.edu/˜davison/pubs/www99.html. pp. 1-4.
Dongarra, Jack J., Jeremy Du Croz, and Richard J. Hanson. “An Extended Set of FORTRAN Basic Linear Algebra Subprograms.” ACM Transactions on Mathematical Software, vol. 14, No. 1, Mar. 1988. pp. 1-17.
Gibson, David, Jon Kleinberg, and Prabhakar Raghavan. “Inferring Web Communities from Link Topology.” http://www.cs.cornell.edu/home/kleinber/ht98.ps. pp. 1-17.
Kleinberg, Jon M. “Authoritative Sources in a Hyperlinked Environment.” http://www.cs.cornell.edu/home/kleinber/auth.pdf. pp. 1-34.
Mizruchi, Mark S., Peter Mariolis, Michael Schwartz, and Beth Mintz. Techniques for disaggregating centrality scores in social networks. In N. B. Turna, editor, Sociological Methodology, pp. 26-48. Jossey-Bass, San Francisco, 1986.
Ng, Andrew Y., Alice X. Zhang, and Michael I. Jordan. Stable algorithms for link analysis. Proc. 24th International Conference on Research and Development in Information Retrieval (SIGIR), 2001.
Page, Lawrence, Sergy Brin, Rajeev Motwani, Terry Winograd. “The PageRank Citation Ranking: Bringing Order to the Web.” http://dbpubs.stanford.edu:8090/pub/1999-66. MS Power Point Presentation. Jan. 29, 1998. pp. 1-20.
Gerasoulis Apostolos
Seo Hyun-Ju
Wang Wei
Ali Mohammad
Blakely & Sokoloff, Taylor & Zafman
De Klerk Stephen M.
The State University Rutgers
To Baoquoc N.
LandOfFree
Retrieval and display of data objects using a cross-group... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Retrieval and display of data objects using a cross-group..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Retrieval and display of data objects using a cross-group... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3555640