|
Volumn , Issue , 2008, Pages 410-415
|
Optimizing PPDM in asynchronous sparse data using random projection
a
ANNA UNIVERSITY
(India)
|
Author keywords
Asynchronous data stream; Data sets; L2 (Euclidean) distances; Performance; PPDM_IRI; Privacy; Privacy preserving data mining (PPDM); Random projection; Secure data mining; Sparse matrix
|
Indexed keywords
ADMINISTRATIVE DATA PROCESSING;
BENCHMARKING;
CANNING;
COMPUTER SOFTWARE REUSABILITY;
DATA MINING;
DATA PRIVACY;
DECISION SUPPORT SYSTEMS;
FOOD PRESERVATION;
HEALTH;
HEALTH CARE;
INFORMATION MANAGEMENT;
INFORMATION USE;
MATRIX ALGEBRA;
MINING;
RANDOM PROCESSES;
RIVERS;
SEARCH ENGINES;
ANALYTIC PROPERTIES;
ASYNCHRONOUS DATA STREAM;
CONCEPTUAL ARCHITECTURES;
CONFIDENTIAL DATA;
DATA SETS;
DATA STREAMING;
EUCLIDEAN;
HIGH-ACCURACY;
HIGH-DIMENSIONAL DATA;
INCREMENTAL DATA;
INFORMATION DETECTION;
INFORMATION RE-USE;
INTERNATIONAL CONFERENCES;
L2 (EUCLIDEAN) DISTANCES;
MINING OPERATIONS;
PERFORMANCE;
PPDM_IRI;
PRIVACY;
PRIVACY PRESERVATION;
PRIVACY PRESERVING;
PRIVACY PRESERVING DATA MINING (PPDM);
PRIVACY PROTECTION;
PRIVACY-PRESERVING DATA MINING;
RANDOM PROJECTION;
RANDOM PROJECTIONS;
REUSABLE KNOWLEDGE;
SECURE DATA MINING;
SENSITIVE DATA;
SENSITIVE INFORMATIONS;
SPARSE DATA;
SPARSE MATRICES;
SPARSE MATRIX;
STATISTICAL CHARACTERISTICS;
TWO-PARTY COMPUTATION;
SECURITY OF DATA;
|
EID: 51949087543
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/IRI.2008.4583066 Document Type: Conference Paper |
Times cited : (3)
|
References (16)
|