Method for the processing of several different data structures
OwnerMaria Athelogouinventor
Life of this patent
Estimating the term…
Loading patent…
OwnerMaria Athelogouinventor
Estimating the term…
What is disclosed is a method for processing data structures of different structures and contents by means of networked semantic units, which method includes the steps of: the steps of: acquisition of data wherefrom the different data structures are derivable, wherein respective data structures are represented in respective networked networks of semantic structure units; and generating, analyzing, modifying, deleting and/or storing the semantic structure units and/or networking them based on the acquired data by using a knowledge base comprised of a network of semantic knowledge units. Herein in iterative steps semantic structure units and/or the networking thereof are classified and a specific processing may be activated thanks to this classification, which specific processing modifies a respective semantic structure unit and/or a particular partial network.
A method for processing data structures of different structures and contents by means of networked semantic units, which method includes the steps of:
The method in accordance with any one of the preceding claims, characterized in that the networks of semantic structure units overlap each other.
The method in accordance with any one of the preceding claims, characterized in that in step [b] a networking between networks of semantic structure units is changed.
The method in accordance with any one of the preceding claims, characterized in that in step [b] a networking between the network of semantic knowledge units and the networks of semantic structure units is changed.
The method in accordance with any one of the preceding claims, characterized in that the several different data structures are interrelated biological, biochemical, biomedical and/or genetic data structures.
The method in accordance with any one of the preceding claims, characterized in that a classification algorithm is started by string-matching, wherein knowledge units are characterized by particular strings and the classification algorithm recognizes fragments in the several different data structures having identical or similar strings, and generates classification connections with corresponding knowledge units of semantic structure units which correspond to these fragments, whereby in turn new algorithms may be called up.
The method in accordance with any one of the preceding claims, characterized in that classification is carried out with the aid of neighborhood relationships.
The method in accordance with any one of the preceding claims, characterized in that semantic structure units are generated which are merely allocated a fictitious meaning in a classification by means of the network of semantic knowledge units.
Dependencies are inferred from the claim text.