111111111111111111111111111111111111111111111111111111111111111111111111111
`US005832494C I
`(12) EX PARTE REEXAMINATION CERTIFICATE (8571st)
`United States Patent
`US 5,832,494 Cl
`(10) Number:
`(45) Certificate Issued:
`*Sep. 27, 2011
`Egger et al.
`
`(54) METHOD AND APPARATUS FOR INDEXING,
`SEARCHING AND DISPLAYING DATA
`
`CA
`wo
`
`2177448
`WO 95/00895 A2
`
`12/1996
`1/1995
`
`(75)
`
`Inventors: Daniel Egger. Durham. NC (US):
`Shawn Cannon. Hillsborough, NC (US):
`Ronald D. Sauers. Mcbane. NC (US)
`
`(73) Assignee: Software Rights Archive, LLC.
`Durham. NC (US)
`
`Reexamination Request:
`No. 90/011.014. May 26.2010
`
`Reexamination Certificate for:
`Patent No.:
`5,832,494
`Issued:
`Nov. 3, 1998
`08/649,304
`Appl. No.:
`May 17,1996
`Filed:
`
`( *) Notice:
`
`This patent is subject to a terminal dis(cid:173)
`claimer.
`
`Related U.S. Application Data
`
`(63) Continuation-in-part of application No. 08/076.658. filed on
`Jun. 14, 1993, now Pat. No. 5.544.352.
`
`(51)
`
`Int. Cl.
`G06F 17/30
`
`(2006.01)
`
`(52) U.S. Cl. ......................... 707n37; 7071716; 7071748
`(58) Field of Classification Search ................... 707/102
`See application file for complete search history.
`
`(56)
`
`References Cited
`
`U.S. PATENT DOCUMENTS
`
`4,839,853 A
`4,868,733 A
`
`6/1989 Deerwester et al.
`9/1989 Fujisawa
`
`(Continued)
`
`FOREIGN PATENT DOCUMENTS
`
`AU
`
`48289/96
`
`3/1997
`
`OTHER PUBLICATIONS
`
`Carpenter et al.. "Culstcring of Scientific Journals" ASIS
`24(6):425-436, 1973 (Exhibit B to Defendants' Identifica(cid:173)
`tion of Prior Art).
`
`(Continued)
`
`Primary £mmi11er-Joshua Campbell
`
`(57)
`
`ABSTRACT
`
`A computer research tool for indexing. searching and dis(cid:173)
`playing data is disclosed. Specifically, a computer research
`tool for performing computerized research of data including
`textual objects in a database or a network and for providing a
`user interface that significantly enhances data presentation is
`described. Textual objects and other data in a database or
`network is indexed by creating a numerical representation of
`the data. The indexing technique called proximity indexing
`generates a quick-reference of the relations, patterns and
`similarity found among the data in the database. Proximity
`indexing indexes the data by using statisical techniques and
`empirically developed algorithms. Using this proximity
`index, an efficient search for pools of data having a particu(cid:173)
`lar relation, pattern or characteristic can be effectuated. The
`Computer Search program. called the Computer Search Pro(cid:173)
`gram for Data represented in Matrices (CSPDM). provides
`efficient computer search methods. The CSPDM rank orders
`data in accordance with the data's relationship to time, a
`paradigm datum, or any similar reference. An alternative
`embodiment of the invention employs a cluster link genera(cid:173)
`tion algorithm which uses links and nodes to index and
`search a database or network. The algorithm searches for
`direct and indirect links to a search node and retrieves the
`nodes which are most closely related to the search node. The
`user interface program, called the Graphical User Interface
`(GUI), provides a user friendly method of interacting with
`the CSPDM program and prepares and presents a visual
`graphical display. The graphical display provides the user
`with a two or three dimensional spatial orientation of the
`data.
`
`CHOOSE A NODE
`FOR ANAlYSIS
`
`IDENTIFY NODES WHICH
`HAVE A DIRECT
`RELATIONSHIP TO THE
`CHOSEN NODE
`
`EXECUTE CLUSTER UNK
`GENERATION ALGORITHM
`(e.g •• Fig. 3H)
`
`EXHIBIT 2046
`Facebook, Inc. et al.
`v.
`Software Rights Archive, LLC
`CASE IPR2013-00479
`
`

`
`US 5,832,494 Cl
`Page 2
`
`U.S. PATENT DOCUMENTS
`
`4.945.476 A
`4.953.106 A
`5.040.133 A
`5.060.170 A
`5.122.951 A
`5.157.783 A
`5.206.949 A
`5.241.671 A
`5.243.655 A
`5.265.065 A
`5.287.493 A
`5.301.109 A
`5.325.298 A
`5.341.293 A
`5.371.847 A
`5.386.556 A
`5.390.295 A
`5.418.948 A
`5.446.842 A
`5.446.891 A
`5.463.728 A
`5.471,611 A
`5.471.669 A
`5,530.852 A
`5.542,024 A
`5.544.352 A
`5.546.517 A
`5.586.311 A
`5.617.565 A
`5.630.120 A
`5.649.186 A
`5.649.193 A
`5,712.995 A
`5.748.954 A
`5.749.785 A
`5.794.001 A
`5.838.318 A
`5,838.906 A
`5,855.015 A
`5.898.434 A
`5.956.030 A
`6.098.081 A
`6.105,865 A
`6,182.091 Bl
`6,304.675 Bl
`6.438,579 B I
`
`711990 Bodick et al.
`8/1990 Gansner et al.
`8/1991 Feintuch et al.
`1011991 Bourgeois et al.
`6/1992 Kamiya
`10/1992 Anderson et al.
`4/1993 Cochran et al.
`8/1993 Reed et al.
`9/1993 Wang
`11/1993 Tunle
`211994 Jacopi
`4/1994 Landauer et al.
`6/1994 Gallant
`8/1994 Venelney et al.
`1211994 Hargrove
`1/1995 Hedin et al.
`2/1995 Bates et al.
`5/1995 Tunle
`8/1995 Schaeffer et al.
`8/1995 Kaplan eta!.
`10/1995 Blahut et al.
`11/1995 McGregor
`11/1995 Lidman
`6/1996 Meske, Jr. et al.
`7/1996 Balint eta!.
`8/1996 Egger
`8/1996 Marks et al.
`1211996 Davies et al.
`4/1997 Augenbraun et al.
`5/1997 Vachey
`7/1997 Ferguson
`7/1997 Sumita et al.
`1/1998 Cohn
`5/1998 Mauldin
`5/1998 Rossi des
`8/1998 Maloneet al.
`1111998 Poner et al.
`1111998 Doyle
`1211998 Shoham
`4/1999 Small et al.
`9/1999 Conrad et al.
`8/2000 Heidorn et al.
`8/2000 Hardesty
`112001 Pitkowetal.
`10/2001 Osbourne et al.
`8/2002 Hosken
`
`afHER PUBLICATIONS
`
`Brin. et al., "The Anatomy of a Large-Scale Hypertextual
`Web Search Engine". Computer Networks and ISDN Sys(cid:173)
`tems, vol. 30(1 -7). 1998, pp. 107-I 17.
`Bruandet. "Outline of a Knowledge Base Model for an Intel(cid:173)
`ligent Information Retrieval System", Information Process(cid:173)
`ing & Management, vol. 25. Issue I, 1989, pp. 89.,.-115.
`Garfield. "Citation Indexes for Science", Science, vol. 123,
`No. 3 I 59, Jul. 1955, pp. 108-111.
`Garfield. "The Role of the Medical Librarian in SDI Sys(cid:173)
`tems". Bulletin of the Medical Library Association, vol. 57,
`No.4. Oct. 1969, pp. 348-351.
`Giles. et al., "CiteSeer: An Automatic Citation Indexing Sys(cid:173)
`tem''. Third ACM Conference on Digital Libraries, ACM
`Press, 1998. pp. 89-98.
`Matula, "k-Components, Clusters, and Slicings in Graphs",
`SIAM Journal on Applied Mathematics, vol. 22, No. 3, May
`1972. pp. 459-480.
`
`Salton. et al.. "Automatic Structuring and Retrieval of Large
`Text Files". Communications of the ACM. vol. 37. No. 2.
`Feb. 1994.pp.97-108.
`Salton. et al.. "Enhancement of Text Representations Using
`Related Document Titles". Information Processing & Man(cid:173)
`agement vol. 22. No.5. 1986. pp. 385-394.
`''Relationship Cards: Heroic Means of Saving."' Future
`Banker (an American Banker publication). American Banker
`vol. 162. No. I 09. Jun. 9. 1997. Copyright American Banker
`Inc.-Bond Buyer 1997 (2011 Factivia.lnc.). 5 pages total.
`University of Michigan Journal of Law Reform note entitled
`"A Commerce Clause Challenge to New York's Tax Deduc(cid:173)
`tion For Investment In Its Own Tuition Savings Program,''
`dated Winter, 1999. 22 pages total.
`Fox, Virginia Discs 1 and 2, Nimbus Records. Virginia Poly(cid:173)
`technic Institute and State University. 1998. 6 compact Disc.
`"Brown University I.R.I.S. lntermedia: A Retrospective 53
`Minutes", Video Cassette.
`Libertech. "Libertech to release V-Search for Folio Views;
`Offers dramatic enhancements to electronics document
`research", Mar. 21. 1995, pp. 1-2.
`Libertech, "Libertech Announces Major Equity Financing:
`Will Market New Products for On-Line and Internet Pub(cid:173)
`lishing".Apr. 24, 1995. pp. 1-3.
`Kaplan. "New Ways to Find Needle in Data Haystack'', Los
`Angeles Times. Mar. 29. 1995. pp. 1-2.
`Kaplan, "Headline: The Cutting Edge/Computingffechnol(cid:173)
`ogy!Innovation: New Ways to Find Needle in Data Hay(cid:173)
`stack; Information: Novel Software is Making the Database
`Search Faster, More Efficient", Los Angeses Times, Mar. 29.
`1995, pp. t-5 (loaded Mar. 31. 1995).
`The British Library, "Document Relationships at a Glance'',
`Electronic Documents, vol. 3. No. 12, p. I.
`Libertech, "Americans with Disabilities Libertech I Lawyers
`Cooperative Publishing Proposed Pilot Project" Project
`Scope and Cost Estimates, Libertech Company Confidential.
`Feb.5, 1995,pp. 1-38.
`Libertech. "Business Plan" Mar. 1995, pp. 1-44.
`NetCarta Corp., A trip to Hawaii with CyberPilot™ Pro.
`Feb.21. 1996,pp. 1-30.
`Mauldin, "Lycose 4. peri: Search the Web for Information".
`May 1, 1994, pp. 1-8.
`Burt. "Structure'' A General Purpose Network Analysis Pro(cid:173)
`gram Providing Sociometric Indices, Cliques, Structural and
`Role Equivalences. Density Tables, Contagion, Autonomy.
`Power and Equilibria in Multiple Network Systems. Version
`4.2, Reference Manual, Columbia University, 1991, pp.
`1-232.
`Analytic Technologies, "UCINET IV" Network Analysis
`Software. Oct. 1992. pp. 2-3.
`Salton. "Associative Document Retrieval Techniques Using
`Bibliographic Information", Harvard University, Cam(cid:173)
`bridge, Massachusetts, Mar. 1963, pp. 440-457.
`Kessler. "TIP System Applications" A description of TIP
`Operations and a Preliminary Analysis of System Experi(cid:173)
`ence, Oct. 1967, pp. 1-14.
`Kessler. "TIP User's Manual'', A Guide for on-line
`Research and Retrieval of the Current Literature in Physics,
`1967. pp. t-22.
`Gamer et al., "Three Drexel Information Science Research
`Studies", Drexel Institute of Technology. 1967, pp. 1-46.
`Salton,
`"Automatic
`Information Organization
`and
`Retrieval", Professor of Computer Science, Cornell Univer(cid:173)
`sity, 1968, pp. 1-:514.
`
`

`
`US 5,832,494 Cl
`Page 3
`
`Goffman. "An Indirect Method of Information Retrieval".
`Inform. Star. Retr. val. 4. Pergamon Press. 1969. pp.
`361-373.
`Salton. "Automatic Indexing Using Bibliographic Citations''
`In Automatic Content Analysis. 1970. pp. 99-117.
`Salton. "The Smart Retrieval System", Experiments in Auto(cid:173)
`matic Document Processing. 1971. pp. 1-.556.
`Schiminovich, "Automatic Classification and Retrieval of
`Documents by Means of a Bibliographic Pattern Discovery
`Algorithm". Inform. Stor. Rctr .. vol. 6. 1971. pp. 417-435.
`Bichteler et al.. "Document Retrieval by Means of An Auto(cid:173)
`matic Classification Algorithm for Citations", Inform. Stor.
`Retr.. vol. 10, May. 1974. pp. 267-278.
`Shimko. "An Experiment with Semantics and Goffman's
`Indirect Method", Inform. Star. Retr .. vol. I 0, Aug. 29, 1974,
`pp. 387-392.
`Salton et al.. "A Vector Space Model for Automatic Index(cid:173)
`ing", Communications of the ACM. vol. 18. No. II. Nov.
`1975, pp. 613-620.
`Pinski et al.. "Citation Influence for Journal Aggregates of
`Scientific Publications: Theory, With Application to the Lit(cid:173)
`erature of Physics'', Information Processing & Management,
`val. 12. No. 5. 1976. pp. 297-312.
`Bitchteler et al.. Comparing Two Algorithms for Document
`Retrieval using Citation Links (Journal of the American
`Society of Information Science, val. 28, No.4, Jul. 1977.
`Garfield. "Citation Indexing" Its Theory and Application in
`Science. Technology. and Humanities, 1979. pp. 1-274.
`Tapper. "The Use of Citation Vectors for Legal Information
`Retrieval", Journal of Law and Information Science. vol. 1,
`No.2, 1982, pp. 131-161.
`Kochtanek, "Bibilographic Compilation Using Reference
`and Citation Links", Information Processing & Manage(cid:173)
`ment. vol. 18. No. I, 1982, pp. 33-39.
`Fox. "Some Consideration for Implementing the SMART
`Information Retrieval System Under UNIX", Department of
`Computer Science, Cornell University, 1983, pp. 1-88.
`Fox. "Characterization of Two New Experimental Collec(cid:173)
`tions in Computer and Information Science Containing Tex(cid:173)
`tual and Bibliographic Concepts", 1983, pp. 1-64.
`Salton et al., "Introduction
`to Modem
`Information
`Retrieval" 1983, pp. 1-448.
`Fox. "Combining Information in an Extended Automatic
`Information Retrieval System for Agriculture". Computer
`Center International Institute of Tropical Agriculture, 1984,
`pp. 449-466.
`Fox, "Composite Document Extended Retrieval" Proceed(cid:173)
`ings of the 8'11 Annual International ACM SIGIR Conference
`on Research and Development in Information Retrieval,
`1985, pp. 42-53.
`Belew, "Adaptive Information Retrieval: Machine Learning
`in Associative Networks", 1986, pp. 1-312.
`Conklin, "Hypertext: An Introduction and Survey" IEEE,
`Sep. 1987, pp. 17-40.
`Croft et al.. "Retrieving Documents by Plausible Inference:
`
`A Preliminary Study", Proceedings of the 11'1' Annual Inter(cid:173)
`national ACM SIGIR Conference on Research and Develop(cid:173)
`ment in Information Retrieval, 1988. pp. 481-494.
`Armstrong et al., "Manual of Online Search Strategies",
`1988, pp. 1-831.
`Frisse, "Searching for Information in A Hypertext Medical
`Handbook", Communications of the ACM, vol. 31, No.7,
`Jul. 1988. pp. 880-886.
`
`Sail on et al.. "On the Use of Spreading Activation Methods
`in Automatic Information Retrieval". Proceedings of the II '1
`'
`Annual International ACM SIGIR Conference. 1988. pp.
`147-160.
`Fox et al.. "Coefficients for Combining Concept Classes in a
`Collection", Proceedings of the II'" Annual International
`ACM SIGIR Conference on Research and Development in
`Information Retrieval. 1988. pp. 291-307.
`Conklin et al.. "giBIS: A Hypertext Tool for Exploratory
`Policy Discussion", ACM. 1988. pp. 140-152.
`Croft et al.. "A Retrieval Model for Incorporating Hypertext
`Links", Proceedings of the Second Annual ACM Conft:rence
`on Hypertext. 1989. pp. 213-224.
`Frisse et al.. "Information Retrieval From Hypertext Update
`on the Dynamic Medican Handbook Project". Proceedings
`of the Second Annual ACM Conference on Hypertext. 1989.
`pp. 199-212.
`Berners-Lee. "Information Management: A Proposal",
`CERN.
`http://www/w3/org/History/1989/proposal.html.
`1989. pp. 1-21.
`Thompson. "The Design and Implementation of an Intelli(cid:173)
`gent Interface for Information Retrieval", Feb. 1989. pp.
`l-216.
`Rose et al., "Legal Information Retrieval: A Hybrid
`Approach".ACM, 1989, pp. 138-146.
`Kornmers. "Graph Computation as an Orientation Device in
`Extended and Cyclic Hypertext Networks'', Designing
`Hypermedia for Learning, NATO ASI Series, vol. F67. 1990,
`pp. 117-134.
`Nielsen, "Hypertext and Hypermedia", Academic Press
`Limited, 1990. pp. 1-268.
`Shepherd et al., "Transient Hypergraphs for Citation Net(cid:173)
`works". Information Processing Management, vol. 26, No.
`3. l990,pp.395-412.
`Nielsen, "The Art of Navigating". Communications of the
`ACM, vaL 33, No.3, Mar. 1990, pp. 298-310.
`Turtle, "Inference Networks for Document Retrieval". A dis(cid:173)
`sertation by Howard Robert Turtle, Proceedings of the 13'1
`'
`Annual International ACM SIGIR Conference on Research
`and Development in Information Retrieval, Feb. 1991, pp.
`1-198.
`Turtle et al.. Evaluation of an Inference Network-Based
`Retrieval Model. ACM Transactions on Information Sys(cid:173)
`tems, vol. 9, No.3, Jul. 1991, pp. 187-222.
`Shaw, "Subject and Citation Indexing Part I: The Clustering
`Structure of Composite Representations in the Cystic Fibro(cid:173)
`sis Document Collection", Journal of the American Society
`for Information Science and Technology, 42(9), 1991. pp.
`669-675.
`Shaw, "Subject and Citation Indexing Part II: The Optimal,
`Cluster-Based Retrieval Performance of Composite Repre(cid:173)
`sentations", Journal of the American Society for Information
`Science and Technology, 42(9), 1991, pp. 67{Ki84.
`Brueni et al.. "What if There were Desktop Access to the
`Computer Science Literature?", ACM Conference on Com(cid:173)
`puter Science, 1993, pp. 15-22.
`Gelbart et al., Beyond Boolean Search: FLEXJCON, A
`Legal Text-based Intelligent System, ACM. 1991; pp.
`225-234.
`Lin et al., "A Self-Organizing Semantic Map for Informa(cid:173)
`tion Retrieval", SIGIR. ACM, 1991, pp. 262-269.
`Berk et al., Hypertext/Hypermedia Handbook. 1991. pp.
`1~583.
`
`

`
`US 5,832,494 Cl
`Pagc4
`
`Dunlop et al.. "Hypermedia and Free Text Retrieval"'. 1991.
`pp. 1-20.
`Rada. "Hypertext: from Text to Expertext". Department of
`Computer Science. University of Liverpool. 1991. pp.
`1-237.
`Rose, "A Symbolic and Connectionist Approach to Legal
`Information Retrieval". University of California. 1991. pp.
`1-293.
`Botafogo et al.. "Structural Analysis of Hypertexts: lndenti(cid:173)
`lying Hierarchies and Useful Metrics", ACM Transaction on
`Information Systems. vol. 10. No. 2. Apr. 1992, pp.
`142-180.
`Alain et al.. "Hypertext Paradigm in the Field of Information
`Retrieval: a Neural Approach'', ACM ECHT Conference.
`1992. pp. 112-121.
`Guinan et al., "Information Retrieval from Hypertext Using
`Dynamically Planned Guided Tours", ACM ECHT Confer(cid:173)
`ence, 1992, pp. 122-130.
`Chen, "LEND Pattern Language Syntax Specification: VER
`1.3", Oct. 12. 1992. pp. 1-8.
`Chen. "An Object-Oriented Database System for Efficient
`Information Retrieval Applications". 1992. pp. 1-240.
`Fox et al., "Users. User Interfaces, and Objects: Envision. a
`Digital Library". Journal of the American Society for Infor(cid:173)
`mation Science. 44(8). 1993, pp. 480-491.
`Croft et al., "Retrieval Strategies for Hypertext", Informa(cid:173)
`tion Processing & Management vol. 29, No. 3. 1993. pp.
`313-224.
`Betrabet et al.. "A Query Language for Information Graphs'',
`Department of Computer Science, Jan. 27, 1993. pp. 1-7.
`Betrabet. "A query Language for Information Graphs".
`Department of Computer Science, Dec. 1993, pp. l-107.
`Pinkerton, "Finding What People Want: Experiences with
`the WebCrawler'', 1994, pp. 1-10.
`Conrad et al., "A System for Discovering Relationships by
`Feature Extraction from Text Databases", Proceedings of the
`17'h Annual International ACM SIGIR Conference on
`Research and Development in Information Retrieval. Jul.
`1994, pp. I-II.
`De Bra et al., "Information Retrieval in the World-Wide
`Web: Making Client-Based Searching Feasible", Computer
`Networks and ISDN Systems, vol. 27, No. 2, 1994, pp.
`183-192.
`McKee, "Towards Better Integration of Dynamic Search
`Technology and the World-Wide Web", 1994, pp. 129-135.
`Krol, "The Whole Internet", User's Guide & Catalog, 1994,
`pp. 1-544.
`Herzner et al.. "Multimedia/Hyper Media in Open Distrib(cid:173)
`uted Environments", Proceedings of the Eurographics Sym-
`posium, Jun. 6-9, 1994, pp. 1-330.
`·
`Pitkow et al., "Webviz: A tool For World-Wide Web Access
`Log Analysis", In Proceedings of the First International
`WWW Conference, GVU Tech Report: GVU-GIT-94-20.
`Oct. 10. 1994; pp. 1-7.
`France et al., "MARIAN Design", Virginia Tech Computing
`Center. Feb. 14. 1995, pp. 1-40.
`Frei et at., "The Use of Semantic Links in Hypertext Infor(cid:173)
`mation Retrieval", Information Processing & Management.
`vol. 31. No. I, 1995, pp. 1-13.
`Pirolli et al.. "Silk from a Sow's Ear: Extracting Usable
`Structures from the Web'', In Conference on Human Factors
`in Computing Systems, CHI. 1996, pp. 1-8.
`
`Weiss et al.. "HyPursuit: A Hierarchical Network Search
`Engine that Exploits Content-Link Hypertext Clustering".
`Conference on Hypertext and Hypermedia Archive Proceed(cid:173)
`ings of the seventh ACM Conference on Hypertext. 1996.
`pp. 180-193.
`Bourne et al.. "A History of Online Information Services
`1963-1976". Massachusetts Institute of Technology. 2003.
`pp. 1-493.
`Seeley. "The Net of Reciprocal Influence". Can. Jour. Psych.
`Ill. 4. 1949. pp. 234-240.
`Katz. "A New Status Index Derived from Sociometric
`Analysis''. Psychometrika. vol. 18, No. I. 1953. pp. 39-43.
`Bar-Hillel. "A Logician's Reaction to Recent Theorizing on
`Information Search Systems", American Documentation,
`8(2): ABIIINFORM Global: Apr. 1957. pp. 103-113.
`Harary, "Structural Model: An Introduction to the Theory of
`Directed Graphs". John Wiley & Son. Inc .. see, e.g. Preface
`Ch. I. Digraphs and Structures, Ch. 5, Digraphs and Matri(cid:173)
`ces. and Ch. 14. Networks. 1965. pp. 415.
`Hubbell. "An Input-Output Approach to Clique Identifica(cid:173)
`tion", 1965. pp. 376-399.
`Jardine et al.. 'The Use of Hierarchic Clustering in Informa(cid:173)
`tion Retrieval", Inform. Stor. Retr. vol. 7, Pergamon, pp.
`217-240.
`Van Rijsbergen. "Information Retrieval". 1979, pp. 2-147.
`Jain et al.. "Algorithms for Clustering Data", 1988. pp.
`1-320.
`Pao et al .. "Retrieval Effectiveness by Semantic and Citation
`Searching··, Journal of the American Society for Information
`Science, 40(4}, 1989. pp. 225-235.
`Consens. "Expressing Structural Hypertext Queries in
`GraphLog''. Hypertext '89 Proceedings, Nov. 1989, pp.
`269-292.
`Kaufman et al., "Finding Groups in Data-An Introduction to
`Cluster Analysis". 1990. pp. 1-342.
`Korfhage. ''To See. or Not to See-Is That the Query?", ACM
`SIGIR Conference on Research and Development in Infor(cid:173)
`mation Retrieval. 1991, pp. 134-141.
`Li et al.. "X-Window Interface to SMART, an Advanced
`Text Retrieval System''. SIGIR Forum, 1992, pp. 5-16.
`Agosti et al. "A Hypertext Environment for Interacting with
`Large Textural Databases," IP&M 28: No. 3, 1992, pp.
`371-387.
`Agosti et al.. "User Navigation in the IRS Conceptual Struc(cid:173)
`ture Through a Semantic Association Function", The Com(cid:173)
`puterJournal. vol. 35. No.3, 1992. pp. 194-199.
`Salton et al .. "Approaches to Passage Retrieval in Full Text
`Information Systems". Proc. I6'h SIGIR Conference, 1993,
`pp. 49-58.
`Berners-Lee et al.. "World-Wide Web: The Information
`Universe". 1992. pp. 1-9.
`Crouch. 'The Visual Display of Information in an Informa(cid:173)
`tion Retrieval Environment", pp. 58-67.
`Rizk. "Hypertext Concepts, Systems and Applications", Pro(cid:173)
`ceedings of the First European Conference on Hypertext,
`Cambridge University Press. 1990, pp. 1-373.
`Salton et al.. Automatic Analysis, Theme Generation, and
`Summarization of Machine-readable Texts, Science, vol.
`264.Jun. 3. 1994. pp. 1421-1326.
`Wood et al., "HyperSpace: Web Browsing with Visualiza(cid:173)
`tion". Proceedings from the Third International World-Wide
`Web Conference, Apr. 10-14. 1995, pp. 1-5.
`Furner et al.. 'The Representation and Comparison of
`Hypenext Structures Using Graphs", 1996. pp. 75-96.
`
`

`
`US 5,832,494 Cl
`Page 5
`
`Ham et al., "Implementing Hypertext Database Relation(cid:173)
`ships Through Aggregations and Exceptions··. Hypertext '91
`Proceedings. Dec. 1991. pp. 75-90.
`McBryan, "GENVL and WWWW: Tools for Taming the
`Web'', May. 1994, pp. 1-10.
`Cleveland, "An n-Dimensional Retrieval Model", Journal of
`American Society for Information Science. Sep.-Oct. 1976.
`pp. 342-347.
`Salton et al.. "Approaches to Text Retrieval for Structured
`Documents", Department of Computer Science. Cornell
`University. Jan. II. 1990. pp. 1-19.
`Can et al., "A Dynamic Cluster Maintenance System for
`Information Retrieval''. ACM. 1987. pp. 123-131.
`Aversa. "Contract Research Services at lSI: Customized
`Citation Analysis for Governmental, Industrial, and Aca(cid:173)
`demic Clients'', Essays, vol. 15, Jun. 8. 1992. pp. 75-83.
`Agosti et al.; A Two-Level Hypertext Retrieval Model for
`Legal Data: SIGIR '91 (1991), pp. 1-10.
`Fowler et al.; Integrating Query. Thesaurus and Documents
`Through a Common Visual Representation, SIGIR '91
`(1991), pp. 1-10.
`Belew, Ricnard; A Connectionist Approach to Conceptual
`Information RetrievaliCAIL '87 (1987). pp. 1-11.
`Turtle, Howard R., & Croft, W. Bruce, Inference Networks
`for Document Retrieval, SIGIR '90 (1990). pp. 1-24.
`Infobase 95 Demonstration Disks, Libertech V-Search for
`Folio VIEWS, Installation Instructions, 3 pgs.
`Krulwich, et a!.; Learning User Information Interests
`Through Extraction of Semantically Significant Phrases;
`1996; pp. 110-112: AAAJ Technical Report SS-9~5.
`Hull: Improving Text Retrieval for the Routing Problem
`Using Latent Semantic Indexing; 1994; 10 pgs.
`J. MacQueen; Some Methods for Classification and Analysis
`of Multivariate Observations; 1967; pp. 281-297; Univ. of
`California.
`K.L Kwok & L Grunfeld; TREC2 Document Retrieval
`Experiments using PIRCS; 1994; 10 pgs.; NIST Special
`Publication SP.
`Sal ton & Buckley; On the Automatic Generation of Content
`Links in Hypertext; Department of Computer Science, Cor(cid:173)
`nell University TR 89-993, 1989~ pp. 1-16.
`Korfhage; Query Enhancement by User Profiles; Southern
`Methodist University, 1984, pp. 111-121.
`Joachims et al; Web Watcher: Machine Learning and Hyper(cid:173)
`text, School of Computer Science, Carnegie Melton Univer(cid:173)
`sity, 1995, 5 pages.
`Aalbersberg, A Document Retrieval Model Based on Term
`Frequency Ranks, Springer-Vertag New York, Inc., New
`York, NY, pp. 164-171, 1994; 11 pgs.
`Aho et al., Data Structures and Algorithms, Addison-Wesley
`Publishing Company, pp. 199-229, pp. 171-223, 1983. 19
`pgs.
`Aho et al., The Design and Analysis of Computer Algo(cid:173)
`rithms; Addison-Wesley Publishing Company, 1976, 30 pgs.
`Baase. Computer Algorithms: Introduction to Design and
`Analysis, Chapter 3: Graphs & Digraphs, pp. 114-169, Add(cid:173)
`ison-Wesley Publishing Company, 1978, 28 pgs.
`Bichteler et al., Comparing Two Algorithms for Document
`Retrieval Using Citation Links, Journal of the American
`Society of Information Science, vol. 28, No.4, pp. 192-195,
`Jul. 1977,4 pgs.
`Caplinger, Graphical Database Browsing, Bell Communica(cid:173)
`tions Research, Room 2A-261, 435 South Street. Morris(cid:173)
`town, NJ 07960, 1986, pp. 113-118, 6 pgs.
`
`Cowart: Master Windows 3.1. Apr. 2, 1992. pp. 64-76. 867.
`Crouch. et al.. The Automatic Generation of Extended Que(cid:173)
`ries, Department of Computer Science. Duluth. Minnesota,
`pp. 369-383, 1990, 15 pgs.
`Crouch, et al.. The Use of Cluster Hierarchies in Hypertext
`Information Retrieval, Department of Computer Science,
`Duluth. Minnesota. Hypertext
`'89 Proceedings. pp.
`225-237, Nov. 1989. 14 pgs.
`Fritsche. Commission of the European Communities: Auto(cid:173)
`matic Clustering Techniques in Information Retrieval, Joint
`Nuclear Research Center, lspra Establishment, Italy 1974,
`142 pgs.
`Furner et al.. Information Retrieval and Hypertext: The Rep(cid:173)
`resentation and Comparison of Hypertext Structures Using
`Graphs, Kluwer Academic Publishers. Norwell, Massachu(cid:173)
`setts. pp. 75-96. 1996, 14 pgs.
`Golub et al., Matix Computations, The Johns Hopkins Uni(cid:173)
`versity Press, pp. 1-476, 492 pgs.
`Hearst et al., Subtopic Structuring for Full-Length Docu(cid:173)
`ment Access. Computer Science Division, Berkeley, CA.
`Proc. 16'h SIGIR, pp. 59-68, 1993, 10 pgs.
`Horowitz et al., Fundamentals of Data Structures, Chapter 6,
`Graphs, Computer Science Press, Inc., pp. 282-335, 1976
`and 1982, 28 pgs.
`Kommers. Designing Hypermedia for Learning: Chapter 7,
`Graph Computation as an Orientation Device in Extended
`and Cyclic Hypertext Networks, pp. 117-134, Spring(cid:173)
`er-Verlag, Berlin, 1990, 20 pgs.
`Kung!. Statskontoret, Citation Index and Measures of Asso(cid:173)
`ciation in Mechanized Document Retrieval; Swedish Ratio(cid:173)
`nalization Agency, Stockholm, Jan. l, 1967. 14 pgs.
`Libertech, Inc., V-Search™ Integration Toolkit for Folio
`VIEWS, Beta Release 2.0, User's Manual, Preliminary
`Draft. Draft 1.0, pp. l-36, Dec. 6, 1995, 43 pgs.
`Libertech, Inc., V-Search™ Publisher's Toolkit, Beta
`Release 2.0, User's Manual, Draft 2.0, pp. l-160, Dec. 8,
`1995, 171 pgs.
`Products in the News: Document Relationships at a Glance,
`Electronic Documents, vol. 3, No. 12, 1994, 1 pg.
`Salton et al., A Citation Study of the Computer Science Lit(cid:173)
`erature, Department of Computer Science, Ithaca, NY, 46
`pgs.
`Salton et al., Automatic Text Structuring and Retrieval(cid:173)
`Experiments in Automatic Encyclopedia Searching, Depart(cid:173)
`ment of Computer Science, Cornell University, pp. 21-30,
`1991. 10 pgs.
`R.A. Botafogo and B. Shneiderman, "Identifying Aggre(cid:173)
`gates in Hypertext Structures:' Hypertext '91 Proceedings,
`Dec. 1991, pp. 63-74 ("Botafogo 1991").
`R.A. Botafogo, "Cluster Analysis for Hypertext Systems,"
`ACM-SIGIR'93, vol. 6, pp. ll6-125, 1993 ("Botafogo
`1993").
`H.P. Frei and D. Stieger, "Making Use of Hypertext Links
`when Retrieving Information," ACM, 1992 ("Frei & Stieger
`1992").
`S. Baase, Computer Algorithms: Introduction to Design and
`Analysis, 2nd Edition. Addison-Wesley Publishing Co.,
`1988 ("Baase 1988").
`D. Lucarella, "A Model for Hypertext-Based Information
`Retrieval," Proceedings of the ECHT'90, Cambridge Uni(cid:173)
`versity Press, N. Streitz, A. Rizk and J. Andre, eds., pp.
`81-94, Nov. 1990 ("Lucarella 1990").
`
`

`
`US 5,832,494 Cl
`Page 6
`
`E. Fox, "Extending the Boolean and Vector Space Models of
`Information Retrieval with P-Norm Queries and Multiple
`Concept Types:· Cornell University, 1983 ("Fox 1983'").
`
`B.R. Schatz and J.B. Hardin. "NCSA Mosaic and the World
`Wide Web: Global Hypermedia Protocols for the Internet."
`Science, vol. 265, Aug. 12, 1994 ("Schatz & Hardin 1994").
`
`

`
`US 5,832,494 C I
`
`1
`EX PARTE
`REEXAMINATION CERTIFICATE
`ISSUED UNDER 35 U.S.C. 307
`
`THE PATENT IS HEREBY AMENDED AS
`INDICATED BELOW.
`
`Matter enclosed in heavy brackets [ ] appeared in the
`patent, but has been deleted and is no longer a part of the
`patent; matter printed in italics indicates additions made
`to the patent.
`
`AS A RESULT OF REEXAMINATION, IT HAS BEEN
`DETERMINED THAT:
`
`The patentability of claims 1-3. 5, 7-16 and 18-21 is con(cid:173)
`firmed.
`
`Claims 23-25 and 31-33 are cancelled.
`
`New claims 34-54 are added and determined to be patent(cid:173)
`able.
`
`Claims 4. 6, 17, 22 and 26-30 were not reexamined.
`
`34. The method of claim 1, wherein said use of cluster
`Jinks in displaying the identity of idelltified nodes comprises
`using one or more cluster links to detennine a rank which is
`used as a factor in displa)\ and wherein said generation of 30
`candidate cluster links recursively analyzes a set of direct
`Jinks in a path.
`35. The method of claim 5, wherein said indirect relation(cid:173)
`ships are a chain of hyper/ink references between objects on
`the world wide web; and wherein the step of generating uses 35
`a specified distance limit for detennining whether a path is
`examined.
`36. The method of claim 34, wherein the selected node is a
`start node and said actual cluster links are used to rank an
`importance of an object on the world wide web; and wherein
`the step of identifying comprises using the rank and a key
`work search.
`37. The method of claim 34, wherein an independent
`application detemzines a cost associated with accessing the
`identified nodes.
`38. The method of claim 13, wherein said direct links are
`hyperlink relationships of objects on the world wide web and
`said displayed objects referred to in the cluster link set
`includes at least the selected object, the metlwdfurther com(cid:173)
`prising:
`generating an importance rank for the selected object
`using the actual cluster links; and
`using the importance rank as a factor to detennine an
`order of display.
`39. The method of claim 38, wherein one or more of said 55
`direct links includes a weight based upon a quantity of direct
`references from an object to other objects.
`40. The method of claim 14, wherein said direct links are
`hyper/ink relationships on the world wide web and said
`paths are chains of hyperlinks that make up indirect
`relationships, and wherein the detemzination of the path
`weight uses a damping factor.
`41. The method of claim 40, wherein the generation of
`said direct links include a weight that uses the numbett of
`hyperlinks colltained in a web object poillling to other 65
`objects in its calculation.
`
`* * * * *
`
`5
`
`10
`
`2
`42. The method ~f claim 40, wherein the selected node is
`an object on the world wide web, further comprising:
`selecting acwal cluster links from the stored candidate
`cluster links based upon an analysis of a p1vximity of
`the selectetlnode to another node;
`using actual cluster links to calculate a value for an objecl
`prior to a search query; wherein said value is used to
`detemzine the object~ importance; and
`storing said value in 011 index prior to searching.
`43. Tire method of claim 42, wherein the detemrination of
`importance considers a number of times the web object is
`visited.
`44. The method of claim 41, wherein said detemzined path
`includes at least an indirect relationship of B dtes.f.f cites e,
`15 e cites d. and d cites A.
`45. The method of claim 19, wherein the direct relation(cid:173)
`ships are hyper/ink relationships between objects on /he
`world wide web and the second numerical representation of
`direct and indirect relationships is a value that is generated
`20 by analyzing direct/ink weights in a set of paths between Mo
`indirectly related objects, and wherein the step of idemifying
`uses at least the value to detennine an object~ importance
`for ranking.
`46. The method of claim 18, wherein the direct relation-
`25 ships are hyper/ink relationships between objects on the
`world wide web and wherein generation of the second