TY - GEN
T1 - Towards real-time performance of data value hiding for frequent data updates
AU - Wang, Jie
AU - Zhan, Justin
AU - Zhang, Jun
PY - 2008
Y1 - 2008
N2 - Hiding data values in privacy-preserving data mining (PPDM) protects information against unauthorized attacks while maintaining analytical data properties. The most popular models are designed for constant data environments. They are usually computationally expensivefor large data sizes and have poor real-time performance on frequent data growth. Considering that updates and growth ofsource data are becoming more and more popular in online environments, a PPDM model that has quick responses on the data updates in real-time is appealing. To increase the speed and response of the singular value decomposition (SVD) based model, we have applied an improved incremental SVD-updating algorithm. The performance and effectiveness of the improved algorithm have been examined on synthetic and real data sets. Experimental results indicate that the introduction of the incremental matrix decomposition produces a significant increase in speed for the SVD-based data value hiding method, better scalability, and better real-time performance of the model, thereafter. It also provides potential support for the use of the SVD technique in the On-Line Analytical Processing for business data analysis.
AB - Hiding data values in privacy-preserving data mining (PPDM) protects information against unauthorized attacks while maintaining analytical data properties. The most popular models are designed for constant data environments. They are usually computationally expensivefor large data sizes and have poor real-time performance on frequent data growth. Considering that updates and growth ofsource data are becoming more and more popular in online environments, a PPDM model that has quick responses on the data updates in real-time is appealing. To increase the speed and response of the singular value decomposition (SVD) based model, we have applied an improved incremental SVD-updating algorithm. The performance and effectiveness of the improved algorithm have been examined on synthetic and real data sets. Experimental results indicate that the introduction of the incremental matrix decomposition produces a significant increase in speed for the SVD-based data value hiding method, better scalability, and better real-time performance of the model, thereafter. It also provides potential support for the use of the SVD technique in the On-Line Analytical Processing for business data analysis.
UR - http://www.scopus.com/inward/record.url?scp=57949095384&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=57949095384&partnerID=8YFLogxK
U2 - 10.1109/GRC.2008.4664776
DO - 10.1109/GRC.2008.4664776
M3 - Conference contribution
AN - SCOPUS:57949095384
SN - 9781424425129
T3 - 2008 IEEE International Conference on Granular Computing, GRC 2008
SP - 606
EP - 611
BT - 2008 IEEE International Conference on Granular Computing, GRC 2008
T2 - 2008 IEEE International Conference on Granular Computing, GRC 2008
Y2 - 26 August 2008 through 28 August 2008
ER -