Sökning: onr:"swepub:oai:DiVA.org:kth-181011" >
Self-Correlation an...
Self-Correlation and Maximum Independence in Finite Relations
-
- Gurov, Dilian (författare)
- KTH,Skolan för datavetenskap och kommunikation (CSC)
-
Markov, Minko (författare)
-
(creator_code:org_t)
- 2015
- 2015
- Engelska.
-
Ingår i: Electronic Proceedings in Theoretical Computer Science. - 2075-2180. ; :191, s. 60-74
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.4...
-
visa färre...
Abstract
Ämnesord
Stäng
- We consider relations with no order on their attributes as in Database Theory. An independent partition of the set of attributes S of a finite relation R is any partition (sic) of S such that the join of the projections of R over the elements of (sic) yields R. Identifying independent partitions has many applications and corresponds conceptually to revealing orthogonality between sets of dimensions in multidimensional point spaces. A subset of S is termed self-correlated if there is a value of each of its attributes such that no tuple of R contains all those values. This paper uncovers a connection between independence and self-correlation, showing that the maximum independent partition is the least fixed point of a certain inflationary transformer alpha that operates on the finite lattice of partitions of S. alpha is defined via the minimal self-correlated subsets of S. We use some additional properties of alpha to show the said fixed point is still the limit of the standard approximation sequence, just as in Kleene's well-known fixed point theorem for continuous functions.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas