{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lec13b-anonymity7 - COMP 7370 Advanced Computer and Network...

Info icon This preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Dr. Xiao Qin Auburn University http://www.eng.auburn.edu/~xqin [email protected] Spring, 2011 COMP 7370 Advanced Computer and Network Security The VectorCover Algorithm (2)
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2 Minimal Distance Vectors
Image of page 2
3 The Outlier Set and All Set Outliers: Tuples which have less than k occurrences All: a set of distinct tuples in a table
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
4 Pair – (strategy, tuples) New data structure Represents a transformation strategy Represents a set of tuples after applying such a transformation. Strategy = Distrance Vectors
Image of page 4
5 Distance between Two Tuples
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
6 The VectorCover Algorithm
Image of page 6
7 Dr. Xiao Qin Auburn University http://www.eng.auburn.edu/~xqin [email protected] Spring, 2011 COMP 7370 Advanced Computer and Network Security The MinGen Algorithm
Image of page 7

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
8
Image of page 8
9 Step 1: PT vs. PT[QI] vs.
Image of page 9

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
10 Step 2: history <- [d_1, … d_n] n =2 E_0 -> d_1 = 0 Z_0 -> d_2 = 0 E_1 -> d_1 = ? Z_2 -> d_2 = ? E_1 -> d_1 = 1 Z_2 -> d_2 = 2 Use subscripts to represent generalization strategies.
Image of page 10
11 Step 2: history <- [d_1, … d_n] Note: E_i and Z_j must be specific when you implement the MinGen algorithm.
Image of page 11

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 12
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern