On 19/10/2017 17:50, Stefan Ram wrote:
Robin Becker writes:
...
this sort of makes sense for single attributes, but ignores the possibility of
combining the attributes to make the checks more discerning.
What I wrote also applies to compound attributes
(sets of base attributes).
On Fri, Oct 20, 2017 at 4:21 AM, Stefan Ram wrote:
> Dennis Lee Bieber writes:
>>Interesting -- that is coming out to be 2^size - 1, which will sure speed
>>up calculation for larger sets rather than doing all the factorial stuff.
>
> A set of size n has 2^n subsets.
>
> We exclude the empty
On 19/10/2017 16:42, Stefan Ram wrote:
Robin Becker writes:
Presumably the information in any attribute is highest
if the number of distinct occurrences is the the same as the list length and
pairs of attributes are more likely to be unique, but is there some proper way
Given a list of objects with attributes a0, a1, a2,an-1 is there an
efficient way to find sets of attributes which can be used to distinguish
members of the list?
As example a list of people might have
firstName, lastName, nationality, postcode, phonenumber,
as attributes. The probe i
