1 Ocak 2010 Dergi makalesi Açık Erişim

Abul, Osman; Bonchi, Francesco; Giannotti, Fosca

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Hiding Sequential and Spatiotemporal Patterns</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING</subfield>
    <subfield code="v">22</subfield>
    <subfield code="n">12</subfield>
    <subfield code="c">1709-1723</subfield>
  </datafield>
  <controlfield tag="001">25183</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">The process of discovering relevant patterns holding in a database was first indicated as a threat to database security by O'Leary in [1]. Since then, many different approaches for knowledge hiding have emerged over the years, mainly in the context of association rules and frequent item sets mining. Following many real-world data and application demands, in this paper, we shift the problem of knowledge hiding to contexts where both the data and the extracted knowledge have a sequential structure. We define the problem of hiding sequential patterns and show its NP-hardness. Thus, we devise heuristics and a polynomial sanitization algorithm. Starting from this framework, we specialize it to the more complex case of spatiotemporal patterns extracted from moving objects databases. Finally, we discuss a possible kind of attack to our model, which exploits the knowledge of the underlying road network, and enhance our model to protect from this kind of attack. An exhaustive experiential analysis on real-world data sets shows the effectiveness of our proposal.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Yahoo Res, Barcelona 08018, Spain</subfield>
    <subfield code="a">Bonchi, Francesco</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">KDDLAB ISTI CNR, I-56100 Pisa, Italy</subfield>
    <subfield code="a">Giannotti, Fosca</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="b">article</subfield>
    <subfield code="a">publication</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">TOBB Univ Econ &amp; Technol, Dept Comp Engn, TR-06560 Ankara, Turkey</subfield>
    <subfield code="a">Abul, Osman</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2010-01-01</subfield>
  </datafield>
  <controlfield tag="005">20210315113843.0</controlfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zenodo.org:25183</subfield>
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:42f82ede04de25bbcb4a6766f78e9d2a</subfield>
    <subfield code="s">163</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/25183/files/bib-19696530-55b6-4e1a-a7c5-7f0edb05138c.txt</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
    <subfield code="a">Creative Commons Attribution</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1109/TKDE.2009.213</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
</record>