Research Repository

Secure Two-Party Association Rule Mining Based on One-Pass FP-Tree a one-pass FP-tree method to perform association rule mining without compromising any data privacy among two parties

Kaosar, Md. Golam and Yi, Xun (2011) Secure Two-Party Association Rule Mining Based on One-Pass FP-Tree a one-pass FP-tree method to perform association rule mining without compromising any data privacy among two parties. International Journal of Information Security and Privacy, 5 (2). pp. 13-32. ISSN 1930-1650 (print) 1930-1669 (online)

Full text for this resource is not available from the Research Repository.

Abstract

Data mining, often referred as the major part in knowledge discovery in database (KDD) is the process of discovering knowledge for decision making in business by utilizing patterns or models existed in data. In this paper, it is proposed that a one-pass Frequent Path tree (FP-tree) method will perform association rule mining without compromising the data privacy between two parties.

Item Type: Article
Uncontrolled Keywords: ResPubID23609, Frequent Path tree (FP-tree), Data mining, knowledge discovery in database (KDD), association rule mining, data privacy, security
Subjects: FOR Classification > 0806 Information Systems
SEO Classification > 8903 Information Services
Faculty/School/Research Centre/Department > School of Engineering and Science
Related URLs:
Depositing User: VUIR
Date Deposited: 21 Aug 2012 03:29
Last Modified: 01 Feb 2014 22:26
URI: http://vuir.vu.edu.au/id/eprint/9134
DOI: 10.4018/jisp.2011040102
ePrint Statistics: View download statistics for this item
Citations in Scopus: 0 - View on Scopus

Repository staff only

View Item View Item

Search Google Scholar