Abstract: A computer-implemented method to capture and detect clusters in, or determined by, a set V of discrete digital data comprising; computing, from the set V, an abstract separation system ASS that consists of a finite set S, whose elements are called separations; of a predetermined transitive, antisymmetric and reflexive order relation ? on S; and of an order-reversing involution *: S?S, that is, a mapping s?s* with the property that, (s*)*=s and that r?s implies s*<r* for all r, s?S; predetermining a set of consistency requirements (CRs), that is, a set F of subsets of S; computing, from the ASS (S,?, *), one or more abstract tangles, that is, any set T?S that contains exactly one of each pair {s, s*} for s?S, and does not contain any of the forbidden configurations F?F as a subset; or determining that there is no abstract tangle; and determining that any abstract tangle T represents a cluster in, or determined by, the data set V.

Abstract: A computer-implemented method to capture and detect clusters in, or determined by, a set V of discrete digital data comprising; computing, from the set V, an abstract separation system ASS that consists of a finite set S, whose elements are called separations; of a predetermined transitive, antisymmetric and reflexive order relation ? on S; and of an order-reversing involution * : S?S, that is, a mapping s?s* with the property that, (s*)*=s and that r?s implies s*<r* for all r, s ? S; predetermining a set of consistency requirements (CRs), that is, a set F of subsets of S; computing, from the ASS (S,?, *), one or more abstract tangles, that is, any set T?S that contains exactly one of each pair {s, s*} for s ? S, and does not contain any of the forbidden configurations F ? F as a subset; or determining that there is no abstract tangle; and determining that any abstract tangle T represents a cluster in, or determined by, the data set V.