US20070174254A1 - Systems and methods for organizing data - Google Patents

Systems and methods for organizing data Download PDF

Info

Publication number
US20070174254A1
US20070174254A1 US11/611,816 US61181606A US2007174254A1 US 20070174254 A1 US20070174254 A1 US 20070174254A1 US 61181606 A US61181606 A US 61181606A US 2007174254 A1 US2007174254 A1 US 2007174254A1
Authority
US
United States
Prior art keywords
data elements
patent publications
data
geometric shapes
database
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US11/611,816
Inventor
Hoo-min Toong
Joseph Hadzima
Andre Morkel
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Technology Enabling Co LLC
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to US11/611,816 priority Critical patent/US20070174254A1/en
Assigned to TECHNOLOGY ENABLING COMPANY, LLC reassignment TECHNOLOGY ENABLING COMPANY, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: MORKEL, ANDRE, TOONG, HOO-MIN
Publication of US20070174254A1 publication Critical patent/US20070174254A1/en
Assigned to TECHNOLOGY ENABLING COMPANY, LLC reassignment TECHNOLOGY ENABLING COMPANY, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: HADZIMA, JOSEPH G., JR.
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33Querying
    • G06F16/338Presentation of query results
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/904Browsing; Visualisation therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/93Document management systems
    • G06F16/94Hypermedia
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/955Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
    • G06F16/9558Details of hyperlinks; Management of linked annotations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2216/00Indexing scheme relating to additional aspects of information retrieval not explicitly covered by G06F16/00 and subgroups
    • G06F2216/11Patent retrieval
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99931Database or file accessing
    • Y10S707/99933Query processing, i.e. searching
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99931Database or file accessing
    • Y10S707/99933Query processing, i.e. searching
    • Y10S707/99934Query formulation, input preparation, or translation
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99944Object-oriented database structure
    • Y10S707/99945Object-oriented database structure processing
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99948Application of database or data structure, e.g. distributed, multimedia, or image

Definitions

  • the invention relates to systems and methods for organizing information, and more particularly to systems and methods that graphically depict information in an organized format.
  • the software system described herein organizes, analyzes and presents in an optimized fashion a comprehendible graphic representation of the available data allowing the user to immediately and intrinsically infer the existence of relationships and trends that would normally not have been apparent otherwise.
  • This new method supports decision making to a level never achieved before and is capable of presenting data relationships across multiple planes and accessing dissimilar data sets.
  • the FRIDAY system is such a decision support system (Find, Relate, Infer, Discover, Analyze, and Yes to actions) For example, if a decision has to be made to invest in a particular opportunity/technology, FRIDAY can greatly enhance the evaluation of intellectual property that surrounds the technology that exists in patent, published paper, and prior art form. FRIDAY can also find business data and the relationships that exist relevant to the opportunity, relate that to the intellectual property data and then to other relevant facts (such as market issues, competition, economic activity, etc.). Having developed the ‘landscape’ for this particular technology the system can then infer specific important trends that have direct relevance to the opportunity.
  • the FRIDAY system is a collection of targeted databases with powerful data retrieval, data correlation and data connection attributes, and unique inference and business communication capabilities. From a user's perspective FRIDAY is a user-friendly system that can sort, analyze, and make sense of data from many different expertise areas and then correlate this data to help illustrate relationships and graphically represent trends of importance that can help in drawing conclusions or supporting actions.
  • IBM possessor of numerous patents has recognized that the patents owned by them (one-dimensional) when assessed against others patents may yield connections resulting in patents which incorporate a significant portion of the art represented in IBM owned patents, which to IBM can equate to significant licensing opportunities. While our software system can accomplish this with algorithms more effectively and efficiently, it can go beyond and relate other data items such as the company's products related to these patents and/or the inventors associated with the patents and the companies these inventors were employed at before their present company and the patents that were assigned to these companies.
  • This software system can also be applicable in the financial sector, where many financial measures can be combined to illustrate trends and relationships that would normally not be apparent by looking at them individually.
  • the software system described herein organizes, analyzes and presents in an optimized fashion a comprehendible graphic representation of the available data allowing the user to immediately and intrinsically infer the existence of relationships and trends that would normally not have been apparent otherwise.
  • This new method supports decision making to a level never achieved before and is capable of presenting data relationships across multiple planes and accessing dissimilar data sets. The ability to then access the underlying data is also disclosed.
  • the invention can include a method for displaying and correlating data records in a visually comprehendible manner so as to effectively communicate relationships amongst data records.
  • the method comprising the steps of defining the input parameters for searching, said input parameters being dependent on the data and descriptive of the fields in a data record, searching databases comprised of said data records using said input parameters as filters to identify associated data records, capturing associated data from said databases to create the working set containing a unique set of data records, augmenting the working set and performing additional processing to determine connections amongst the data records in the working set and other data records to identify relationships between the data records and the working set and bring to light additional information and knowledge that illustrate and infer relationships not readily apparent from the data records alone, presenting the combined and processed data records in an graphical fashion relative to a time axis to create an expanded display set depicting relationships indicated by connections which allow for communication of issues related to planning, assessment, and implementation, where said connectors are lines calculated and placed to minimize amount of crossing and length which connect the data records represented by a single geometric shape and wherein each shape is
  • the methods also include a step where the presentation of the expanded display set is dynamic such that additional information about a particular data record can be obtained by double clicking the shape to bring one directly to the original data source to enable viewing of additional information related to the data item in question. Additionally, the user has the ability to direct the algorithm to the primary or any number of alternate data sources that may exist for the additional information. Moreover, a hypothetical data record in a similar format can be added to the working set to determine the relationships of the data to the hypothetical entry and to determine the effects and relationships the hypothetical entry has on the data where said hypothetical data item is distinguished by a unique color and/or shape.
  • secondary functional algorithms may be run on the display set to determine areas for potential licensing opportunities, where said potential licensing opportunities are determined by a high degree of patents with the same assignee which reference similar art of another assignee which precedes in time the citing patents which are citing it and/or a high degree of similarity as determined by natural language searching amongst patents with different assignees which may or may not cite the patent which proceeds it.
  • FIG. 1 depicts a functional block diagram of one system according to the invention; for presenting data in an organized format;
  • FIG. 2 depicts one example of a key grid for identifying a working set of documents
  • FIGS. 3 and 4 depict examples of a web for presenting data in the relationship between data in an organized graph.
  • a system will be described for organizing a data set that includes a plurality of data elements each of which represent a Patent Application.
  • the systems and methods described herein will organize the Patent publication to create a graphical depiction or a Web that shows the different ad publications within the data set and it depicts graphically the relationship between those patents.
  • the graphical depiction is presented as a two dimensional image, however in other embodiments three-dimensional or N-dimensional images or representations are created.
  • FIG. 1 depicts a system 10 for aiding a user and searching through a plurality of data elements to identify a subsection of data elements relevant to a particular interest of the user and for organizing the sub set into a graphical depiction that displays a relationship between the different data elements within the data set selected by the user.
  • FIG. 1 depicts a system 10 that includes a data processor element 12 that is coupled to a user terminal 14 .
  • the data processor 12 includes a data retrieval mechanism, a data correlation mechanism 20 , a data connection mechanism 22 , and a image generator 24 , and for the depicted embodiment a plurality of targeted databases 28 .
  • the system 12 can operate to provide a graphical depiction 30 indicative of the data elements selected by the user and the relationships between the data elements.
  • the data processing system 12 depicted in FIG. 10 can be any conventional data processing system such as an IBM PC compatible computer running the Windows® operating system, or a sub work station running a Unix operating system.
  • the user monitor applicable device 14 can be a conventional computer monitor and keyboard.
  • the user port terminal 14 and the data processor 12 provide the user with a conventional data processing platform that can be employed for searching through a plurality of databases to identify a set of data elements each of which is possibly relevant through to an interest, query, or question of the user.
  • the system 10 can operate as a work station that has been programmed, or include an application program, that allows the user to search through polarity of databases to collect information relevant to a user query.
  • the system 10 can organize an analysis the data elements to provide to the user a graphical depiction on the different data elements collected in certain ones of the relationship between those data elements. This is depicted in FIG. 10 by the graphical depiction of data elements 30 . Accordingly, it will be understood that the system 10 allows a user to receive a graphical depiction of the returned data set, and thereby allows the user or easily to do some models of current behavior, and other inferences, and thereby provides the user with improved opportunities for data analysis.
  • each of the depicted elements 18 through 24 respectively may be implemented as a computer processes or a single computer process operating on the platform 12 .
  • each of the depicted elements 18 through 24 can be an executing computer process that can be embodied as a computer program such as a C, C++, Fortran, Java, Perl, or other computer language.
  • the data retrieval element 18 depicted in FIG. 1 includes a database query and set building system of the type commonly employed for allowing a user to build a search query for identifying documents within a database.
  • the data retrieval element 18 can employ key word searchers to allow the user to employ a key word search, or an iterative process keyword search that builds sequences of keywords in a response to a trail of documents retrieved and reviewed by the user. Such a process is similar to a tree tracing process as subsequent searches narrow and converge upon sets of documents.
  • the data retrieval element 18 employed keyword grids that assists the system operator or a domain specialist in narrowing down relevant information that may form a working set for the user.
  • a working set may be understood as a set of useful data retrieved from the plurality of targeted databases 28 , which can contain information on a variety of different topics.
  • the process for generating a keyword grid is depicted in FIG. 2 .
  • FIG. 2 depicts a keyword grid 40 that can be generated by the data retrieval element 18 in response to a user query, 42 .
  • the user query 42 can be a compound user query that includes a plurality of keywords combined together to form a string.
  • the meaning of the string can relate to a topic of interest to the user, and can be employed by the user for identifying documents within the targeted databases 28 of interested of the user.
  • the data retrieval element 18 parses the user query 42 to identify a plurality of keyword terms 44 such as those depicted in FIG. 2 .
  • the keyword terms 44 can be organized in the grid 40 along a set of horizontal and vertical paxes. For example, the user query
  • Radio Frequency Polymerization Use of Radio Waves to Heat Monomers and Drive Condensation Polymerization.
  • This user query 42 can be subdivided in a plurality of key terms such as the key terms (radio and frequency); radio and wave; (polymer); (condens*); (condens* and polymer*); (nylon); (head*).
  • each of these key terms 44 can be aligned along a respective portion of the horizontal or vertical axes to define the keyword grid 40 .
  • the data retrieval element 18 may perform searches over the targeted databases 28 with these combinations.
  • the resulting matches can be represented within the keyword grid 40 and then the system may perform analysis over the grid entries. For example, the system 10 may determine how many unique documents exist between two grid entries between the keyword 40 , as many of the matches of both grid entries may be for the same document.
  • the data retrieval element 18 may include a keyword parser that can analyze the user query 42 to identify within the user query one or more keywords 44 that can be separated out of the query and employed for performing a keyword search over the targeted databases 28 .
  • the keyword analysis tools used within the data retrieval element 18 comprise conventional analysis systems and specifically in one embodiment comprises, an expanded macro function. However, more sophisticated analysis systems may be employed without departing from the scope of the invention.
  • the data retrieval element 18 may include a weighting device that can determine and/or add appropriate statistical measures to the keyword searching process to achieve a higher level of intelligent data gathering. Other such modifications and additions may be made to the data retrieval element 18 , and the actual operation of the element 18 will vary depending on the application. In either case, the design and development of the data retrieval element 18 follows from principles known in the art, including those described in McGovern et al., A Guide To Sybase and SQL Server , Addison-Wesley (1993).
  • the data retrieval element 18 may conduct the various searches over the targeted databases 28 .
  • the targeted databases 28 may be supported by any suitable persistent data memory, such as a hard disk drive, RAID system, tape drive system, floppy diskette, or any other suitable system.
  • the system 10 depicted in FIG. 1 includes databases that are shown as part of the data processing platform 12 , but may in alternate embodiments, comprise remote, and/or distributed database systems.
  • the working database 28 may comprise a standard Lotus Notes databases, CD-ROM databases, specially constructed databases (e.g. a proprietary research database), and WWW databases (web pages gathered from searches as well as the Web, or other Internet service in general).
  • these searches may result in several hundred or a few thousand patents that may have direct or indirect impact upon the case being studied.
  • a particular company may have 50 patents on DRAM memory and be concerned about (1) its competitors patent portfolios (could be several hundred); (2) its competitive position vis-à-vis those portfolios (relationships between the portfolios); or (3) how does it continue to position its new patents within the field.
  • Standard keyword approaches would involve linear iterative searches focused around keyword strings; sets of documents containing these keywords will be selected for further study as the search process continues.
  • the system 10 in one practice may first use the Keyword Grid approach that forms compound and complex keyword combinations and then automatically searches the databases 28 .
  • the system 10 may use information within documents to interactively refine, and in some cases expand, searches.
  • the Keyword Grid 40 will yield a matrix of document hits that satisfy various combinations of keyword strings 44 .
  • the system 10 can then find related documents that are connected to the matrix of documents by various fields or contexts specified by the operator (e.g. sister or offspring patent documents).
  • the output of the data retrieval element 18 is a high quality working set, WS.
  • the system 10 may automatically allow the selection and creation of working sets resulting from ‘new’ documents that are found through successive searches. The creation of working sets may also apply for unreviewed documents.
  • the data correlation element 20 and the data connection element 22 operate on the WS to identify connections and relationships between documents.
  • Both the data correlation element 20 and the data connection element 22 may be processes executing on the data processing platform 12 , and can be processes that were written as C, C++, Java, Fortran, PERL, or other computer programs.
  • the data correlation element 20 and the data connection element 22 may develop relationships between documents based upon: (1) fields whose contents contain references or pointers to other documents—these can be direct or indirect; (2) HTML links [hyper or hot links]; (3) contextual data within a document that can be developed into pointers or associations with other documents; (4) references that are generated through the use of intermediate documents, one example being a look-up table such as a dictionary or thesaurus; (5) groupings of documents based upon trend analyses that are performed, possibly in parallel, during an Infer trends operation, of the type commonly employed with data analysis systems and methods.
  • the infer trend process comprises, at least in part, a visual analysis of a graphical depiction of the data elements in the working set, as well as at least some of the relationships between these data elements.
  • the correlation process provided by the data correlation element 20 may function in an iterative fashion, either with itself, or with another function; and (6) general reference established by association of content within one document and content of other documents, or groups of documents.
  • FIG. 3 depicts a web showing the relationships and connections related to the Batelle patent.
  • Batelle holds a key patent for Bar Code Readers. This Web indicates that Eastman Chemical, Xerox, Pitney Bowes and Angstrom Technologies are candidates to consider for potential licensing deals, following a thorough claims analysis.
  • Such Webs the results of the data correlation element 20 and data connection element 22 , exist in a construct termed a “plane” in the system 10 .
  • a plane within any one plane there may be several Webs that can be interconnected (Webs can be organized in a graph-like manner themselves) but all Webs within a plane will generally originate from one or more databases that are similar in content. Since there are many databases with different types of content in the system 10 (with more being added all the time) there are many potential planes. Webs may be interconnected between any two or more planes. Generally a Web will contain a single type of intra-connection selected from the various types of relationships defined previously.
  • Webs are rich in visual information with distinct patterns, clusters, and anomalous data, they provide graphical depictions of data sets and the relationships between data sets that may be employed to infer trends readily.
  • Some examples of information contained within Webs are given below:
  • a Web pattern of converging citation connections may imply a key blocking patent, a seminal patent, or a rich source of potential licensing revenue;
  • Patents which have no forward references might imply a unique IP opportunity or conversely, no commercial viability;
  • Many patents from a single organization that are concentrated in an area of a Web will lead to a thorough claims analysis of the connected group to determine if blocking positions are being taken by that organization; this, could be correlated with Webs to technical papers and business deals relevant to this position.
  • the system 10 includes an image generator 24 .
  • the image generator 30 may be a computer process operating on the data processing platform 12 , and capable of processing the working set data and the identified relationships and connections between different elements within the data set, to create a graphical depiction of the data.
  • the image generator 24 processes the data to organize the data elements in manner that allows the data to be depicted in an ordered and comprehendible manner. Processing of the data for creating a Web presentation may be accomplished both functionally and mathematically. On a functional level appropriate use may be made of colors, shapes, connector characteristics, non-linear axes, and Web ghosting within planes to help deduce meaning and relationships. Additionally, a mathematical model has been constructed and implemented that controls characteristics such as minimal visually-projected crossovers, intershape spacing, and interplane connectivities.
  • the webs 30 may be employed to identify trends in the data. Trends may be both graphical and statistical in nature. Once a Web has been generated, numerical statistics may be calculated and displayed to help in the analysis of Web data. Currently statistics can be grouped into the following categories: a) Summary statistics of specific fields over a Web. For example: The “top 10” occurring companies assigned patents, ranked in descending order, in this Web of patents; b) Comparative statistics such as charting one organization's Web data against another, or against a group of competitors. c) Time series of statistics (histograms) and comparative time series among groups of documents; and d) Cluster analysis over the Web data by various criteria such as frequency or connectivity.
  • the image generator 24 processes the data elements in the working set and the connections and relations determined by the elements 20 and 22 to generate a graph of the working set.
  • the linking structure among different pieces of information may be modeled as a graph and the processes described in Zhang et al., Automatic Organization of A WEB Linking Graph , (December 1997); and Bin Zhang, An Intrinsic Hierarchical Structure in Any Undirectd Graph And Its Properties , (October 1998) may be employed.
  • a node represents a web page, a page of flat text in hypertext, a scientific publication, a patent or a business identity.
  • An edge represents a one-way or two-way relationship, like a link, a reference, etc.
  • attributes representing real world information, to the notes and links often exist.
  • the nodes could have different shapes and sizes or belong to different classes.
  • the process handles attributes.
  • the locations of the nodes are to be determined.
  • the process gives the coordinates of the nodes that optimize the layout in a comprehensible way (to be defined more precisely) and guarantees no overlapping of the nodes.
  • the second requirement gives rise to a lot of constraints on the coordinates.
  • one of the coordinates is often better determined by an attribute of the node.
  • the time a patent was granted could be very important to the users and assigned to the X-axis's of the screen. In such cases, there will be only one coordinate left to be determined by the algorithm.
  • 3D dynamic presentation can be used. The optimization algorithm in such situations could be required to determine three coordinates of a node.
  • straight-line, polyline, orthogonal, etc was chosen for its simplicity and drawing area efficiency.
  • one of the coordinates is often better determined by an attribute of the node.
  • the time a patent was granted could be very important to the users and assigned to the X-axis's of the screen. In such cases, there will be only one coordinate left to be determined by the algorithm.
  • 3D dynamic presentation can be used. The optimization algorithm in such situations could be required to determine three coordinates of a node.
  • the algorithm developed depends on an intrinsic hierarchical structure of undirected graphs.
  • L (L, E 1 ), L ⁇ G, F 1 ⁇ E, is a subgraph with the property that starting from any node in L, each edge and node has to be passed exactly once to come back to the starting point.
  • a single node is called a trivial cycle because there is no edges.
  • the nodes in G and the edges in E are classified based on if they can be part of a non-trivial cycle.
  • the word “tree” can be explained by the fact that a connected graph is a free) tree if it has no cycle-edges.
  • e is not part of any non-trivial cycle. The remaining edges are called cycle-edges, E c E ⁇ E r .
  • PCSG PCG-Subgraph
  • MPCSG Maximal PCG-subgraph
  • any undirected graph is a tree of Pure-Cycle-Graphs of trees.
  • a pure cycle graph is a graph that has no tree nodes and free edges. All the leaf-nodes in G are aggregated one by one until there is no more leaf-nodes in the final aggregation G ⁇ . Then each maximal PCG is aggregated into a single node, which gives the top level tree T.
  • This hierarchy gives the natural partition of the undirected graph for a divide-and-conquer type of algorithm.
  • a tree layout algorithm is developed and applied to both the lop level tree, T, and the little trees that hung out on the nodes in. PCGs.
  • a PCG layout algorithm was developed and applied to each individual PCG.
  • the tree-PCG-tree structure works well with any spanning tree of the original graph. This property has been used to traverse the tree-PCG-tree hierarchy.
  • the layout of a tree was done through depth first traversal, yielding a graph similar to FIG. 3 .
  • Subtrees are laid out before the parent so that the total size of the subtrees can be calculated when we assign coordinates to the parent.
  • Special ordering of the children can make the layout more appealing. For example, in our implementation, children were sorted according to the size of their bounding boxes (both length and height). Layout was done symmetrically around the centerline of the parent for its compactness and symmetry. Gaps between children were minimized to save screen space. Bounding boxes of the subtrees which are needed for both calculating the coordinates or the parent and for PCG-subgraph layout (to be presented), were calculated recursively during the layout.
  • Each node in the PCG takes the amount of space determined by its bounding box size, which was calculated during the layout of the sub-tree hanging out on the LN. Sequential ordering of the nodes with their bounding boxes non-overlapping ensures the non-overlapping of the nodes in G. The ordering that minimizes the total length of the edges in each PCG was found.
  • Any undirected graph is a tree of PCGs, pure-cycle-graphs, of trees (Tree-PCG-Tree hierarchy). This hierarchy gives the natural partition of the undirected graph for a divide-and-conquer type of algorithms.
  • a tree layout algorithm is developed and applied to both the top level tree and the little trees that hang out on the nodes in PCGs.
  • a PCG layout algorithm was developed and applied to each individual PCG.
  • the systems described herein may include image generators that provide Webs as arbitrary connections of documents, even between planes which themselves represent different databases. This may be achieved as the mathematical models developed are extensible to n dimensions.
  • the representation of patents connected within a plane there could be multiple patent Webs, will use the same algorithms to represent connections to other planes (business news, technical journals, funding, government regulations, etc.). The same optimizations, spacing and display considerations will apply, generated from the same underlying processes. There will not be a separate 3-D model, or an n-dimensional model to handle cases where multiple planes are involved.

