# US 2008/0189280 A1 · Data processing based on data linking elements > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2008/0189280 A1 - Document ID: US20080189280A1 - Status: Published application - Kind: A1 - Application number: 11/855,103 - Filed: 2007-09-13 - Published: 2008-08-07 - Earliest claimed: 2006-09-13 - Assignees: I. Know NV. - Inventors: Michael Rik Frans BRANDS; Dirk Medard Helena Van Hyfte - Web page: https://patentgrep.com/patent/US20080189280A1 ## CPC - G06F 16/24: Querying - G06N 5/02: Knowledge representation; Symbolic representation - G06N 5/022: Knowledge engineering; Knowledge acquisition - Y10S 707/913: Multimedia - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS - Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS ## Abstract A computer controlled method for automatically segmenting an ensemble of data. The method starts by acquiring an ensemble of data and data is segmented by identifying a first subset of sequences of Linking Data Elements based on a repository of Linking Data Elements. A second subset of sequences of Information Carrying Data Elements is identified, wherein the sequences are linked by the Linking Data Elements. The subsets are provided in a structured format. ## Claims ### Claim 1 A computer controlled method for automatically segmenting an ensemble of digital data comprising a step of acquiring said ensemble of data, and wherein said ensemble of data is segmented by: identifying a first subset of sequences of Linking Data Elements, based on a repository of Linking Data Elements, each sequence comprising at least one Linking Data Element, identifying a second subset of sequences of Information Carrying Data Elements, each sequence comprising at least one Information Carrying Data Element, said sequences of Information Carrying Data Elements being linked by said sequences of Linking Data Elements, and providing said subsets in a structured format. ### Claim 2 A computer controlled method for automatically segmenting an ensemble of digital data comprising a step of acquiring said ensemble of data, and wherein said ensemble of data is segmented by: identifying a first subset of sequences of Linking Data Elements, based on a repository of Linking Data Elements, each sequence comprising at least one Linking Data Element, identifying a second subset of sequences of Information Carrying Data Elements, each sequence comprising at least one Information Carrying Data Element, said sequences of Information Carrying Data Elements being linked by said sequences of Linking Data Elements, identifying a subsequence of a sequence as being a part of a sequence occurring in at least two different sequences of said ensemble of data, and ranking said sequences and subsequences based on presence in said ensemble of data, providing a general ranking, and representing said general ranking in a structured format. ### Claim 3 (canceled) ### Claim 4 (depends on 2) A method according to claim 2, wherein said general ranking is at least one ranking of a group comprised by: a ranking based on position of sequences and subsequences in said ensemble of data, a ranking on frequency of occurrence of sequences and subsequences in said ensemble of data, and a ranking based on length of sequences and subsequences. ### Claim at position 5 5-6. (canceled) ### Claim 7 (depends on 2) A method according to claim 2, further comprising the step of ranking sequences based on co-occurring subsequences providing a subsequence based ranking and representing said subsequence based ranking in a structured format. ### Claim 8 (depends on 2) A method according to claim 2, further comprising the step of ranking any of said sequences and subsequences based on being linked with any other sequences and subsequences by a Linking Data Element providing a linkage ranking and representing said linkage ranking in a structured format. ### Claim 9 (depends on 2) A method according to claim 2, wherein any of said sequences and subsequences and Linking Data Elements have an order of occurrence and ranking any of said sequences and subsequences based on said order of occurrence with a particular Linking Data Element providing an order based ranking and representing said order based ranking in a structured format. ### Claim 10 (depends on 2) A method according to claim 2, determining clusterability of any of a sequence and subsequence based on at least one ranking of a group comprising a general ranking, a linkage ranking and an order based ranking, selecting datasets of said ensemble based on said clusterability of any of said sequences and subsequences, and structuring said data ensemble based on said clusterability of any of said sequences and subsequences. ### Claim at position 10 11-12. (canceled) ### Claim 13 (depends on 2) A method according to claim 2, determining density and sparsity of said ensemble of data based on said clusterability and linkage data ranking of said sequences and subsequences. ### Claim 14 (depends on 2) A method according to claim 2, wherein two or more Linking Data Elements are combined based on an order of occurrence of said Linking Data Elements in said ensemble of data. ### Claim 15 (depends on 2) A method according to claim 2, wherein said Linking Data Elements have a predefined qualification in a qualification system and wherein any of a sequence and subsequence is qualified according to its order of occurrence with a particular Linking Data Element and in accordance with said qualification of said Linking Data Element and representing said qualification in a structured format. ### Claim 16 (depends on 2) A method according to claim 2, wherein said Linking Data Elements have a predefined qualification in a qualification system and wherein a subsequence is qualified according to its order of occurrence with a particular Linking Data Element and in accordance with said qualification of said Linking Data Element, wherein a sequence is qualified based on said qualification of subsequences of said sequence, and representing said qualification in a structured format. ### Claim 17 (depends on 2) A method according to claim 2, wherein any of said sequences, subsequences and Linking Data Elements have a predefined qualification in a qualification system and wherein any of a sequence, subsequence and a Linking Data Element is qualified according to its order of occurrence with any of a particular Linking Data Element, a particular sequence, and a particular subsequence and in accordance with said qualification of said Linking Data Element and representing said qualification in a structured format. ### Claim 18 (canceled) ### Claim 19 (depends on 2) A method according to claim 2, wherein any of said sequences, subsequences and Linking Data Elements have a predefined semantic denotation and wherein any of a sequence, a subsequence and a Linking Data Element is semantically denoted according to its order of occurrence with any of a particular Linking Data Element, a particular sequence, a particular subsequence and in accordance with said semantic denotation of any of said Linking Data Elements, said sequences and subsequences, and representing said denotation in a structured format. ### Claim 20 (depends on 2) A method according to claim 2, wherein any of a sequence and subsequence is identified as a semantic denotation for any of an other sequence and subsequence based on being linked with said any other sequence and subsequence by a specific Linking Data Element. ### Claim 21 (canceled) ### Claim 22 (depends on 2) A method according to claim 2, wherein said data ensemble is structured, based on a semantic denotation of any of said sequences and subsequences. ### Claim 23 (depends on 2) A method according to claim 2, wherein a sequence of Information Carrying Data Elements is qualified as being of a particular kind based on its occurrence in said ensemble of data in association with a specific subset of sequences of Linking Data Elements. ### Claim 24 (depends on 2) A method according to claim 2, wherein after said segmentation of said of ensemble of data, a first subset of sequences of Linking Data Elements is assessed in order to determine whether sequences of said first subset have to be interpreted as pertaining to said second subset of Information Carrying Data Elements. ### Claim 25 (canceled) ### Claim 26 (depends on 2) A method according to claim 2, wherein a specific semantic link between sequences of Information Carrying Data Elements is determined based on the fact of being linked by at least one sequence of a specific set of sequences of Linking Data Elements. ### Claim 27 (depends on 2) A method according to claim 2, wherein a plurality of sequences of Information Carrying Data Elements can be determined as semantically equivalent when said plurality of sequences is co-occurring in an ensemble of data and at least one of: a specific set of sequences of Linking Data Elements is linked with different sequences of Information Carrying Data Elements, and linking more than once different identical pairs of sequences of Information Carrying Data Elements. ### Claim at position 26 28-29. (canceled) ### Claim 30 (depends on 2) A method according to claim 2, further comprising the step of initiating an action based on any of a qualification and a semantic denotation of any of a sequence and subsequence, wherein said action is at least one of a group comprising: Retrieval of data from an ensemble of data; Modification of an ensemble of data; Transferring data of an ensemble of date; Controlling at least one device; Interpreting data from an ensemble of data; Representation of an ensemble of data; Data compression of an ensemble of data. ### Claim 31 (depends on 2) A method according to claim 2, for searching an ensemble of data wherein said data is segmented further comprising the steps of: presenting in a structured format any of a sequence, a subsequence and a Linking Data Element according to any of a general ranking, a linkage ranking, an order based ranking, and clusterability, selecting any of a sequence, a subsequence and a Linking Data Element, and retrieving datasets of said ensemble of data in accordance with said selection. ### Claim 32 (depends on 2) A method according to claim 2, wherein a compression of said ensemble of data can be achieved using a ranking of sequences of Information Carrying Data Elements and Linking Data Elements together with positions of occurrence in said ensemble of data, providing a lossless index from which said ensemble of data can be reconstructed without having to store said ensemble of data. ### Claim 33 A computer controlled system for automatically segmenting an ensemble of digital data comprising means for acquiring said ensemble of data and means for segmentation of said data arranged for identifying a first subset of Linking Data Elements based on a repository of Linking Data Elements and for identifying a second subset of sequences of Information Carrying Data Elements wherein said sequences are linked by said Linking Data Elements, and means for providing said subsets in a structured format. ### Claim 34 A computer program product, comprising a computer program arranged for automatically segmenting an ensemble of digital data by: identifying a first subset of sequences of Linking Data Elements, based on a repository of Linking Data Elements, each sequence comprising at least one Linking Data Element, identifying a second subset of sequences of Information Carrying Data Elements, each sequence comprising at least one Information Carrying Data Element, said sequences of Information Carrying Data Elements being linked by said sequences of Linking Data Elements, and providing said subsets in a structured format, if said computer program is loaded into a memory of an electronic processing device. ### Claim 35 A computer program product comprising a computer program arranged for automatically segmenting an ensemble of digital data by: identifying a first subset of sequences of Linking Data Elements, based on a repository of Linking Data Elements, each sequence comprising at least one Linking Data Element, identifying a second subset of sequences of Information Carrying Data Elements, each sequence comprising at least one Information Carrying Data Element, said sequences of Information Carrying Data Elements being linked by said sequences of Linking Data Elements, and providing said subsets in a structured format, if said computer program is loaded into a memory of an electronic processing device, wherein said computer program product comprises any of a group of data carrying devices including floppy discs, CDroms, DVDs, tapes, memory stick devices, zip drives, flash memory cards, remote access devices, hard disks, semi-conductor memory devices, programmable semi-conductor memory devices, optical disks, magneto-optical data storage devices, and ferro electric data storage devices.