|
Search the dblp DataBase
Traian Marius Truta:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Alina Campan, Gabriela Serban, Traian Marius Truta, Andrian Marcus
An Algorithm for the Discovery of Arbitrary Length Ordinal Association Rules. [Citation Graph (0, 0)][DBLP] DMIN, 2006, pp:107-113 [Conf]
- Traian Marius Truta, Bindu Vinay
Privacy Protection: p-Sensitive k-Anonymity Property. [Citation Graph (0, 0)][DBLP] ICDE Workshops, 2006, pp:94- [Conf]
- Traian Marius Truta, Farshad Fotouhi, Daniel C. Barth-Jones
Disclosure risk measures for the sampling disclosure control method. [Citation Graph (0, 0)][DBLP] SAC, 2004, pp:301-306 [Conf]
- Traian Marius Truta, Alina Campan
K-anonymization incremental maintenance and optimization techniques. [Citation Graph (0, 0)][DBLP] SAC, 2007, pp:380-387 [Conf]
- Traian Marius Truta, Farshad Fotouhi, Daniel C. Barth-Jones
Disclosure Risk Measures for Microdata. [Citation Graph (0, 0)][DBLP] SSDBM, 2003, pp:15-22 [Conf]
- Traian Marius Truta, Farshad Fotouhi, Daniel C. Barth-Jones
Assessing global disclosure risk in masked microdata. [Citation Graph (0, 0)][DBLP] WPES, 2004, pp:85-93 [Conf]
- Traian Marius Truta, Farshad Fotouhi, Daniel C. Barth-Jones
Privacy and confidentiality management for the microaggregation disclosure control method: disclosure risk and information loss measures. [Citation Graph (0, 0)][DBLP] WPES, 2003, pp:21-30 [Conf]
- Traian Marius Truta, Alina Campan, Paul Meyer
Generating Microdata with P -Sensitive K -Anonymity Property. [Citation Graph (0, 0)][DBLP] Secure Data Management, 2007, pp:124-141 [Conf]
A Clustering Approach for Achieving Data Privacy. [Citation Graph (, )][DBLP]
P-Sensitive K-Anonymity for Social Networks. [Citation Graph (, )][DBLP]
Protecting privacy in recorded conversations. [Citation Graph (, )][DBLP]
Data and Structural k-Anonymity in Social Networks. [Citation Graph (, )][DBLP]
User-controlled generalization boundaries for p-sensitive k-anonymity. [Citation Graph (, )][DBLP]
Search in 0.056secs, Finished in 0.056secs
|