Abstract

The software system described processes a user query for information and organizes, analyzes and presents in a graphic representation, the relevant data for the user, allowing the user to immediately and intrinsically infer the existence of relationships and trends that would normally not have been apparent otherwise. This method supports decision making to an improved level and is capable of presenting data relationships across multiple planes and accessing dissimilar data sets. The ability to then access the underlying data is also disclosed.

Description

    REFERENCE TO RELATED APPLICATIONS
  • This application is a continuation of U.S. patent application Ser. No. 09/645,626, filed on Aug. 24, 2000, which application is a continuation of U.S. patent application Ser. No. 09/454,457 filed on Dec. 3, 1999, which application claims priority to U.S. Patent Application Ser. Nos. 60/111,111 and 60/111,112 both filed on Dec. 4, 1998.
  • All of these applications are incorporated explicitly by reference herein in their entireties.
  • FIELD OF THE INVENTION
  • The invention relates to systems and methods for organizing information, and more particularly to systems and methods that graphically depict information in an organized format.
  • BACKGROUND OF THE INVENTION
  • As advances in both computers and the Internet continue, the abundance of data and access to it can be overwhelming at times. While the ability to access this data is limited only by the computer one owns, turning it into useful knowledge is a very different problem. While more and more data is produced and available for use, processing methods which turn data into knowledge have lagged behind. Whole industries have developed centered around search engines simply to scour the internet for data on everything from apples to zoos and more. However even these methods fall short of providing knowledge, at best they return a listing of items that require Human decision making to refine the search further. Only after additional attempts at searching, each time refining the set of keywords or methods employed, does the searcher begin gain knowledge as to the most optimal method to obtain the information required.
  • In cases where data items are interrelated, the difficulty of transforming the data into useful knowledge increases significantly and is even a more difficult problem than above. In most cases when dealing with data, people tend to view data relationships one-dimensionally, most often as a listing of items, some examples include: hits for web pages based upon a set of keywords, a phonebook of names, product listings, US patents issued. In each of the above cases the data is categorized under similar groupings, similar data items are combined in the same group.
  • To move beyond the one-dimensional nature of utilizing data, traditional approaches employed to help one make sense of data for decision making have been to construct a model and then try to fit the data to the model. One of the more useful and successful models which accomplishes this is the simple organizational chart which shows individuals in an organization and their relationships in reporting structure. The additional dimension of reporting relationships transforms the one-dimensional list of individuals to a very useful image which represents not only the individuals but the relationships of the individuals to each other. An additional example of a two dimensional data relationship would be airline routes which show the originating and destination points connected by a curved line which represents the flight connecting those two cities. But data can have multiple relationships both within similar data sets and dissimilar data sets. Building models for these situations in order to transform the data into knowledge useful for high-level and strategic decision making is significantly more difficult. In these cases one needs to know the landscape, be part of it, until now this was difficult at best for the three-dimensional case and nonexistent for dimensions beyond.
  • With the widespread availability of data and more powerful computer technology, being successful at defining relationships of voluminous complex interrelated data on multiple levels in a timely manner is now possible with the method/software disclosed. The software system described herein organizes, analyzes and presents in an optimized fashion a comprehendible graphic representation of the available data allowing the user to immediately and intrinsically infer the existence of relationships and trends that would normally not have been apparent otherwise. This new method supports decision making to a level never achieved before and is capable of presenting data relationships across multiple planes and accessing dissimilar data sets.
  • The FRIDAY system is such a decision support system (Find, Relate, Infer, Discover, Analyze, and Yes to actions) For example, if a decision has to be made to invest in a particular opportunity/technology, FRIDAY can greatly enhance the evaluation of intellectual property that surrounds the technology that exists in patent, published paper, and prior art form. FRIDAY can also find business data and the relationships that exist relevant to the opportunity, relate that to the intellectual property data and then to other relevant facts (such as market issues, competition, economic activity, etc.). Having developed the ‘landscape’ for this particular technology the system can then infer specific important trends that have direct relevance to the opportunity.
  • From a programmer's perspective, the FRIDAY system is a collection of targeted databases with powerful data retrieval, data correlation and data connection attributes, and unique inference and business communication capabilities. From a user's perspective FRIDAY is a user-friendly system that can sort, analyze, and make sense of data from many different expertise areas and then correlate this data to help illustrate relationships and graphically represent trends of importance that can help in drawing conclusions or supporting actions.
  • As an example, the existence of patents is becoming increasingly important as businesses place increasingly more value on intellectual capital. Most companies pursue patents to maintain or improve their competitive position. However the standard benchmark for most if not all of these companies is simply the number of patents possessed, a one-dimensional measure. Some of the more progressive companies may go a step further a begin to utilize additional information such as who are the most prolific inventors in order to determine their key contributors to the organization, which is a different measure but still nevertheless one-dimensional. Some two-dimensional measures that companies are beginning to tap is in the area of licensing opportunities. An example of this is IBM approach, IBM possessor of numerous patents, has recognized that the patents owned by them (one-dimensional) when assessed against others patents may yield connections resulting in patents which incorporate a significant portion of the art represented in IBM owned patents, which to IBM can equate to significant licensing opportunities. While our software system can accomplish this with algorithms more effectively and efficiently, it can go beyond and relate other data items such as the company's products related to these patents and/or the inventors associated with the patents and the companies these inventors were employed at before their present company and the patents that were assigned to these companies.
  • There are also other areas where this software can be applied, as an example tracking major sports figures and the teams they played on over the life of their career is an example of a three-dimensional mapping easily performed by our system, adding their salaries at each point in time is also possible, or for that matter any of their stats.
  • This software system can also be applicable in the financial sector, where many financial measures can be combined to illustrate trends and relationships that would normally not be apparent by looking at them individually.
  • To the authors knowledge there is not another system that currently attempts to coherently correlate data from an arbitrary set of separate domains in such an optimized graphical representation.
  • SUMMARY OF THE INVENTION
  • The software system described herein organizes, analyzes and presents in an optimized fashion a comprehendible graphic representation of the available data allowing the user to immediately and intrinsically infer the existence of relationships and trends that would normally not have been apparent otherwise. This new method supports decision making to a level never achieved before and is capable of presenting data relationships across multiple planes and accessing dissimilar data sets. The ability to then access the underlying data is also disclosed.
  • More specifically, the invention can include a method for displaying and correlating data records in a visually comprehendible manner so as to effectively communicate relationships amongst data records. The method comprising the steps of defining the input parameters for searching, said input parameters being dependent on the data and descriptive of the fields in a data record, searching databases comprised of said data records using said input parameters as filters to identify associated data records, capturing associated data from said databases to create the working set containing a unique set of data records, augmenting the working set and performing additional processing to determine connections amongst the data records in the working set and other data records to identify relationships between the data records and the working set and bring to light additional information and knowledge that illustrate and infer relationships not readily apparent from the data records alone, presenting the combined and processed data records in an graphical fashion relative to a time axis to create an expanded display set depicting relationships indicated by connections which allow for communication of issues related to planning, assessment, and implementation, where said connectors are lines calculated and placed to minimize amount of crossing and length which connect the data records represented by a single geometric shape and wherein each shape is placed to minimize overlapping and total space required, where said time axis is scalable throughout the entire time range and independently scalable across and within multiple sub-time ranges and any of the various search parameters may be represented in a number of various methods by employing the use colors, shapes, and/or patterns allowing one to communicate additional information and further distinguish the display set.
  • The methods also include a step where the presentation of the expanded display set is dynamic such that additional information about a particular data record can be obtained by double clicking the shape to bring one directly to the original data source to enable viewing of additional information related to the data item in question. Additionally, the user has the ability to direct the algorithm to the primary or any number of alternate data sources that may exist for the additional information. Moreover, a hypothetical data record in a similar format can be added to the working set to determine the relationships of the data to the hypothetical entry and to determine the effects and relationships the hypothetical entry has on the data where said hypothetical data item is distinguished by a unique color and/or shape.
  • Once the set is defined, secondary functional algorithms may be run on the display set to determine areas for potential licensing opportunities, where said potential licensing opportunities are determined by a high degree of patents with the same assignee which reference similar art of another assignee which precedes in time the citing patents which are citing it and/or a high degree of similarity as determined by natural language searching amongst patents with different assignees which may or may not cite the patent which proceeds it.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The foregoing and other objects and advantages of the invention will be appreciated more fully from the following further descriptions thereof with reference to the accompanying drawings wherein;
  • FIG. 1 depicts a functional block diagram of one system according to the invention; for presenting data in an organized format;
  • FIG. 2 depicts one example of a key grid for identifying a working set of documents;
  • FIGS. 3 and 4 depict examples of a web for presenting data in the relationship between data in an organized graph.
  • DETAILED DESCRIPTION OF THE ILLUSTRATED EMBODIMENTS
  • To provide an overall understanding of the invention, certain illustrated embodiments will now be described including systems and methods for organizing data, and for identifying relationships between data element, to provide a graphical representation of a data set and the relationship between the data elements within the data set. In one particular embodiment, a system will be described for organizing a data set that includes a plurality of data elements each of which represent a Patent Application. The systems and methods described herein will organize the Patent publication to create a graphical depiction or a Web that shows the different ad publications within the data set and it depicts graphically the relationship between those patents. In one embodiment the graphical depiction is presented as a two dimensional image, however in other embodiments three-dimensional or N-dimensional images or representations are created.
  • FIG. 1 depicts a system 10 for aiding a user and searching through a plurality of data elements to identify a subsection of data elements relevant to a particular interest of the user and for organizing the sub set into a graphical depiction that displays a relationship between the different data elements within the data set selected by the user. Specifically, FIG. 1 depicts a system 10 that includes a data processor element 12 that is coupled to a user terminal 14. The data processor 12 includes a data retrieval mechanism, a data correlation mechanism 20, a data connection mechanism 22, and a image generator 24, and for the depicted embodiment a plurality of targeted databases 28. As further shown by FIG. 1, the system 12 can operate to provide a graphical depiction 30 indicative of the data elements selected by the user and the relationships between the data elements.
  • The data processing system 12 depicted in FIG. 10 can be any conventional data processing system such as an IBM PC compatible computer running the Windows® operating system, or a sub work station running a Unix operating system. The user monitor applicable device 14 can be a conventional computer monitor and keyboard. In the embodiment depicted by FIG. 10 the user port terminal 14 and the data processor 12 provide the user with a conventional data processing platform that can be employed for searching through a plurality of databases to identify a set of data elements each of which is possibly relevant through to an interest, query, or question of the user. Accordingly, the system 10 can operate as a work station that has been programmed, or include an application program, that allows the user to search through polarity of databases to collect information relevant to a user query. From the information collected in response to the user query, the system 10 can organize an analysis the data elements to provide to the user a graphical depiction on the different data elements collected in certain ones of the relationship between those data elements. This is depicted in FIG. 10 by the graphical depiction of data elements 30. Accordingly, it will be understood that the system 10 allows a user to receive a graphical depiction of the returned data set, and thereby allows the user or easily to do some models of current behavior, and other inferences, and thereby provides the user with improved opportunities for data analysis.
  • For the database processing element 12, it will be understood that although the data processor 12 is depicted as a functional block diagram, including function block elements such as the data retrieval element 18, the data correlation element 20 and the data connection element 22, it will be understood that the functional block representation provided by FIG. 1 is merely illustrative of the processes operating on the platform 12 and that each of the depicted elements 18 through 24 respectively may be implemented as a computer processes or a single computer process operating on the platform 12. In particular, each of the depicted elements 18 through 24 can be an executing computer process that can be embodied as a computer program such as a C, C++, Fortran, Java, Perl, or other computer language.
  • The data retrieval element 18 depicted in FIG. 1 includes a database query and set building system of the type commonly employed for allowing a user to build a search query for identifying documents within a database. To this end, the data retrieval element 18 can employ key word searchers to allow the user to employ a key word search, or an iterative process keyword search that builds sequences of keywords in a response to a trail of documents retrieved and reviewed by the user. Such a process is similar to a tree tracing process as subsequent searches narrow and converge upon sets of documents. In one embodiment, the data retrieval element 18 employed keyword grids that assists the system operator or a domain specialist in narrowing down relevant information that may form a working set for the user. A working set may be understood as a set of useful data retrieved from the plurality of targeted databases 28, which can contain information on a variety of different topics. The process for generating a keyword grid is depicted in FIG. 2. Specifically FIG. 2 depicts a keyword grid 40 that can be generated by the data retrieval element 18 in response to a user query, 42. As depicted in FIG. 2 the user query 42 can be a compound user query that includes a plurality of keywords combined together to form a string. The meaning of the string can relate to a topic of interest to the user, and can be employed by the user for identifying documents within the targeted databases 28 of interested of the user.
  • In one embodiment, the data retrieval element 18 parses the user query 42 to identify a plurality of keyword terms 44 such as those depicted in FIG. 2. As further shown in FIG. 2 the keyword terms 44 can be organized in the grid 40 along a set of horizontal and vertical paxes. For example, the user query
  • Radio Frequency Polymerization; Use of Radio Waves to Heat Monomers and Drive Condensation Polymerization.
  • This user query 42 can be subdivided in a plurality of key terms such as the key terms (radio and frequency); radio and wave; (polymer); (condens*); (condens* and polymer*); (nylon); (head*). As shown in FIG. 2 each of these key terms 44 can be aligned along a respective portion of the horizontal or vertical axes to define the keyword grid 40. For each of the key phrases 44, the data retrieval element 18 may perform searches over the targeted databases 28 with these combinations. The resulting matches can be represented within the keyword grid 40 and then the system may perform analysis over the grid entries. For example, the system 10 may determine how many unique documents exist between two grid entries between the keyword 40, as many of the matches of both grid entries may be for the same document.
  • To this end, the data retrieval element 18 may include a keyword parser that can analyze the user query 42 to identify within the user query one or more keywords 44 that can be separated out of the query and employed for performing a keyword search over the targeted databases 28. In one embodiment, the keyword analysis tools used within the data retrieval element 18 comprise conventional analysis systems and specifically in one embodiment comprises, an expanded macro function. However, more sophisticated analysis systems may be employed without departing from the scope of the invention. Optionally, the data retrieval element 18 may include a weighting device that can determine and/or add appropriate statistical measures to the keyword searching process to achieve a higher level of intelligent data gathering. Other such modifications and additions may be made to the data retrieval element 18, and the actual operation of the element 18 will vary depending on the application. In either case, the design and development of the data retrieval element 18 follows from principles known in the art, including those described in McGovern et al., A Guide To Sybase and SQL Server, Addison-Wesley (1993).
  • Once the keyword grid 40 is formed by the data retrieval element 18, the data retrieval element 18 may conduct the various searches over the targeted databases 28. This is the data retrieval portion of the system 10. The targeted databases 28 may be supported by any suitable persistent data memory, such as a hard disk drive, RAID system, tape drive system, floppy diskette, or any other suitable system. The system 10 depicted in FIG. 1 includes databases that are shown as part of the data processing platform 12, but may in alternate embodiments, comprise remote, and/or distributed database systems. The working database 28 may comprise a standard Lotus Notes databases, CD-ROM databases, specially constructed databases (e.g. a proprietary research database), and WWW databases (web pages gathered from searches as well as the Web, or other Internet service in general).
  • In the case of a search over a targeted database 28 that comprises a patent database, these searches may result in several hundred or a few thousand patents that may have direct or indirect impact upon the case being studied. For example, a particular company may have 50 patents on DRAM memory and be concerned about (1) its competitors patent portfolios (could be several hundred); (2) its competitive position vis-à-vis those portfolios (relationships between the portfolios); or (3) how does it continue to position its new patents within the field. Standard keyword approaches would involve linear iterative searches focused around keyword strings; sets of documents containing these keywords will be selected for further study as the search process continues. The system 10, in one practice may first use the Keyword Grid approach that forms compound and complex keyword combinations and then automatically searches the databases 28. Secondly, the system 10 may use information within documents to interactively refine, and in some cases expand, searches. For example, in the patent example above, the Keyword Grid 40 will yield a matrix of document hits that satisfy various combinations of keyword strings 44. The system 10 can then find related documents that are connected to the matrix of documents by various fields or contexts specified by the operator (e.g. sister or offspring patent documents).
  • In the end, the output of the data retrieval element 18 is a high quality working set, WS. Optionally, the system 10 may automatically allow the selection and creation of working sets resulting from ‘new’ documents that are found through successive searches. The creation of working sets may also apply for unreviewed documents.
  • Once the working set is obtained, the data correlation element 20 and the data connection element 22 operate on the WS to identify connections and relationships between documents. Both the data correlation element 20 and the data connection element 22 may be processes executing on the data processing platform 12, and can be processes that were written as C, C++, Java, Fortran, PERL, or other computer programs. The data correlation element 20 and the data connection element 22 may develop relationships between documents based upon: (1) fields whose contents contain references or pointers to other documents—these can be direct or indirect; (2) HTML links [hyper or hot links]; (3) contextual data within a document that can be developed into pointers or associations with other documents; (4) references that are generated through the use of intermediate documents, one example being a look-up table such as a dictionary or thesaurus; (5) groupings of documents based upon trend analyses that are performed, possibly in parallel, during an Infer trends operation, of the type commonly employed with data analysis systems and methods. The design and development of such processes, follows from principles known in the art, including those set forth in The Art of Computer Programming: Fundamental Algorithms ( Vol 1, 3rd Ed), Donald Ervin Knuth, as well as other sources. Moreover, as will be discussed below, in one practice, the infer trend process comprises, at least in part, a visual analysis of a graphical depiction of the data elements in the working set, as well as at least some of the relationships between these data elements. Optionally, the correlation process provided by the data correlation element 20 may function in an iterative fashion, either with itself, or with another function; and (6) general reference established by association of content within one document and content of other documents, or groups of documents.
  • These relationships that were identified among the documents retrieved either from WS or from other system 10 databases and are represented as interconnected graphs, or Webs by the image generator 24 of the system 10. One such web is depicted in FIG. 3. Specifically, FIG. 3 depicts a web showing the relationships and connections related to the Batelle patent. As can be seen from FIG. 3, Batelle holds a key patent for Bar Code Readers. This Web indicates that Eastman Chemical, Xerox, Pitney Bowes and Angstrom Technologies are candidates to consider for potential licensing deals, following a thorough claims analysis.
  • Such Webs, the results of the data correlation element 20 and data connection element 22, exist in a construct termed a “plane” in the system 10. Within any one plane there may be several Webs that can be interconnected (Webs can be organized in a graph-like manner themselves) but all Webs within a plane will generally originate from one or more databases that are similar in content. Since there are many databases with different types of content in the system 10 (with more being added all the time) there are many potential planes. Webs may be interconnected between any two or more planes. Generally a Web will contain a single type of intra-connection selected from the various types of relationships defined previously. However, this use of a single type of intra-connect is not required; there may be cases where a mix of two or more types of intra-connects may be used. The results of a relate function are themselves part of a WS and can be fed into statistical analyses of additional find and relate functions.
  • It is the connections displayed in the Webs and in the groupings of Webs that leads to insights as to the character and inter-relationships of the data. For example converging connections implies some focus of attention that must be examined; frequency of occurrence of key organizations within a Web will yield some indicator of ‘level of activity’ and possible strategic implications vis-à-vis competitors, or even potential partners.
  • As the Webs are rich in visual information with distinct patterns, clusters, and anomalous data, they provide graphical depictions of data sets and the relationships between data sets that may be employed to infer trends readily. Some examples of information contained within Webs are given below: In the patent plane, a Web pattern of converging citation connections may imply a key blocking patent, a seminal patent, or a rich source of potential licensing revenue; Patents which have no forward references might imply a unique IP opportunity or conversely, no commercial viability; Many patents from a single organization that are concentrated in an area of a Web will lead to a thorough claims analysis of the connected group to determine if blocking positions are being taken by that organization; this, could be correlated with Webs to technical papers and business deals relevant to this position. These are but a few examples of trends that can be inferred from the data represented in Webs.
  • To generate the webs 30, the system 10 includes an image generator 24. To this end, the image generator 30 may be a computer process operating on the data processing platform 12, and capable of processing the working set data and the identified relationships and connections between different elements within the data set, to create a graphical depiction of the data. Additionally, the image generator 24 processes the data to organize the data elements in manner that allows the data to be depicted in an ordered and comprehendible manner. Processing of the data for creating a Web presentation may be accomplished both functionally and mathematically. On a functional level appropriate use may be made of colors, shapes, connector characteristics, non-linear axes, and Web ghosting within planes to help deduce meaning and relationships. Additionally, a mathematical model has been constructed and implemented that controls characteristics such as minimal visually-projected crossovers, intershape spacing, and interplane connectivities.
  • The webs 30 may be employed to identify trends in the data. Trends may be both graphical and statistical in nature. Once a Web has been generated, numerical statistics may be calculated and displayed to help in the analysis of Web data. Currently statistics can be grouped into the following categories: a) Summary statistics of specific fields over a Web. For example: The “top 10” occurring companies assigned patents, ranked in descending order, in this Web of patents; b) Comparative statistics such as charting one organization's Web data against another, or against a group of competitors. c) Time series of statistics (histograms) and comparative time series among groups of documents; and d) Cluster analysis over the Web data by various criteria such as frequency or connectivity.
  • In one embodiment, the image generator 24 processes the data elements in the working set and the connections and relations determined by the elements 20 and 22 to generate a graph of the working set. To this end, the linking structure among different pieces of information may be modeled as a graph and the processes described in Zhang et al., Automatic Organization of A WEB Linking Graph, (December 1997); and Bin Zhang, An Intrinsic Hierarchical Structure in Any Undirectd Graph And Its Properties, (October 1998) may be employed.
  • For these processes a node represents a web page, a page of flat text in hypertext, a scientific publication, a patent or a business identity. An edge (directed or undirected) represents a one-way or two-way relationship, like a link, a reference, etc. In addition to the mathematical definition of a graph, attributes, representing real world information, to the notes and links often exist. For example, the nodes could have different shapes and sizes or belong to different classes. In a preferred implementation, the process handles attributes. The locations of the nodes are to be determined. The process gives the coordinates of the nodes that optimize the layout in a comprehensible way (to be defined more precisely) and guarantees no overlapping of the nodes. The second requirement gives rise to a lot of constraints on the coordinates.
  • For certain applications, one of the coordinates is often better determined by an attribute of the node. For example, the time a patent was granted could be very important to the users and assigned to the X-axis's of the screen. In such cases, there will be only one coordinate left to be determined by the algorithm. For graphs of high complexity (large number of nodes, densely connected, or hierarchical relationship among nodes or links). 3D dynamic presentation can be used. The optimization algorithm in such situations could be required to determine three coordinates of a node. Among many different types of graph drawing standards—straight-line, polyline, orthogonal, etc—straight line drawing was chosen for its simplicity and drawing area efficiency.
  • Crossings of the edges are allowed. Disallow crossings will rule out many real-world situations in which the graph to be handled are not planar. Besides, there are often attributes to the nodes that are more important factors for deciding the coordinates of the nodes than reducing crossings. The time when a patent was granted is a good example. The (smallest) number of steps down the links to reach another web page from the current page could be another. M minimizing the number of crossings does not always give the best result.
  • For certain applications, one of the coordinates is often better determined by an attribute of the node. For example, the time a patent was granted could be very important to the users and assigned to the X-axis's of the screen. In such cases, there will be only one coordinate left to be determined by the algorithm. For graphs of high complexity (large number of nodes, densely connected, or hierarchical relationship among nodes or links), 3D dynamic presentation can be used. The optimization algorithm in such situations could be required to determine three coordinates of a node.
  • Among many different types of graph drawing standards—straight-line, polyline, orthogonal, etc—straight line drawing was chosen for its simplicity and drawing area efficiency. The algorithm handles any and all types of graphs. Planarity is not required. Crossings of the edges are allowed. Disallow crossings will rule out many real-world situations in which the graph to be handled is not planar. Besides, there are often attributes to the nodes that are more important factors for deciding the coordinates of the nodes than reducing crossings. The time when a patent was granted is a good example. The (smallest) number of steps down the links to reach another web plane from the current plane could be another. Minimizing the total length of the edges does not give the optimal either.
  • From our studies, we found that minimizing the length of edges under the constraint of no overlapping in general gives more appealing layouts. Edges on the screen take a lot of space especially when the number of edges is much larger than the number of nodes. Reducing the length of the edges significantly improve clarity. This optimization will automatically pull the related nodes closer to each other.
  • The algorithm developed depends on an intrinsic hierarchical structure of undirected graphs.
  • Let G=(G, E) be a connected graph.
  • A cycle. L=(L, E1), LG, F1 E, is a subgraph with the property that starting from any node in L, each edge and node has to be passed exactly once to come back to the starting point. For convenience, a single node is called a trivial cycle because there is no edges. The nodes in G and the edges in E are classified based on if they can be part of a non-trivial cycle. In the following definitions, the word “tree” can be explained by the fact that a connected graph is a free) tree if it has no cycle-edges.
  • Definition 1: Tree-nodes arc the nodes in G that is not part of any cycle in G, i.e. GT={εG|n is not part of my non-trivial cycle } is the set of tree-nodes. The remaining nodes are called cycle nodes Gc=G−Gr. Accordingly, the set of tree-edges, Er={e εE|e is not part of any non-trivial cycle. The remaining edges are called cycle-edges, Ec=E−Er.
  • A subgraph is called a PCG-Subgraph (PCSG) if it is a PCG. A Maximal PCG-subgraph (MPCSG) is a PCG-subgraph that no more nodes or edges from G can be added to keep it a PCG.
  • In the art it is shown that any undirected graph is a tree of Pure-Cycle-Graphs of trees. A pure cycle graph is a graph that has no tree nodes and free edges. All the leaf-nodes in G are aggregated one by one until there is no more leaf-nodes in the final aggregation G<<. Then each maximal PCG is aggregated into a single node, which gives the top level tree T.
  • This hierarchy gives the natural partition of the undirected graph for a divide-and-conquer type of algorithm. A tree layout algorithm is developed and applied to both the lop level tree, T, and the little trees that hung out on the nodes in. PCGs. A PCG layout algorithm was developed and applied to each individual PCG.
  • The tree-PCG-tree structure works well with any spanning tree of the original graph. This property has been used to traverse the tree-PCG-tree hierarchy.
  • The layout of a tree was done through depth first traversal, yielding a graph similar to FIG. 3. Subtrees are laid out before the parent so that the total size of the subtrees can be calculated when we assign coordinates to the parent. Special ordering of the children can make the layout more appealing. For example, in our implementation, children were sorted according to the size of their bounding boxes (both length and height). Layout was done symmetrically around the centerline of the parent for its compactness and symmetry. Gaps between children were minimized to save screen space. Bounding boxes of the subtrees which are needed for both calculating the coordinates or the parent and for PCG-subgraph layout (to be presented), were calculated recursively during the layout.
  • Setting up the total length of the edges as a performance function to be optimized under all non-overlapping constraints as a continuous variable optimization problem is not hard. But solving that problem is not easy because 1) the performance function is not linear (it could be converted to an equivalent linear in some special cases); 2) the constraints on the locations of the nodes are very complicated. If we draw those constraints as hyperplanes in the high dimensional space where the optimization problem is setup, we will find that the space is segmented into many disconnected regions. The real optimization is to find the region that contains the optimal (after restricted to this region, it becomes an optimization of a continuous variable function over a convex hull). Therefore, it is a discrete problem.
  • By introducing a sequential ordering of the nodes in a PCG, the problem was formulated to be in optimization over Sn, the permutation group of n elements. Sequential ordering is an artificial constraint introduced to simplify the problem. It also gives only a sub-optimal instead of the true optimal of the original problem. However, the results from this sub-optimal have been quit satisfactory. Further improvements based on this sub-optimal solution are possible and have been implemented.
  • Each node in the PCG takes the amount of space determined by its bounding box size, which was calculated during the layout of the sub-tree hanging out on the LN. Sequential ordering of the nodes with their bounding boxes non-overlapping ensures the non-overlapping of the nodes in G. The ordering that minimizes the total length of the edges in each PCG was found.
  • Exhaustive search over S is impossible except for very small problems because the size of Sn is n!. The steepest decent idea from optimization of continuous variables is borrowed. Search is done in a local neighborhood of an element in Sn, and the best is chosen to be the next state. The process is repeated until a local minimum is found (we have no way to know if it is a global minimum without exhaustive search). To avoid being easily trapped in a local minimum, a larger neighborhood can be used for the local search in the steepest decent. The algorithm bas been implemented as a DLL in C on MS Windows platform. This DLL is called try applications developed in Visio Professional and Lotus Notes. The amount of time it took by the computational algorithm (the DLL) has been measured separately and presented here because the time required by drawing the nodes and edges on the screen was done in the application and it varies greatly depending on what graphics drawing (commercial) software is used.
  • Any undirected graph is a tree of PCGs, pure-cycle-graphs, of trees (Tree-PCG-Tree hierarchy). This hierarchy gives the natural partition of the undirected graph for a divide-and-conquer type of algorithms. A tree layout algorithm is developed and applied to both the top level tree and the little trees that hang out on the nodes in PCGs. A PCG layout algorithm was developed and applied to each individual PCG.
  • Those skilled in the art will know or be able to ascertain using no more than routine experimentation, many equivalents to the embodiments and practices described herein. For example, the systems described herein may include image generators that provide Webs as arbitrary connections of documents, even between planes which themselves represent different databases. This may be achieved as the mathematical models developed are extensible to n dimensions. In another example, the representation of patents connected within a plane, there could be multiple patent Webs, will use the same algorithms to represent connections to other planes (business news, technical journals, funding, government regulations, etc.). The same optimizations, spacing and display considerations will apply, generated from the same underlying processes. There will not be a separate 3-D model, or an n-dimensional model to handle cases where multiple planes are involved. It will also be understood that the systems described herein provide advantages over the prior art including improved ease of processing. Accordingly, it will be understood that the invention is not to be limited to the embodiments disclosed herein, but is to be understood from the following claims, which are to be interpreted as broadly as allowed under the law.

