Mostrar el registro sencillo del ítem
A hybrid approach to frequent itemset hiding
dc.creator | Gkoulalas-Divanis, A. | en |
dc.creator | Verykios, V. S. | en |
dc.date.accessioned | 2015-11-23T10:28:29Z | |
dc.date.available | 2015-11-23T10:28:29Z | |
dc.date.issued | 2007 | |
dc.identifier | 10.1109/ICTAI.2007.68 | |
dc.identifier.isbn | 076953015X | |
dc.identifier.issn | 10823409 | |
dc.identifier.uri | http://hdl.handle.net/11615/27998 | |
dc.description.abstract | In this paper, we propose a novel, exact border-based approach that provides an optimal solution for the hiding of sensitive frequent itemsets by (i) minimally extending the original database by a synthetically generated database part - the database extension, (ii) formulating the creation of the database extension as a constraint satisfaction problem that is solved by using binary integer programming, and (iii) providing an approximate solution close to the optimal one when an ideal solution does not exist. Extending the original database for sensitive itemset hiding is proved to provide optimal solutions to an extended set of hiding problems compared to previous approaches and to provide solutions of higher quality. © 2007 IEEE. | en |
dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-48649110325&partnerID=40&md5=a1ad2a91bd520a53cb03fb8084fe31ce | |
dc.subject | Artificial intelligence | en |
dc.subject | Codes (symbols) | en |
dc.subject | Cybernetics | en |
dc.subject | Database systems | en |
dc.subject | Integer programming | en |
dc.subject | Mathematical programming | en |
dc.subject | Optimal systems | en |
dc.subject | Approximate solutions | en |
dc.subject | Binary integer programming | en |
dc.subject | Constraint Satisfaction Problem | en |
dc.subject | Frequent Itemsets | en |
dc.subject | Hybrid approaches | en |
dc.subject | Ideal solutions | en |
dc.subject | International conferences | en |
dc.subject | Optimal solutions | en |
dc.subject | Sensitive itemset hiding | en |
dc.subject | Solutions | en |
dc.title | A hybrid approach to frequent itemset hiding | en |
dc.type | conferenceItem | en |
Ficheros en el ítem
Ficheros | Tamaño | Formato | Ver |
---|---|---|---|
No hay ficheros asociados a este ítem. |