TY - GEN
T1 - Graph-based abstraction for privacy preserving manifold visualization
AU - Zhang, Xiaofeng
AU - Cheung, William K.
AU - Li, C. H.
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2006
Y1 - 2006
N2 - With the next-generation Web aiming to further facilitate data/information sharing and aggregation, providing data privacy protection support in an open networked environments becomes increasingly important. Learning-from-abstraction is a recently proposed distributed data mining approach which first abstracts data at local sources using the agglomerative hierarchical clustering (AGH) algorithm and then aggregates the abstractions (instead of the data) for global analysis. In this paper, we explain the limitation of the use of AGH for local manifold preserving data abstraction and propose the use of the graph-based clustering approach (e.g., the minimum cut) for local data abstraction. The effectiveness of the proposed abstraction approach was evaluated using benchmarking datasets with promising results. The global analysis results obtained based on the minimum cut abstraction was found to outperform those based on the AGH abstraction, especially when the underlying manifold was complex.
AB - With the next-generation Web aiming to further facilitate data/information sharing and aggregation, providing data privacy protection support in an open networked environments becomes increasingly important. Learning-from-abstraction is a recently proposed distributed data mining approach which first abstracts data at local sources using the agglomerative hierarchical clustering (AGH) algorithm and then aggregates the abstractions (instead of the data) for global analysis. In this paper, we explain the limitation of the use of AGH for local manifold preserving data abstraction and propose the use of the graph-based clustering approach (e.g., the minimum cut) for local data abstraction. The effectiveness of the proposed abstraction approach was evaluated using benchmarking datasets with promising results. The global analysis results obtained based on the minimum cut abstraction was found to outperform those based on the AGH abstraction, especially when the underlying manifold was complex.
UR - http://www.scopus.com/inward/record.url?scp=34250780584&partnerID=8YFLogxK
U2 - 10.1109/WI-IATW.2006.76
DO - 10.1109/WI-IATW.2006.76
M3 - Conference proceeding
AN - SCOPUS:34250780584
SN - 0769527493
SN - 9780769527499
T3 - Proceedings - 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2006 Workshops Proceedings)
SP - 94
EP - 97
BT - Proceedings - 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2006 Workshops Proceedings)
PB - IEEE Computer Society
T2 - 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology
Y2 - 18 December 2006 through 22 December 2006
ER -