Claims (41)

1. A method of searching a database of data elements, the method comprising:
generating a search query to identify a first set of one or more data elements in the database,
based on the first set, identifying a second set of one or more data elements in the database, where the data elements of the second set are related to one or more of the data elements of the first set, and
generating data based on the data elements of the first and second sets and the relationships therebetween.
2. The method of claim 1, wherein generating a search query includes:
receiving search data from the user,
based on the search data, generating the search query.
3. The method of claim 2, wherein generating a search query includes:
determining one or more keywords based on the search data, and
generating the search query including the one or more keywords.
4. The method of claim 3, wherein generating a search query includes:
generating the search query using a grid having first and second axes based on the one or more keywords.
5. The method of claim 4, further comprising:
coalescing the first set of data elements to include unique data elements.
6. The method of claim 1, wherein the data elements of the second set are related to one or more of the data elements of the first set based on time.
7. The method of claim 1, wherein the data elements of the second set are related to one or more of the data elements of the first set based on one or more references.
8. The method of claim 7, wherein the references are based on the content of one or more of the data elements of the first set and the data elements of the second set.
9. The method of claim 7, wherein the references include one or more of citations and HTML links.
10. The method of claim 1, wherein identifying a second set of one or more data elements includes:
determining whether one or more of the one or more data elements of the first set include one or more references to one or more other data elements, and
identifying a second set of one or more data elements based on the references.
11. The method of claim 1, wherein identifying a second set of data elements includes:
determining whether one or more data elements in the database include one or more references to the data elements of the first set, and
identifying a second set of one or more data elements based on the references.
12. The method of claim 1, further comprising:
providing the generated data to one or more of a user and a display.
13. The method of claim 1, further comprising:
graphically displaying the data elements of the first and second sets and the relationships therebetween.
14. The method of claim 13, further comprising:
receiving from the user a selection of a data element, and
based on the selection, graphically displaying the contents of the data element.
15. The method of claim 13, wherein the data elements are represented by geometric shapes and wherein the relationships are represented by lines between geometric shapes.
16. The method of claim 15, further comprising:
determining locations at which to display the geometric shapes and the lines to reduce overlaps between geometric shapes and crossings between lines.
17. A method of displaying data, the method comprising:
generating a search query to identify a first set of one or more patent publications in a database,
based on the first set, identifying a second set of one or more patent publications in the database, the patent publications of the second set being cited by one or more of the patent publications of the first set, and
graphically displaying the patent publications of the first and second sets and citation relationships therebetween.
18. The method of claim 17, wherein the patent publications include one or more of issued patents and published patent applications.
19. The method of claim 17, wherein the search query includes one or more of an assignee, a class, a filing date, an inventor, an issue date, a subclass, and a title.
20. The method of claim 17, wherein graphically displaying includes:
graphically displaying the patent publications of the first and second sets and the citation relationships therebetween in a display including a time axis.
21. The method of claim 17, further comprising:
based on the first and second sets, identifying a third set of one or more patent publications in the database, the patent publications of the third set citing one or more of: the patent publications of the first set and the patent publications of the second set, and
wherein graphically displaying includes:
graphically displaying the patent publications of the first, second, and third sets and the citation relationships therebetween.
22. The method of claim 17, wherein the patent publications are represented by geometric shapes and wherein the citation relationships are represented by lines between geometric shapes.
23. The method of claim 22, further comprising:
determining locations at which to display the geometric shapes and the lines to reduce overlaps between geometric shapes and crossings between lines.
24. The method of claim 17, further comprising:
based on graphically displaying the patent publications of the first and second sets and the citation relationships therebetween, identifying one or more candidate patent publications for one or more of: invalidating prior art, licensing opportunities, and seminal prior art.
25. The method of claim 24, wherein candidate patent publications for invalidating prior art include patent publications that are not cited by an alleged infringed patent, that cite one or more patent publications cited by the alleged infringed patent, and that are associated with earlier filing dates than the alleged infringed patent.
26. The method of claim 24, wherein candidate patent publications for licensing opportunities include patent publications that are associated with a first assignee and that are cited by one or more patent publications associated with one or more second different assignees.
27. The method of claim 24, wherein candidate patent publications for seminal prior art include patent publications that cite a first number of patent publications and that are cited by a second number of patent publications wherein the second number is greater than the first number.
28. A processor program for searching a database of data elements, the processor program being stored on a processor readable medium and including instructions operable to cause a processor to:
generate a search query to identify a first set of one or more data elements in the database,
based on the first set, identify a second set of one or more data elements in the database, where the data elements of the second set are related to one or more of the data elements of the first set, and
generate data based on the data elements of the first and second sets and the relationships therebetween.
29. The processor program of claim 28, wherein the data elements of the second set are related to one or more of the data elements of the first set based on time.
30. The processor program of claim 28, wherein the data elements of the second set are related to one or more of the data elements of the first set based on one or more references.
31. The processor program of claim 30, wherein the references are based on the content of one or more of the data elements of the first set and the data elements of the second set.
32. The processor program of claim 30, wherein the references include one or more of citations and HTML links.
33. The processor program of claim 28, further comprising instructions to:
provide the generated data to one or more of a user and a display.
34. The processor program of claim 28, further comprising instructions to:
graphically display the data elements of the first and second sets and the relationships therebetween.
35. The processor program of claim 34, wherein the data elements are represented by geometric shapes and wherein the relationships are represented by lines between geometric shapes.
36. The processor program of claim 35, further comprising instructions to:
determine locations at which to display the geometric shapes and the lines to reduce overlaps between geometric shapes and crossings between lines.
37. A processor program for displaying data, the processor program being stored on a processor readable medium and comprising instructions operable to cause a processor to:
generate a search query to identify a first set of one or more patent publications in a database,
based on the first set, identify a second set of one or more patent publications in the database, the patent publications of the second set being cited by one or more of the patent publications of the first set, and
graphically display the patent publications of the first and second sets and citation relationships therebetween.
38. The processor program of claim 37, wherein the patent publications include one or more of issued patents and published patent applications.
39. The processor program of claim 37, further comprising instructions to:
based on the first and second sets, identify a third set of one or more patent publications in the database, the patent publications of the third set citing one or more of: the patent publications of the first set and the patent publications of the second set, and
wherein the instructions to graphically display include instructions to:
graphically display the patent publications of the first, second, and third sets and the citation relationships therebetween.
40. The processor program of claim 37, wherein the patent publications are represented by geometric shapes and wherein the citation relationships are represented by lines between geometric shapes.
41. The processor program of claim 40, further comprising instructions to:
determine locations at which to display the geometric shapes and the lines to reduce overlaps between geometric shapes and crossings between lines.
US11/611,816 1998-12-04 2006-12-15 Systems and methods for organizing data Abandoned US20070174254A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US11/611,816 US20070174254A1 (en) 1998-12-04 2006-12-15 Systems and methods for organizing data

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US11111298P 1998-12-04 1998-12-04
US11111198P 1998-12-04 1998-12-04
US45445799A 1999-12-03 1999-12-03
US09/645,626 US6604114B1 (en) 1998-12-04 2000-08-24 Systems and methods for organizing data
US11/611,816 US20070174254A1 (en) 1998-12-04 2006-12-15 Systems and methods for organizing data

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09/645,626 Continuation US6604114B1 (en) 1998-12-04 2000-08-24 Systems and methods for organizing data

