원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Note that k-anonymity algorithm has been widely discussed in the area of privacy protection. In this paper, a new search algorithm to achieve k-anonymity for database application is introduced. A lattice is introduced to form a solution space for a k-anonymity problem and then a hybrid search method composed of tabu search and genetic algorithm is proposed. In this algorithm, the tabu search plays the role of mutation in the genetic algorithm. The hybrid method with independent tabu search and genetic algorithm is compared, and the hybrid approach performs the best in average case.
목차
Abstract
I. INTRODUCTION
II. Lattice generation and evaluation matrix
III. Hybrid method details
Ⅳ. Experiment result and analysis
Ⅴ. Conclusion
References
I. INTRODUCTION
II. Lattice generation and evaluation matrix
III. Hybrid method details
Ⅳ. Experiment result and analysis
Ⅴ. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보