[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/1099554.1099664acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
Article

Privacy leakage in multi-relational databases via pattern based semi-supervised learning

Published: 31 October 2005 Publication History

Abstract

In multi-relational databases, a view, which is a context- and content-dependent subset of one or more tables (or other views), is often used to preserve privacy by hiding sensitive information. However, recent developments in data mining present a new challenge for database security even when traditional database security techniques, such as database access control, are employed. This paper presents a data mining framework using semi-supervised learning that demonstrates the potential for privacy leakage in multi-relational databases. Many different types of semi-supervised learning techniques, such as the K-nearest neighbor (KNN) method, can be used to demonstrate privacy leakage. However, we also introduce a new approach to semi-supervised learning, hyperclique pattern based semi-supervised learning (HPSL), which differs from traditional semi-supervised learning approaches in that it considers the similarity among groups of objects instead of only pairs of objects. Our experimental results show that both the KNN and HPSL methods have the ability to compromise database security, although HPSL is better at this privacy violation than the KNN method.

References

[1]
C. Clifton. Using sample size to limit exposure to data mining. J. Comput. Secur., 8(4):281--307, 2000.
[2]
P. Domingos. Prospects and challenges for multi- relational data mining. SIGKDD Explorations, 2003.
[3]
R. Duin. Classifiers in almost empty spaces. In Proc. 15th Int'l Conference on Pattern Recognition, 2000.
[4]
S. Raudys and A. Jain. Small sample size effects in statistical pattern recognition: Recommendations for practitioners. IEEE TPAMI, 13(3):252--264, 1991.
[5]
M. Seeger. Learning with labeled and unlabeled data. In Technical Report, University of Edinburgh, 2001.
[6]
H. Xiong, M. Steinbach, and V. Kumar. Privacy leakage in multi-relational databases via pattern based semi-supervised learning. Technical Report 04-023, University of Minnesota, 2004.
[7]
H. Xiong, P. Tan, and V. Kumar. Mining strong affinity association patterns in data sets with skewed support distribution. In Proc. of ICDM, 2003.

Cited By

View all

Index Terms

  1. Privacy leakage in multi-relational databases via pattern based semi-supervised learning

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CIKM '05: Proceedings of the 14th ACM international conference on Information and knowledge management
    October 2005
    854 pages
    ISBN:1595931406
    DOI:10.1145/1099554
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 31 October 2005

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. database security
    2. hyperclique patterns
    3. privacy preserving data mining
    4. semi-supervised learning

    Qualifiers

    • Article

    Conference

    CIKM05
    Sponsor:
    CIKM05: Conference on Information and Knowledge Management
    October 31 - November 5, 2005
    Bremen, Germany

    Acceptance Rates

    CIKM '05 Paper Acceptance Rate 77 of 425 submissions, 18%;
    Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

    Upcoming Conference

    CIKM '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 24 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Privacy-Preserving Stochastic Gradual LearningIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.296397733:8(3129-3140)Online publication date: 1-Aug-2021
    • (2017)An approximate representation of hypercliquesJournal of Intelligent Information Systems10.1007/s10844-016-0409-448:2(263-285)Online publication date: 1-Apr-2017
    • (2014)Mining non-derivable hypercliquesKnowledge and Information Systems10.1007/s10115-013-0660-841:1(77-99)Online publication date: 1-Oct-2014
    • (2012)Aggregation and privacy in multi-relational databasesProceedings of the 2012 Tenth Annual International Conference on Privacy, Security and Trust (PST)10.1109/PST.2012.6297921(67-74)Online publication date: 16-Jul-2012
    • (2006)Privacy leakage in multi-relational databases: a semi-supervised learning perspectiveThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-006-0011-415:4(388-402)Online publication date: 1-Nov-2006

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media