Publications (1)

Publication Number Publication Date
US20070174254A1 true US20070174254A1 (en) 2007-07-26

Family

ID=26808645

Family Applications (3)

Application Number Title Priority Date Filing Date
US09/645,626 Expired - Fee Related US6604114B1 (en) 1998-12-04 2000-08-24 Systems and methods for organizing data
US10/624,326 Expired - Fee Related US7171405B2 (en) 1998-12-04 2003-07-22 Systems and methods for organizing data
US11/611,816 Abandoned US20070174254A1 (en) 1998-12-04 2006-12-15 Systems and methods for organizing data

Family Applications Before (2)

Application Number Title Priority Date Filing Date
US09/645,626 Expired - Fee Related US6604114B1 (en) 1998-12-04 2000-08-24 Systems and methods for organizing data
US10/624,326 Expired - Fee Related US7171405B2 (en) 1998-12-04 2003-07-22 Systems and methods for organizing data

Country Status (5)

Country Link
US (3) US6604114B1 (en)
EP (1) EP1129417A4 (en)
JP (1) JP2002532788A (en)
AU (1) AU3109200A (en)
WO (1) WO2000034896A1 (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080281769A1 (en) * 2007-05-10 2008-11-13 Jason Hibbets Systems and methods for community tagging
US20080301091A1 (en) * 2007-05-31 2008-12-04 Hibbets Jason S Systems and methods for improved forums
US20080301115A1 (en) * 2007-05-31 2008-12-04 Mattox John R Systems and methods for directed forums
US20080306932A1 (en) * 2007-06-07 2008-12-11 Norman Lee Faus Systems and methods for a rating system
US20090063386A1 (en) * 2007-08-27 2009-03-05 Hibbets Jason S Systems and methods for linking an issue with an entry in a knowledgebase
US20090094211A1 (en) * 2007-10-05 2009-04-09 Fujitsu Limited Implementing an expanded search and providing expanded search results
US20090094210A1 (en) * 2007-10-05 2009-04-09 Fujitsu Limited Intelligently sorted search results
US20120265773A1 (en) * 2011-04-12 2012-10-18 Microsoft Corporation Query-based diagrammatic presentation of data
US8504579B1 (en) * 2010-04-23 2013-08-06 Crimson Corporation Filtering a data set using trees on a computing device
US8982129B1 (en) * 2010-04-23 2015-03-17 Crimson Corporation Mapping graph data to a tree structure on a computing device
CN106599005A (en) * 2015-10-20 2017-04-26 阿里巴巴集团控股有限公司 Data archiving method and device
US11327941B2 (en) * 2018-05-02 2022-05-10 Flexera Software Llc Standardized graph-based framework for determining a license position of an enterprise computer system

Families Citing this family (159)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6918096B2 (en) * 1996-11-07 2005-07-12 Thebrain Technologies, Corp. Method and apparatus for displaying a network of thoughts from a thought's perspective
WO2000034896A1 (en) * 1998-12-04 2000-06-15 Technology Enabling Company, Llc Systems and methods for organizing data
US20090077020A9 (en) * 1998-12-04 2009-03-19 Toong Hoo-Min Systems and methods of searching databases
US6714936B1 (en) * 1999-05-25 2004-03-30 Nevin, Iii Rocky Harry W. Method and apparatus for displaying data stored in linked nodes
US7181438B1 (en) * 1999-07-21 2007-02-20 Alberti Anemometer, Llc Database access system
US6970844B1 (en) 1999-08-27 2005-11-29 Computer Sciences Corporation Flow designer for establishing and maintaining assignment and strategy process maps
US6961708B1 (en) 1999-08-27 2005-11-01 Computer Sciences Corporation External interface for requesting data from remote systems in a generic fashion
US6922682B1 (en) * 1999-10-12 2005-07-26 Aprisa, Inc. Method and system for engineering discovery
US7526487B1 (en) * 1999-10-29 2009-04-28 Computer Sciences Corporation Business transaction processing systems and methods
US8606588B1 (en) 1999-11-23 2013-12-10 Accenture Global Services Limited Merger and acquisition knowledgebase
US6868525B1 (en) * 2000-02-01 2005-03-15 Alberti Anemometer Llc Computer graphic display visualization system and method
US7206751B2 (en) * 2000-03-23 2007-04-17 Sap Ag Value chain optimization system and method
US7280973B1 (en) * 2000-03-23 2007-10-09 Sap Ag Value chain optimization system and method
US7660869B1 (en) * 2000-08-21 2010-02-09 Vignette Software, LLC Network real estate analysis
CA2361022A1 (en) * 2000-11-03 2002-05-03 Charles Allan Armstrong Knowledge management system
US7213069B2 (en) * 2001-02-28 2007-05-01 Microsoft Corporation Category name service able to override the category name based on requestor privilege information
US6985950B1 (en) 2001-03-06 2006-01-10 Microsoft Corporation System for creating a space-efficient document categorizer for training and testing of automatic categorization engines
US6826576B2 (en) * 2001-05-07 2004-11-30 Microsoft Corporation Very-large-scale automatic categorizer for web content
US6938025B1 (en) 2001-05-07 2005-08-30 Microsoft Corporation Method and apparatus for automatically determining salient features for object classification
US6978266B2 (en) * 2001-05-07 2005-12-20 Microsoft Corporation Determining a rating for a collection of documents
US8041739B2 (en) * 2001-08-31 2011-10-18 Jinan Glasgow Automated system and method for patent drafting and technology assessment
US8473922B2 (en) * 2001-09-19 2013-06-25 Hewlett-Packard Development Company, L.P. Runtime monitoring in component-based systems
US20030225763A1 (en) * 2002-04-15 2003-12-04 Microsoft Corporation Self-improving system and method for classifying pages on the world wide web
US20040002959A1 (en) * 2002-06-26 2004-01-01 International Business Machines Corporation Method and system for providing context sensitive support for data processing device user search requests
US20060224999A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical visualization of data product using browser
US20060224980A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Method of creating graphical visualizations of data with a browser
US20080068401A1 (en) * 2006-09-14 2008-03-20 Technology Enabling Company, Llc Browser creation of graphic depicting relationships
US20060224975A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht System for creating a graphical application interface with a browser
US20060224972A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical application interface with a browser
US20060224973A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Method of using a browser
US8316001B1 (en) 2002-07-22 2012-11-20 Ipvision, Inc. Apparatus and method for performing analyses on data derived from a web-based search engine
US20060224976A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical application interface product
US20060224978A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht System for creating a graphical application interface
US20060224984A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Apparatus for creating graphical visualization of data with a browser
US20060224974A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Method of creating graphical application interface with a browser
US20060224983A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical visualization of data using browser
US20080134060A1 (en) * 2005-04-01 2008-06-05 Paul Albrecht System for creating a graphical visualization of data with a browser
US20060225000A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical application interface using browser
US7263517B2 (en) * 2002-10-31 2007-08-28 Biomedical Objects, Inc. Structured natural language query and knowledge system
JP2004213616A (en) * 2002-12-16 2004-07-29 Konica Minolta Holdings Inc Data management structure rewriting program
US20040122841A1 (en) * 2002-12-19 2004-06-24 Ford Motor Company Method and system for evaluating intellectual property
US8121955B2 (en) 2003-01-16 2012-02-21 Oracle America, Inc. Signing program data payload sequence in program loading
US7484095B2 (en) * 2003-01-16 2009-01-27 Sun Microsystems, Inc. System for communicating program data between a first device and a second device
US7281244B2 (en) * 2003-01-16 2007-10-09 Sun Microsystems, Inc. Using a digital fingerprint to commit loaded data in a device
US7222331B2 (en) * 2003-01-16 2007-05-22 Sun Microsystems, Inc. Linking of virtual methods
US7272830B2 (en) * 2003-01-16 2007-09-18 Sun Microsystems, Inc. Ordering program data for loading on a device
US20040143739A1 (en) * 2003-01-16 2004-07-22 Sun Mircosystems, Inc., A Delaware Corporation Run time code integrity checks
US7165246B2 (en) * 2003-01-16 2007-01-16 Sun Microsystems, Inc. Optimized representation of data type information in program verification
JP4199026B2 (en) * 2003-03-03 2008-12-17 富士通株式会社 Information relevance display method, program, storage medium, and apparatus
US6961733B2 (en) 2003-03-10 2005-11-01 Unisys Corporation System and method for storing and accessing data in an interlocking trees datastore
GB0310371D0 (en) * 2003-05-07 2003-06-11 Salemander Organization The Lt Method and system for performance analysis for a service provided to or in an organisation
US20050010559A1 (en) * 2003-07-10 2005-01-13 Joseph Du Methods for information search and citation search
US7318199B2 (en) * 2003-09-11 2008-01-08 Oracle International Corporation Algorithm for automatic layout of objects in a database
US8516004B2 (en) * 2003-09-19 2013-08-20 Unisys Corporation Method for processing K node count fields using an intensity variable
US20060101018A1 (en) 2004-11-08 2006-05-11 Mazzagatti Jane C Method for processing new sequences being recorded into an interlocking trees datastore
US20050171760A1 (en) * 2003-10-08 2005-08-04 Marc Tinkler Visual thesaurus
US8694419B2 (en) * 2003-11-18 2014-04-08 Ocean Tomo, Llc Methods and systems for utilizing intellectual property assets and rights
US7340471B2 (en) 2004-01-16 2008-03-04 Unisys Corporation Saving and restoring an interlocking trees datastore
US7292245B2 (en) * 2004-01-20 2007-11-06 Sensitron, Inc. Method and apparatus for time series graph display
US20050182755A1 (en) * 2004-02-14 2005-08-18 Bao Tran Systems and methods for analyzing documents over a network
EP1759280A4 (en) * 2004-05-04 2009-08-26 Boston Consulting Group Inc Method and apparatus for selecting, analyzing and visualizing related database records as a network
CN101095131A (en) * 2004-05-28 2007-12-26 约翰·戈尔齐 Systems, methods, and graphical tools for representing connectedness of individuals
WO2005119502A2 (en) * 2004-05-28 2005-12-15 John Golze Systems, methods, and graphical tools for representing connectedness of individuals
US7593923B1 (en) 2004-06-29 2009-09-22 Unisys Corporation Functional operations for accessing and/or building interlocking trees datastores to enable their use with applications software
US7433884B2 (en) * 2004-09-29 2008-10-07 Chi Research, Inc. Identification of licensing targets using citation neighbor search process
US7213041B2 (en) * 2004-10-05 2007-05-01 Unisys Corporation Saving and restoring an interlocking trees datastore
US7716241B1 (en) 2004-10-27 2010-05-11 Unisys Corporation Storing the repository origin of data inputs within a knowledge store
US7908240B1 (en) 2004-10-28 2011-03-15 Unisys Corporation Facilitated use of column and field data for field record universe in a knowledge store
US7499932B2 (en) * 2004-11-08 2009-03-03 Unisys Corporation Accessing data in an interlocking trees data structure using an application programming interface
US20070162508A1 (en) * 2004-11-08 2007-07-12 Mazzagatti Jane C Updating information in an interlocking trees datastore
US7676477B1 (en) 2005-10-24 2010-03-09 Unisys Corporation Utilities for deriving values and information from within an interlocking trees data store
US7348980B2 (en) 2004-11-08 2008-03-25 Unisys Corporation Method and apparatus for interface for graphic display of data from a Kstore
US7536312B2 (en) * 2005-01-26 2009-05-19 Ocean Tomo, Llc Method of appraising and insuring intellectual property
US7409380B1 (en) 2005-04-07 2008-08-05 Unisys Corporation Facilitated reuse of K locations in a knowledge store
WO2006110832A2 (en) * 2005-04-12 2006-10-19 Jesse Sukman System for extracting relevant data from an intellectual property database
US9110985B2 (en) * 2005-05-10 2015-08-18 Neetseer, Inc. Generating a conceptual association graph from large-scale loosely-grouped content
US7958120B2 (en) 2005-05-10 2011-06-07 Netseer, Inc. Method and apparatus for distributed community finding
WO2006128183A2 (en) 2005-05-27 2006-11-30 Schwegman, Lundberg, Woessner & Kluth, P.A. Method and apparatus for cross-referencing important ip relationships
US7389301B1 (en) 2005-06-10 2008-06-17 Unisys Corporation Data aggregation user interface and analytic adapted for a KStore
JP4670496B2 (en) * 2005-06-14 2011-04-13 住友電気工業株式会社 Optical receiver
US7716226B2 (en) 2005-09-27 2010-05-11 Patentratings, Llc Method and system for probabilistically quantifying and visualizing relevance between two or more citationally or contextually related data objects
US7890510B2 (en) * 2005-10-05 2011-02-15 International Business Machines Corporation Method and apparatus for analyzing community evolution in graph data streams
EP1949283B1 (en) * 2005-11-10 2018-07-11 Koninklijke Philips N.V. Decision support system with embedded clinical guidelines
US20070112833A1 (en) * 2005-11-17 2007-05-17 International Business Machines Corporation System and method for annotating patents with MeSH data
US9495349B2 (en) * 2005-11-17 2016-11-15 International Business Machines Corporation System and method for using text analytics to identify a set of related documents from a source document
WO2007084778A2 (en) 2006-01-19 2007-07-26 Llial, Inc. Systems and methods for creating, navigating and searching informational web neighborhoods
US8843434B2 (en) * 2006-02-28 2014-09-23 Netseer, Inc. Methods and apparatus for visualizing, managing, monetizing, and personalizing knowledge search results on a user interface
US20070214153A1 (en) * 2006-03-10 2007-09-13 Mazzagatti Jane C Method for processing an input particle stream for creating upper levels of KStore
US7734571B2 (en) * 2006-03-20 2010-06-08 Unisys Corporation Method for processing sensor data within a particle stream by a KStore
US20080275842A1 (en) * 2006-03-20 2008-11-06 Jane Campbell Mazzagatti Method for processing counts when an end node is encountered
US20070220069A1 (en) * 2006-03-20 2007-09-20 Mazzagatti Jane C Method for processing an input particle stream for creating lower levels of a KStore
US7689571B1 (en) 2006-03-24 2010-03-30 Unisys Corporation Optimizing the size of an interlocking tree datastore structure for KStore
US8238351B2 (en) * 2006-04-04 2012-08-07 Unisys Corporation Method for determining a most probable K location
US9959582B2 (en) 2006-04-12 2018-05-01 ClearstoneIP Intellectual property information retrieval
US20070271286A1 (en) * 2006-05-16 2007-11-22 Khemdut Purang Dimensionality reduction for content category data
US9330170B2 (en) * 2006-05-16 2016-05-03 Sony Corporation Relating objects in different mediums
US7774288B2 (en) * 2006-05-16 2010-08-10 Sony Corporation Clustering and classification of multimedia data
US7961189B2 (en) * 2006-05-16 2011-06-14 Sony Corporation Displaying artists related to an artist of interest
US7676330B1 (en) 2006-05-16 2010-03-09 Unisys Corporation Method for processing a particle using a sensor structure
US7840568B2 (en) * 2006-05-16 2010-11-23 Sony Corporation Sorting media objects by similarity
US7750909B2 (en) * 2006-05-16 2010-07-06 Sony Corporation Ordering artists by overall degree of influence
EP1860578A1 (en) * 2006-05-22 2007-11-28 Caterpillar Inc. System for analyzing patents
US20070288256A1 (en) * 2006-06-07 2007-12-13 Speier Gary J Patent claim reference generation
US20080005103A1 (en) * 2006-06-08 2008-01-03 Invequity, Llc Intellectual property search, marketing and licensing connection system and method
US20080016029A1 (en) * 2006-07-11 2008-01-17 Mariam John Optimizing a query to a database
JP4893741B2 (en) * 2006-08-09 2012-03-07 富士通株式会社 Business flowchart editing program and business flowchart editing method
EP3493074A1 (en) 2006-10-05 2019-06-05 Splunk Inc. Time series search engine
US20080108027A1 (en) * 2006-10-20 2008-05-08 Sallin Matthew D Graphical radially-extending family hedge
US9817902B2 (en) * 2006-10-27 2017-11-14 Netseer Acquisition, Inc. Methods and apparatus for matching relevant content to user intention
US8021163B2 (en) * 2006-10-31 2011-09-20 Hewlett-Packard Development Company, L.P. Skill-set identification
US20100017391A1 (en) * 2006-12-18 2010-01-21 Nec Corporation Polarity estimation system, information delivery system, polarity estimation method, polarity estimation program and evaluation polarity estimatiom program
US8335998B1 (en) 2006-12-29 2012-12-18 Global Prior Art, Inc. Interactive global map
US20080243588A1 (en) * 2007-04-02 2008-10-02 Warehouse Products Testing, Inc. System and method for calculating new product first year net margin contribution
US9129243B2 (en) * 2007-06-01 2015-09-08 The Boeing Company Apparatus and methods for strategic planning by utilizing roadmapping
US20080312939A1 (en) * 2007-06-13 2008-12-18 Mdb Capital Group, Llc Automated Identification of Employment History
CN101334771A (en) * 2007-06-28 2008-12-31 冠亚智财股份有限公司 Correlation screening system and method for patent constituted element combination
US20090018879A1 (en) * 2007-07-13 2009-01-15 David Bernard Flaxer Method and system supporting business solution validation in a component business model
US20090210272A1 (en) * 2008-01-31 2009-08-20 Mark Rubin Methods & systems for energy, information, and business systems modeling
US9082080B2 (en) * 2008-03-05 2015-07-14 Kofax, Inc. Systems and methods for organizing data sets
US20090248722A1 (en) * 2008-03-27 2009-10-01 International Business Machines Corporation Clustering analytic functions
US9363143B2 (en) 2008-03-27 2016-06-07 International Business Machines Corporation Selective computation using analytic functions
US8051068B2 (en) * 2008-04-21 2011-11-01 Yahoo! Inc. Trail-based exploration of a repository of documents
US10387892B2 (en) 2008-05-06 2019-08-20 Netseer, Inc. Discovering relevant concept and context for content node
US20090300009A1 (en) * 2008-05-30 2009-12-03 Netseer, Inc. Behavioral Targeting For Tracking, Aggregating, And Predicting Online Behavior
US20100131513A1 (en) * 2008-10-23 2010-05-27 Lundberg Steven W Patent mapping
US8229775B2 (en) 2008-11-06 2012-07-24 International Business Machines Corporation Processing of provenance data for automatic discovery of enterprise process information
US9053437B2 (en) 2008-11-06 2015-06-09 International Business Machines Corporation Extracting enterprise information through analysis of provenance data
US8209204B2 (en) 2008-11-06 2012-06-26 International Business Machines Corporation Influencing behavior of enterprise operations during process enactment using provenance data
US9336304B2 (en) * 2008-11-10 2016-05-10 Gary J. Speier Patent analytics system
KR101047108B1 (en) * 2008-11-19 2011-07-06 한국과학기술정보연구원 Core literature extraction and visualization system and method using citation network
US20110040555A1 (en) * 2009-07-21 2011-02-17 Wegner Peter Juergen System and method for creating and playing timed, artistic multimedia representations of typed, spoken, or loaded narratives, theatrical scripts, dialogues, lyrics, or other linguistic texts
US8463789B1 (en) * 2010-03-23 2013-06-11 Firstrain, Inc. Event detection
US20110242108A1 (en) * 2010-03-31 2011-10-06 Microsoft Corporation Visualization of complexly related data
US8639695B1 (en) 2010-07-08 2014-01-28 Patent Analytics Holding Pty Ltd System, method and computer program for analysing and visualising data
AU2010202901B2 (en) 2010-07-08 2016-04-14 Patent Analytics Holding Pty Ltd A system, method and computer program for preparing data for analysis
US8874566B2 (en) * 2010-09-09 2014-10-28 Disney Enterprises, Inc. Online content ranking system based on authenticity metric values for web elements
US8560544B2 (en) 2010-09-15 2013-10-15 International Business Machines Corporation Clustering of analytic functions
US9904726B2 (en) 2011-05-04 2018-02-27 Black Hills IP Holdings, LLC. Apparatus and method for automated and assisted patent claim mapping and expense planning
JP5830784B2 (en) * 2011-06-23 2015-12-09 サイバーアイ・エンタテインメント株式会社 Interest graph collection system by relevance search with image recognition system
US8423575B1 (en) 2011-09-29 2013-04-16 International Business Machines Corporation Presenting information from heterogeneous and distributed data sources with real time updates
US9940363B2 (en) 2011-10-03 2018-04-10 Black Hills Ip Holdings, Llc Systems, methods and user interfaces in a patent management system
US9721039B2 (en) * 2011-12-16 2017-08-01 Palo Alto Research Center Incorporated Generating a relationship visualization for nonhomogeneous entities
US8965829B2 (en) * 2012-02-09 2015-02-24 Jeffrey L. Pattillo System and method for making decisions using network-guided decision trees with multivariate splits
US10311085B2 (en) 2012-08-31 2019-06-04 Netseer, Inc. Concept-level user intent profile extraction and applications
US10353957B2 (en) 2013-04-30 2019-07-16 Splunk Inc. Processing of performance data and raw log data from an information technology environment
US10019496B2 (en) 2013-04-30 2018-07-10 Splunk Inc. Processing of performance data and log data from an information technology environment by using diverse data stores
US10318541B2 (en) 2013-04-30 2019-06-11 Splunk Inc. Correlating log data with performance measurements having a specified relationship to a threshold value
US10346357B2 (en) 2013-04-30 2019-07-09 Splunk Inc. Processing of performance data and structure data from an information technology environment
US10614132B2 (en) 2013-04-30 2020-04-07 Splunk Inc. GUI-triggered processing of performance data and log data from an information technology environment
US10225136B2 (en) 2013-04-30 2019-03-05 Splunk Inc. Processing of log data and performance data obtained via an application programming interface (API)
US10997191B2 (en) 2013-04-30 2021-05-04 Splunk Inc. Query-triggered processing of performance data and log data from an information technology environment
US10303706B2 (en) * 2013-11-27 2019-05-28 William Scott Harten Condensed hierarchical data viewer
US9477477B2 (en) 2014-01-22 2016-10-25 Nvidia Corporation System, method, and computer program product for executing casting-arithmetic instructions
US9235392B2 (en) * 2014-01-22 2016-01-12 Nvidia Corporation System, method, and computer program product for improved power efficiency during program code execution
US9685142B2 (en) * 2015-11-03 2017-06-20 International Business Machines Corporation Obtaining and displaying relationships between elements
US10474996B2 (en) * 2016-12-06 2019-11-12 Sap Se Workflow management system platform
US10380214B1 (en) * 2018-02-07 2019-08-13 Sas Institute Inc. Identification and visualization of data set relationships in online library systems
KR102251588B1 (en) * 2019-06-12 2021-05-13 카페24 주식회사 Method, apparatus, and system visualizing correlation level between setup fields
US11847169B2 (en) * 2020-12-18 2023-12-19 Shanghai Henghui Intellectual Property Service Co., Ltd. Method for data processing and interactive information exchange with feature data extraction and bidirectional value evaluation for technology transfer and computer used therein

Citations (65)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3916387A (en) * 1971-04-23 1975-10-28 Ibm Directory searching method and means
US5790853A (en) * 1994-12-22 1998-08-04 Fuji Xerox Co., Ltd. Workspace management apparatus
US5802256A (en) * 1994-05-09 1998-09-01 Microsoft Corporation Generating improved belief networks
US5808615A (en) * 1996-05-01 1998-09-15 Electronic Data Systems Corporation Process and system for mapping the relationship of the content of a collection of documents
US5870770A (en) * 1995-06-07 1999-02-09 Wolfe; Mark A. Document research system and method for displaying citing documents
US5918232A (en) * 1997-11-26 1999-06-29 Whitelight Systems, Inc. Multidimensional domain modeling method and system
US5960399A (en) * 1996-12-24 1999-09-28 Gte Internetworking Incorporated Client/server speech processor/recognizer
US5991751A (en) * 1997-06-02 1999-11-23 Smartpatents, Inc. System, method, and computer program product for patent-centric and group-oriented data processing
US5991782A (en) * 1994-02-18 1999-11-23 Fujitsu Limited Automated extraction and doubly linked reference marks for partialized document contents and version control
US6038574A (en) * 1998-03-18 2000-03-14 Xerox Corporation Method and apparatus for clustering a collection of linked documents using co-citation analysis
US6144962A (en) * 1996-10-15 2000-11-07 Mercury Interactive Corporation Visualization of web sites and hierarchical data structures
US6175824B1 (en) * 1999-07-14 2001-01-16 Chi Research, Inc. Method and apparatus for choosing a stock portfolio, based on patent indicators
US6256648B1 (en) * 1998-01-29 2001-07-03 At&T Corp. System and method for selecting and displaying hyperlinked information resources
US6286018B1 (en) * 1998-03-18 2001-09-04 Xerox Corporation Method and apparatus for finding a set of documents relevant to a focus set using citation analysis and spreading activation techniques
US6285999B1 (en) * 1997-01-10 2001-09-04 The Board Of Trustees Of The Leland Stanford Junior University Method for node ranking in a linked database
US6289342B1 (en) * 1998-01-05 2001-09-11 Nec Research Institute, Inc. Autonomous citation indexing and literature browsing using citation context
US20010027452A1 (en) * 2000-02-01 2001-10-04 Tropper Matthew Bruce System and method to identify documents in a database which relate to a given document by using recursive searching and no keywords
US6339767B1 (en) * 1997-06-02 2002-01-15 Aurigin Systems, Inc. Using hyperbolic trees to visualize data generated by patent-centric and group-oriented data processing
US20020023077A1 (en) * 2000-06-09 2002-02-21 Nguyen Thanh Ngoc Method and apparatus for data collection and knowledge management
US6351746B1 (en) * 1998-11-09 2002-02-26 Unisys Corporation Cool ice icons
US20020035499A1 (en) * 1999-03-02 2002-03-21 Germeraad Paul B. Patent-related tools and methodology for use in the merger and acquisition process
US6378780B1 (en) * 1999-02-09 2002-04-30 S. C. Johnson & Son, Inc. Delivery system for dispensing volatiles
US6457028B1 (en) * 1998-03-18 2002-09-24 Xerox Corporation Method and apparatus for finding related collections of linked documents using co-citation analysis
US6476828B1 (en) * 1999-05-28 2002-11-05 International Business Machines Corporation Systems, methods and computer program products for building and displaying dynamic graphical user interfaces
US20020167543A1 (en) * 1999-02-01 2002-11-14 Jeffrey A. Smith User interface method and system for application programs implemented with component architectures
US20020174271A1 (en) * 2001-05-16 2002-11-21 Tetsuroh Tanigawa Publication confirming method, publication information acquisition apparatus, publication information providing apparatus and database
US20030001873A1 (en) * 2001-05-08 2003-01-02 Eugene Garfield Process for creating and displaying a publication historiograph
US20030033295A1 (en) * 2001-07-11 2003-02-13 Adler Marc Stephen Method for analyzing and recording innovations
US20030074351A1 (en) * 2001-10-01 2003-04-17 Van Stegeren Eric D.F.D. System and method for generating a work set of patents or other documents
US6604114B1 (en) * 1998-12-04 2003-08-05 Technology Enabling Company, Llc Systems and methods for organizing data
US20030172020A1 (en) * 2001-11-19 2003-09-11 Davies Nigel Paul Integrated intellectual asset management system and method
US20030229470A1 (en) * 2002-06-10 2003-12-11 Nenad Pejic System and method for analyzing patent-related information
US6674450B1 (en) * 2000-04-14 2004-01-06 Trilogy Development Group, Inc. Interactive data-bound control
US20040015481A1 (en) * 2002-05-23 2004-01-22 Kenneth Zinda Patent data mining
US6701524B1 (en) * 1996-05-30 2004-03-02 Matsushita Electric Industrial Co., Ltd. Interactive data transmitting apparatus, data receiving apparatus, data receiving method, recording medium for recording receiving program thereof, and communication system using a broadcast wave
US20040093561A1 (en) * 2002-11-08 2004-05-13 Chien-Fa Yeh System and method for displaying patent classification information
US20040103112A1 (en) * 1999-10-08 2004-05-27 Colson Thomas J. Computer based method and apparatus for mining and displaying patent data
US20040123235A1 (en) * 2002-12-20 2004-06-24 Chien-Fa Yeh System and method for displaying and updating patent citation information
US20040133433A1 (en) * 2001-08-01 2004-07-08 Young-Gyun Lee Method for analyzing and providing of inter-relations between patents from the patent database
US20040148375A1 (en) * 2001-02-12 2004-07-29 Levett David Lawrence Presentation service which enables client device to run a network based application
US20040181427A1 (en) * 1999-02-05 2004-09-16 Stobbs Gregory A. Computer-implemented patent portfolio analysis method and apparatus
US20040201618A1 (en) * 2001-06-12 2004-10-14 Ian Alderson Streaming of real-time data to a browser
US6868528B2 (en) * 2001-06-15 2005-03-15 Microsoft Corporation Systems and methods for creating and displaying a user interface for displaying hierarchical data
US6879990B1 (en) * 2000-04-28 2005-04-12 Institute For Scientific Information, Inc. System for identifying potential licensees of a source patent portfolio
US20050182755A1 (en) * 2004-02-14 2005-08-18 Bao Tran Systems and methods for analyzing documents over a network
US20050192968A1 (en) * 2003-12-08 2005-09-01 Beretich Guy R.Jr. Methods and systems for technology analysis and mapping
US20050210008A1 (en) * 2004-03-18 2005-09-22 Bao Tran Systems and methods for analyzing documents over a network
US6952806B1 (en) * 2000-01-21 2005-10-04 Xerox Corporation Medium containing information gathered from material including a source and interface for graphically displaying the information
US20050270311A1 (en) * 2004-03-23 2005-12-08 Rasmussen Jens E Digital mapping system
US7019741B2 (en) * 2001-03-23 2006-03-28 General Electric Company Methods and systems for simulating animation of web-based data files
US20060074867A1 (en) * 2004-09-29 2006-04-06 Anthony Breitzman Identification of licensing targets using citation neighbor search process
US7050056B2 (en) * 2002-12-20 2006-05-23 Sap Aktiengesellschaft Interactive and web-based Gantt Chart
US7080325B2 (en) * 2002-02-22 2006-07-18 Call-Tell Llc Graphical device for comprehensive viewing and input of variable data via a browser-based display
US7117198B1 (en) * 2000-11-28 2006-10-03 Ip Capital Group, Inc. Method of researching and analyzing information contained in a database
US20060224975A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht System for creating a graphical application interface with a browser
US20060224972A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical application interface with a browser
US20060224980A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Method of creating graphical visualizations of data with a browser
US20060225000A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical application interface using browser
US20060224999A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical visualization of data product using browser
US20060224974A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Method of creating graphical application interface with a browser
US20060224984A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Apparatus for creating graphical visualization of data with a browser
US20060224983A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical visualization of data using browser
US20060224982A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical application interface product using a browser
US7231386B2 (en) * 2001-03-30 2007-06-12 Kabushiki Kaisha Toshiba Apparatus, method, and program for retrieving structured documents
US20080134060A1 (en) * 2005-04-01 2008-06-05 Paul Albrecht System for creating a graphical visualization of data with a browser

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5916232A (en) * 1997-10-10 1999-06-29 Applied Medical Resources Corporation Asymmetrical obturator

Patent Citations (75)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3916387A (en) * 1971-04-23 1975-10-28 Ibm Directory searching method and means
US5991782A (en) * 1994-02-18 1999-11-23 Fujitsu Limited Automated extraction and doubly linked reference marks for partialized document contents and version control
US5802256A (en) * 1994-05-09 1998-09-01 Microsoft Corporation Generating improved belief networks
US5790853A (en) * 1994-12-22 1998-08-04 Fuji Xerox Co., Ltd. Workspace management apparatus
US6263351B1 (en) * 1995-06-07 2001-07-17 Mark A. Wolfe Document research system and method for efficiently displaying and researching information about the interrelationships between documents
US5870770A (en) * 1995-06-07 1999-02-09 Wolfe; Mark A. Document research system and method for displaying citing documents
US5808615A (en) * 1996-05-01 1998-09-15 Electronic Data Systems Corporation Process and system for mapping the relationship of the content of a collection of documents
US6701524B1 (en) * 1996-05-30 2004-03-02 Matsushita Electric Industrial Co., Ltd. Interactive data transmitting apparatus, data receiving apparatus, data receiving method, recording medium for recording receiving program thereof, and communication system using a broadcast wave
US6144962A (en) * 1996-10-15 2000-11-07 Mercury Interactive Corporation Visualization of web sites and hierarchical data structures
US5960399A (en) * 1996-12-24 1999-09-28 Gte Internetworking Incorporated Client/server speech processor/recognizer
US6285999B1 (en) * 1997-01-10 2001-09-04 The Board Of Trustees Of The Leland Stanford Junior University Method for node ranking in a linked database
US6799176B1 (en) * 1997-01-10 2004-09-28 The Board Of Trustees Of The Leland Stanford Junior University Method for scoring documents in a linked database
US5991751A (en) * 1997-06-02 1999-11-23 Smartpatents, Inc. System, method, and computer program product for patent-centric and group-oriented data processing
US20020007373A1 (en) * 1997-06-02 2002-01-17 Blair Tim W. System, method, and computer program product for knowledge management
US6499026B1 (en) * 1997-06-02 2002-12-24 Aurigin Systems, Inc. Using hyperbolic trees to visualize data generated by patent-centric and group-oriented data processing
US6339767B1 (en) * 1997-06-02 2002-01-15 Aurigin Systems, Inc. Using hyperbolic trees to visualize data generated by patent-centric and group-oriented data processing
US5918232A (en) * 1997-11-26 1999-06-29 Whitelight Systems, Inc. Multidimensional domain modeling method and system
US20020156760A1 (en) * 1998-01-05 2002-10-24 Nec Research Institute, Inc. Autonomous citation indexing and literature browsing using citation context
US6289342B1 (en) * 1998-01-05 2001-09-11 Nec Research Institute, Inc. Autonomous citation indexing and literature browsing using citation context
US6256648B1 (en) * 1998-01-29 2001-07-03 At&T Corp. System and method for selecting and displaying hyperlinked information resources
US6457028B1 (en) * 1998-03-18 2002-09-24 Xerox Corporation Method and apparatus for finding related collections of linked documents using co-citation analysis
US6038574A (en) * 1998-03-18 2000-03-14 Xerox Corporation Method and apparatus for clustering a collection of linked documents using co-citation analysis
US6286018B1 (en) * 1998-03-18 2001-09-04 Xerox Corporation Method and apparatus for finding a set of documents relevant to a focus set using citation analysis and spreading activation techniques
US6182091B1 (en) * 1998-03-18 2001-01-30 Xerox Corporation Method and apparatus for finding related documents in a collection of linked documents using a bibliographic coupling link analysis
US6351746B1 (en) * 1998-11-09 2002-02-26 Unisys Corporation Cool ice icons
US20040133555A1 (en) * 1998-12-04 2004-07-08 Toong Hoo-Min Systems and methods for organizing data
US6604114B1 (en) * 1998-12-04 2003-08-05 Technology Enabling Company, Llc Systems and methods for organizing data
US20020167543A1 (en) * 1999-02-01 2002-11-14 Jeffrey A. Smith User interface method and system for application programs implemented with component architectures
US20040181427A1 (en) * 1999-02-05 2004-09-16 Stobbs Gregory A. Computer-implemented patent portfolio analysis method and apparatus
US6378780B1 (en) * 1999-02-09 2002-04-30 S. C. Johnson & Son, Inc. Delivery system for dispensing volatiles
US20020035499A1 (en) * 1999-03-02 2002-03-21 Germeraad Paul B. Patent-related tools and methodology for use in the merger and acquisition process
US6476828B1 (en) * 1999-05-28 2002-11-05 International Business Machines Corporation Systems, methods and computer program products for building and displaying dynamic graphical user interfaces
US6175824B1 (en) * 1999-07-14 2001-01-16 Chi Research, Inc. Method and apparatus for choosing a stock portfolio, based on patent indicators
US20040103112A1 (en) * 1999-10-08 2004-05-27 Colson Thomas J. Computer based method and apparatus for mining and displaying patent data
US6952806B1 (en) * 2000-01-21 2005-10-04 Xerox Corporation Medium containing information gathered from material including a source and interface for graphically displaying the information
US20010027452A1 (en) * 2000-02-01 2001-10-04 Tropper Matthew Bruce System and method to identify documents in a database which relate to a given document by using recursive searching and no keywords
US6674450B1 (en) * 2000-04-14 2004-01-06 Trilogy Development Group, Inc. Interactive data-bound control
US6879990B1 (en) * 2000-04-28 2005-04-12 Institute For Scientific Information, Inc. System for identifying potential licensees of a source patent portfolio
US20020023077A1 (en) * 2000-06-09 2002-02-21 Nguyen Thanh Ngoc Method and apparatus for data collection and knowledge management
US7117198B1 (en) * 2000-11-28 2006-10-03 Ip Capital Group, Inc. Method of researching and analyzing information contained in a database
US20040148375A1 (en) * 2001-02-12 2004-07-29 Levett David Lawrence Presentation service which enables client device to run a network based application
US7019741B2 (en) * 2001-03-23 2006-03-28 General Electric Company Methods and systems for simulating animation of web-based data files
US7231386B2 (en) * 2001-03-30 2007-06-12 Kabushiki Kaisha Toshiba Apparatus, method, and program for retrieving structured documents
US6728725B2 (en) * 2001-05-08 2004-04-27 Eugene Garfield, Ph.D. Process for creating and displaying a publication historiograph
US20030001873A1 (en) * 2001-05-08 2003-01-02 Eugene Garfield Process for creating and displaying a publication historiograph
US20020174271A1 (en) * 2001-05-16 2002-11-21 Tetsuroh Tanigawa Publication confirming method, publication information acquisition apparatus, publication information providing apparatus and database
US20040201618A1 (en) * 2001-06-12 2004-10-14 Ian Alderson Streaming of real-time data to a browser
US6868528B2 (en) * 2001-06-15 2005-03-15 Microsoft Corporation Systems and methods for creating and displaying a user interface for displaying hierarchical data
US20030033295A1 (en) * 2001-07-11 2003-02-13 Adler Marc Stephen Method for analyzing and recording innovations
US20040133433A1 (en) * 2001-08-01 2004-07-08 Young-Gyun Lee Method for analyzing and providing of inter-relations between patents from the patent database
US20030074351A1 (en) * 2001-10-01 2003-04-17 Van Stegeren Eric D.F.D. System and method for generating a work set of patents or other documents
US20030172020A1 (en) * 2001-11-19 2003-09-11 Davies Nigel Paul Integrated intellectual asset management system and method
US7080325B2 (en) * 2002-02-22 2006-07-18 Call-Tell Llc Graphical device for comprehensive viewing and input of variable data via a browser-based display
US20040015481A1 (en) * 2002-05-23 2004-01-22 Kenneth Zinda Patent data mining
US20030229470A1 (en) * 2002-06-10 2003-12-11 Nenad Pejic System and method for analyzing patent-related information
US20040093561A1 (en) * 2002-11-08 2004-05-13 Chien-Fa Yeh System and method for displaying patent classification information
US20040123235A1 (en) * 2002-12-20 2004-06-24 Chien-Fa Yeh System and method for displaying and updating patent citation information
US7050056B2 (en) * 2002-12-20 2006-05-23 Sap Aktiengesellschaft Interactive and web-based Gantt Chart
US20050192968A1 (en) * 2003-12-08 2005-09-01 Beretich Guy R.Jr. Methods and systems for technology analysis and mapping
US20050182755A1 (en) * 2004-02-14 2005-08-18 Bao Tran Systems and methods for analyzing documents over a network
US20050210008A1 (en) * 2004-03-18 2005-09-22 Bao Tran Systems and methods for analyzing documents over a network
US20050270311A1 (en) * 2004-03-23 2005-12-08 Rasmussen Jens E Digital mapping system
US7158878B2 (en) * 2004-03-23 2007-01-02 Google Inc. Digital mapping system
US20060074867A1 (en) * 2004-09-29 2006-04-06 Anthony Breitzman Identification of licensing targets using citation neighbor search process
US7433884B2 (en) * 2004-09-29 2008-10-07 Chi Research, Inc. Identification of licensing targets using citation neighbor search process
US20060224975A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht System for creating a graphical application interface with a browser
US20060224999A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical visualization of data product using browser
US20060224974A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Method of creating graphical application interface with a browser
US20060224984A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Apparatus for creating graphical visualization of data with a browser
US20060224983A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical visualization of data using browser
US20060224982A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical application interface product using a browser
US20060225000A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical application interface using browser
US20060224980A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Method of creating graphical visualizations of data with a browser
US20080134060A1 (en) * 2005-04-01 2008-06-05 Paul Albrecht System for creating a graphical visualization of data with a browser
US20060224972A1 (en) * 2005-04-01 2006-10-05 Paul Albrecht Graphical application interface with a browser

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080281769A1 (en) * 2007-05-10 2008-11-13 Jason Hibbets Systems and methods for community tagging
US20080301091A1 (en) * 2007-05-31 2008-12-04 Hibbets Jason S Systems and methods for improved forums
US20080301115A1 (en) * 2007-05-31 2008-12-04 Mattox John R Systems and methods for directed forums
US8356048B2 (en) 2007-05-31 2013-01-15 Red Hat, Inc. Systems and methods for improved forums
US8266127B2 (en) * 2007-05-31 2012-09-11 Red Hat, Inc. Systems and methods for directed forums
US7966319B2 (en) 2007-06-07 2011-06-21 Red Hat, Inc. Systems and methods for a rating system
US20080306932A1 (en) * 2007-06-07 2008-12-11 Norman Lee Faus Systems and methods for a rating system
US8037009B2 (en) 2007-08-27 2011-10-11 Red Hat, Inc. Systems and methods for linking an issue with an entry in a knowledgebase
US20090063386A1 (en) * 2007-08-27 2009-03-05 Hibbets Jason S Systems and methods for linking an issue with an entry in a knowledgebase
US20090094210A1 (en) * 2007-10-05 2009-04-09 Fujitsu Limited Intelligently sorted search results
US20090094211A1 (en) * 2007-10-05 2009-04-09 Fujitsu Limited Implementing an expanded search and providing expanded search results
US8504579B1 (en) * 2010-04-23 2013-08-06 Crimson Corporation Filtering a data set using trees on a computing device
US8982129B1 (en) * 2010-04-23 2015-03-17 Crimson Corporation Mapping graph data to a tree structure on a computing device
US20120265773A1 (en) * 2011-04-12 2012-10-18 Microsoft Corporation Query-based diagrammatic presentation of data
US8924385B2 (en) * 2011-04-12 2014-12-30 Microsoft Corporation Query-based diagrammatic presentation of data
CN106599005A (en) * 2015-10-20 2017-04-26 阿里巴巴集团控股有限公司 Data archiving method and device
US11327941B2 (en) * 2018-05-02 2022-05-10 Flexera Software Llc Standardized graph-based framework for determining a license position of an enterprise computer system

Also Published As

Publication number Publication date
US20040133555A1 (en) 2004-07-08
EP1129417A1 (en) 2001-09-05
JP2002532788A (en) 2002-10-02
US6604114B1 (en) 2003-08-05
WO2000034896A1 (en) 2000-06-15
EP1129417A4 (en) 2004-06-30
AU3109200A (en) 2000-06-26
US7171405B2 (en) 2007-01-30

Similar Documents

Publication Publication Date Title
US7171405B2 (en) Systems and methods for organizing data
US7805440B2 (en) System and method for simplifying and manipulating k-partite graphs
Minghim et al. Content-based text mapping using multi-dimensional projections for exploration of document collections
Chung et al. A visual framework for knowledge discovery on the Web: An empirical study of business intelligence exploration
Kumar et al. Extracting large-scale knowledge bases from the web
US7519582B2 (en) System and method for performing a high-level multi-dimensional query on a multi-structural database
US6556983B1 (en) Methods and apparatus for finding semantic information, such as usage logs, similar to a query using a pattern lattice data space
Chung et al. Business intelligence explorer: a knowledge map framework for discovering business intelligence on the Web
US6038561A (en) Management and analysis of document information text
US8131779B2 (en) System and method for interactive multi-dimensional visual representation of information content and properties
US7840524B2 (en) Method and apparatus for indexing, searching and displaying data
US7529740B2 (en) Method and apparatus for organizing data sources
EP1618496B1 (en) A system and method for generating refinement categories for a set of search results
US7707210B2 (en) System and method for multi-dimensional foraging and retrieval of documents
US20030061209A1 (en) Computer user interface tool for navigation of data stored in directed graphs
US20050060287A1 (en) System and method for automatic clustering, sub-clustering and cluster hierarchization of search results in cross-referenced databases using articulation nodes
AU2004292680A1 (en) Method of constructing preferred views of hierarchical data
Singh et al. Generating association rules from semi-structured documents using an extended concept hierarchy
Liu et al. Visualizing document classification: A search aid for the digital library
Ganesh et al. Visual data mining: Framework and algorithm development
Murata Visualizing the structure of web communities based on data acquired from a search engine
Neches et al. Collaborative information space analysis tools
Song Bibliomapper: A cluster-based information visualization technique
Ho et al. Visualization support for a user-centered KDD process
Boyack et al. Information visualization, human-computer interaction, and cognitive psychology: Domain visualizations

Legal Events

Date Code Title Description
AS Assignment

Owner name: TECHNOLOGY ENABLING COMPANY, LLC, MASSACHUSETTS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TOONG, HOO-MIN;MORKEL, ANDRE;REEL/FRAME:018955/0252

Effective date: 20010515

AS Assignment

Owner name: TECHNOLOGY ENABLING COMPANY, LLC, MASSACHUSETTS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HADZIMA, JOSEPH G., JR.;REEL/FRAME:020965/0770

Effective date: 20010515

STCB Information on status: application discontinuation

Free format text: EXPRESSLY ABANDONED -- DURING EXAMINATION