Methods, apparatus and data structures for providing a uniform representation of various types of information

Abstract

Methods and apparatus for analyzing tasks performed by computer users by (i) gathering usage data, (ii) converting logged usage data into a uniform format, (iii) determining or defining task boundaries, and (iv) determining a task analysis model by “clustering” similar tasks together. The task analysis model may be used to (i) help users complete a task (such help, for example, may be in the form of a gratuitous help function), and/or (ii) to target marketing information to users based on user inputs and the task analysis model. The present invention also provides a uniform semantic network for representing different types of objects in a uniform way.

1 - 18 . (canceled)  
   
   
       19 . A method for representing structured, linear, and active information in a uniform way, the method comprising steps of: 
 mapping structured information to a uniform representation;    mapping linear information to the uniform representation; and    mapping active information to the uniform representation.    
   
   
       20 . The method of  claim 19  wherein the uniform representation is a collection of elements, 
 wherein each of the elements is one of an entity and a relation, and    wherein a relation relates two ordered elements.    
   
   
       21 . The method of  claim 20  wherein a container entity contains other elements.  
   
   
       22 . (canceled)  
   
   
       23 . The method of  claim 20  wherein the uniform representation is expressed as a list of predicates.  
   
   
       24 . The method of  claim 20  wherein the step of mapping structured information to a uniform representation, includes sub-steps of: 
 if the information is structured as a hierarchy, 
 representing nodes of the hierarchy as entities, and  
 generating parent/child relations between the entities, consistent with the hierarchy.  
   
   
   
       25 . The method of  claim 20  wherein the step of mapping structured information to a uniform representation, includes sub-steps of: 
 if the information is structured as a table, 
 representing the table as an entity,  
 representing column names of the table as entities,  
 representing row numbers of the table as entities,  
 generating contains relations between the entity representing the table and each of the entities representing the column names and row numbers,  
 generating entities corresponding to information contained in the table, and  
 generating contains relations between the entities representing the column names and row numbers and entities corresponding to the information contained in the table, consistent with the table.  
   
   
   
       26 . (canceled)  
   
   
       27 . The method of  claim 20  wherein the step of mapping structured information to a uniform representation, includes sub-steps of: 
 if the information is structured as an entity-relationship diagram, 
 representing each of any attributes as an entity, and  
 generating has—a relations between each of the entities representing attributes and the entities to which the attributes belonged, consistent with the entity-relationship diagram.  
   
   
   
       28 . The method of  claim 20  wherein the step of mapping linear information to a uniform representation, includes sub-steps of: 
 parsing the linear information into pieces;    representing each of the pieces with an entity; and    generating a proceeds/follows relation between each of the entities representing adjacent parsed pieces.    
   
   
       29 . The method of  claim 28  wherein the pieces are selected from a group consisting of words, sentences, paragraphs, sections, headings, phrases, and alphanumeric strings.  
   
   
       30 . The method of  claim 20  wherein the step of mapping linear information to a uniform representation, includes sub-steps of: 
 representing a name of the sequence with an entity;    representing the information of the sequence with an entity; and    generating a data relation between the entity representing the name of the sequence and the entity representing the information of the sequence.    
   
   
       31 . The method of  claim 20  wherein the step of mapping active information to a uniform representation, includes sub-steps of: 
 representing a name of the active information as an entity;    representing properties, if any, of the active information as entities;    generating an of relation between the entity representing the name of the active information and each of the entities, if any, representing the properties of the active information;    representing methods, if any, of the active information as entities; and    generating a to relation between the entity representing the name of the active information and each of the entities, if an), representing the methods of the active information.    
   
   
       32 . The method of  claim 31  wherein if a method gets a property, then further: 
 generating a get relation between an entity representing the method and an entity representing the property.    
   
   
       33 . The method of  claim 31  wherein if a method sets a property, then further: 
 generating a set relation between an entity representing the method and an entity representing the property.    
   
   
       34 . The method of  claim 31  wherein, if a method of the active information has parameters, then further: 
 generating entities representing each of the parameters;    generating a parameter list entity;    generating a parameters—of relation between the entity representing the method and the parameter list entity; and    generating a contains relation between the parameter list entity and each of the entities representing the parameters.    
   
   
       35 - 36 . (canceled)  
   
   
       37 . A machine readable medium having machine executable instructions which, when executed by the machine perform steps for representing structured, linear, and active information in a uniform way, the steps comprising: 
 mapping structured information to a uniform representation;    mapping linear information to the uniform representation; and    mapping active information to the uniform representation.    
   
   
       38 . The method of  claim 37  wherein the uniform representation is a collection of elements, 
 wherein each of the elements is one of an entity and a relation; and    wherein a relation connects two ordered elements.    
   
   
       39 - 48 . (canceled)  
   
   
       49 . The method of  claim 38  wherein the step of mapping active information to a uniform representation, includes sub-steps of: 
 representing a name of the active information as an entity;    representing properties, if any, of the active information as entities;    generating an of relation between the entity representing the name of the active information and each of the entities, if any, representing the properties of the active information;    representing methods, if any, of the active information as entities; and    generating a to relation between the entity representing the name of the active information and each of the entities, if any, representing the methods of the active information.    
   
   
       50 - 54 . (canceled)  
   
   
       55 . A machine readable medium having a data structure comprising at least three elements, each of the elements being one of an entity and a relation, 
 wherein a relation connects two ordered elements; and    wherein an entity may represent any one of 
 an attribute of an entity-relationship diagram;  
 an entry from information structured as a hierarchy;  
 a column name of a table;  
 a row number of a table;  
 an entry from a table;  
 text from information structured as a sequence;  
 a name of active information;  
 a property of active information;  
 a method of active information; and  
 a parameter of a method of active information.  
   
   
   
       56 . The machine readable medium of  claim 55  wherein, in the data structure, an entity may contain elements.  
   
   
       57 . The machine readable medium of  claim 55  wherein the data structure is expressed as a list of predicates.