<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>data utility on Blog of many things</title>
    <link>https://www.enderman.eu/tags/data-utility/</link>
    <description>Recent content in data utility on Blog of many things</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Mon, 12 Apr 2021 00:00:00 +0000</lastBuildDate><atom:link href="https://www.enderman.eu/tags/data-utility/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Multidimentional k-anonymity</title>
      <link>https://www.enderman.eu/post/2021-04-12-multidimentional-k-anonymity/</link>
      <pubDate>Mon, 12 Apr 2021 00:00:00 +0000</pubDate>
      
      <guid>https://www.enderman.eu/post/2021-04-12-multidimentional-k-anonymity/</guid>
      <description>K-anonymity is hard, besides the common mistakes (such as missing quasi-identifiers or using a too small value of k) [1] it is also an NP-hard problem to try and optimize data utility [2]. One of the ways to optimize utility and determine which combination of methods stays under the required threshold (e.g. no equivalence classes smaller than k) is to apply every combination of methods and determine which is best.</description>
    </item>
    
  </channel>
</rss>
