DC Field | Value | Language |
---|---|---|
dc.contributor.author | Md. Rezaul Karim | ko |
dc.contributor.author | Md. Mamunur Rashid | ko |
dc.contributor.author | Byeong-Soo Jeong | ko |
dc.contributor.author | Choi, Ho-Jin | ko |
dc.date.accessioned | 2013-03-11T10:09:55Z | - |
dc.date.available | 2013-03-11T10:09:55Z | - |
dc.date.created | 2012-12-27 | - |
dc.date.created | 2012-12-27 | - |
dc.date.issued | 2012-04 | - |
dc.identifier.citation | Lecture Notes in Computer Science 7238 , v.7238, no.0, pp.303 - 319 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/99000 | - |
dc.description.abstract | Problem of finding frequent patterns has long been studied because it is very essential to data mining tasks such as association rule analysis, clustering, and classification analysis. Privacy preserving data mining is another important issue for this domain since most users do not want their private information to leak out. In this paper, we proposed an efficient approach for mining maximal frequent patterns from a large transactional database with privacy preserving capability. As for privacy preserving, we utilized prime number based data transformation method. We also developed a noble algorithm for mining maximal frequent patterns based on lattice structure. Extensive performance analysis shows the effectiveness of our approach. | - |
dc.language | English | - |
dc.publisher | Springer-Verlag Berlin Heidelberg | - |
dc.title | Privacy preserving mining maximal frequent patterns in transactional databases. | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 7238 | - |
dc.citation.issue | 0 | - |
dc.citation.beginningpage | 303 | - |
dc.citation.endingpage | 319 | - |
dc.citation.publicationname | Lecture Notes in Computer Science 7238 | - |
dc.contributor.localauthor | Choi, Ho-Jin | - |
dc.contributor.nonIdAuthor | Md. Rezaul Karim | - |
dc.contributor.nonIdAuthor | Md. Mamunur Rashid | - |
dc.contributor.nonIdAuthor | Byeong-Soo Jeong | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.