<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-12T11:10:35Z</responseDate>
  <request verb="GetRecord" metadataPrefix="jpcoar_2.0" identifier="oai:uec.repo.nii.ac.jp:00008922">https://uec.repo.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:uec.repo.nii.ac.jp:00008922</identifier>
        <datestamp>2023-05-15T10:08:40Z</datestamp>
        <setSpec>6</setSpec>
      </header>
      <metadata>
        <jpcoar:jpcoar xmlns:datacite="https://schema.datacite.org/meta/kernel-4/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcndl="http://ndl.go.jp/dcndl/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:jpcoar="https://github.com/JPCOAR/schema/blob/master/2.0/" xmlns:oaire="http://namespace.openaire.eu/schema/oaire/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rioxxterms="http://www.rioxx.net/schema/v2.0/rioxxterms/" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns="https://github.com/JPCOAR/schema/blob/master/2.0/" xsi:schemaLocation="https://github.com/JPCOAR/schema/blob/master/2.0/jpcoar_scm.xsd">
          <dc:title xml:lang="en">Anonymization of Sensitive Quasi-Identifiers for l-diversity and t-closeness</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Sei, Yuichi</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Okumura, Hiroshi</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Takenouchi, Takao</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Ohsuga, Akihiko</jpcoar:creatorName>
          </jpcoar:creator>
          <dc:rights>© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. This is not the published version. Please cite only the published version.</dc:rights>
          <jpcoar:subject xml:lang="en" subjectScheme="Other">privacy</jpcoar:subject>
          <jpcoar:subject xml:lang="en" subjectScheme="Other">data mining</jpcoar:subject>
          <jpcoar:subject xml:lang="en" subjectScheme="Other">l-diversity</jpcoar:subject>
          <jpcoar:subject xml:lang="en" subjectScheme="Other">t-closeness</jpcoar:subject>
          <datacite:description descriptionType="Abstract">A number of studies on privacy-preserving data mining have been proposed. Most of them assume that they can separate quasi-identifiers (QIDs) from sensitive attributes. For instance, they assume that address, job, and age are QIDs but are not sensitive attributes and that a disease name is a sensitive attribute but is not a QID. However, all of these attributes can have features that are both sensitive attributes and QIDs in practice. In this paper, we refer to these attributes as sensitive QIDs and we propose novel privacy models, namely, (l1, ..., lq)-diversity and (t1, ..., tq)-closeness, and a method that can treat sensitive QIDs. Our method is composed of two algorithms: an anonymization algorithm and a reconstruction algorithm. The anonymization algorithm, which is conducted by data holders, is simple but effective, whereas the reconstruction algorithm, which is conducted by data analyzers, can be conducted according to each data analyzer’s objective. Our proposed method was experimentally evaluated using real data sets.</datacite:description>
          <dc:publisher>IEEE</dc:publisher>
          <datacite:date dateType="Issued">2019-07</datacite:date>
          <dc:language>eng</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_6501">journal article</dc:type>
          <oaire:version rdf:resource="http://purl.org/coar/version/c_ab4af688f83e57aa">AM</oaire:version>
          <jpcoar:identifier identifierType="URI">https://uec.repo.nii.ac.jp/records/8922</jpcoar:identifier>
          <jpcoar:relation relationType="isVersionOf">
            <jpcoar:relatedIdentifier identifierType="DOI">10.1109/TDSC.2017.2698472</jpcoar:relatedIdentifier>
          </jpcoar:relation>
          <jpcoar:relation>
            <jpcoar:relatedIdentifier identifierType="DOI">https://doi.org/10.1109/TDSC.2017.2698472</jpcoar:relatedIdentifier>
          </jpcoar:relation>
          <jpcoar:sourceIdentifier identifierType="ISSN">1545-5971</jpcoar:sourceIdentifier>
          <jpcoar:sourceTitle xml:lang="en">IEEE Transactions on Dependable and Secure Computing</jpcoar:sourceTitle>
          <jpcoar:volume>16</jpcoar:volume>
          <jpcoar:issue>4</jpcoar:issue>
          <jpcoar:pageStart>580</jpcoar:pageStart>
          <jpcoar:pageEnd>593</jpcoar:pageEnd>
          <jpcoar:file>
            <jpcoar:URI label="1-TDSC">https://uec.repo.nii.ac.jp/record/8922/files/1-TDSC.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>4.1 MB</jpcoar:extent>
            <datacite:date dateType="Available">2019-01-21</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
