지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- Korean Institute of Information Scientists and Engineers Journal of Computing Science and Engineering Journal of Computing Science and Engineering Vol.1 No.1
- 발행연도
- 2007.9
- 수록면
- 74 - 94 (21page)
이용수
초록· 키워드
오류제보하기
Nowadays, sharing data among organizations is often required during the business collaboration. Data mining technology has enabled efficient extraction of knowledge from large databases. This, however, increases risks of disclosing the sensitive knowledge when the database is released to other parties. To address this privacy issue, one may sanitize the original database so that the sensitive knowledge is hidden. The challenge is to minimize the side effect on the quality of the sanitized database so that non-sensitive knowledge can still be mined.
In this paper, we study such a problem in the context of hiding sensitive frequent itemsets by judiciously modifying the transactions in the database. Unlike previous work, we consider the quality of the sanitized database especially on preserving the non-sensitive frequent itemsets. To preserve the non-sensitive frequent itemsets, we propose a border-based approach to efficiently evaluate the impact of any modification to the database during the hiding process. The quality of database can be well maintained by greedily selecting the modifications with minimal side effect. Experiments results are also reported to show the effectiveness of the proposed approach.
In this paper, we study such a problem in the context of hiding sensitive frequent itemsets by judiciously modifying the transactions in the database. Unlike previous work, we consider the quality of the sanitized database especially on preserving the non-sensitive frequent itemsets. To preserve the non-sensitive frequent itemsets, we propose a border-based approach to efficiently evaluate the impact of any modification to the database during the hiding process. The quality of database can be well maintained by greedily selecting the modifications with minimal side effect. Experiments results are also reported to show the effectiveness of the proposed approach.
목차
1. INTRODUCTION
2. HIDING SENSITIVE FREQUENT ITEMSETS
3. A BORDER-BASED APPROACH
4. ALGORITHM
5. EXPERIMENT RESULTS
6. RELATED WORK
7. CONCLUSIONS
REFERENCES
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
민감한 항목집합을 숨기기 위한 tFP-Tree기반 BHSFI 알고리즘
정보과학회논문지 : 데이타베이스
2012 .12
-
THE STATE OF DATABASE TODAY : 1994(Ⅱ)
데이터베이스월드
1994 .01
-
THE STATE OF DATABASE TODAY : 1994(Ⅲ)
데이터베이스월드
1994 .01
-
Interesting Rules Mining with Deductive Method
제어로봇시스템학회 국제학술대회 논문집
2009 .08
-
Fast Discovery of Frequent Itemsets through Clustering and Decomposition
SmartCR
2012 .12
-
Mining Frequent Itemsets with Normalized Weight in Continuous Data Streams
JIPS(Journal of Information Processing Systems)
2010 .01
-
Database technology
데이타베이스연구
1988 .03
-
Cryptographic issues in database security
ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications
2007 .07
-
분산데이터베이스 환경하의 시간연관규칙 적용
한국정보과학회 학술발표논문집
2004 .04
-
민감한 빈발항목집합을 숨기기 위한 경계기반 HSFI 알고리즘
멀티미디어학회논문지
2011 .10
-
익명화된 트랜잭션 빈발패턴 결과 보정 기법
한국지능정보시스템학회 학술대회논문집
2019 .06
-
Improved Association Rule Mining by Modified Trimming
전자공학회논문지-CI
2008 .05
-
트랜잭션 연결 구조를 이용한 빈발 Closed 항목집합 마이닝 알고리즘
대한산업공학회지
2006 .09
-
Genomic and Proteomic Databases : Foundations, Current Status and Future Applications
Journal of Computing Science and Engineering
2007 .09
-
An effective queries execution algorithm on the encrypted database
INTERNATIONAL CONFERENCE ON FUTURE INFORMATION & COMMUNICATION ENGINEERING
2015 .06
-
Integration of Knowledge-based Systems and DataBase
한국정보과학회 워크샵
1991 .03
-
데이터 스트림 빈발항목 마이닝의 프라이버시 보호를 위한 더미 데이터 삽입 기법
정보보호학회논문지
2013 .06
-
TID 리스트 테이블을 이용한 연관 규칙 탐사
정보과학회논문지 : 데이타베이스
2005 .06
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2009-569-016057353