|
|
| Acesso ao texto completo restrito à biblioteca da Embrapa Agricultura Digital. Para informações adicionais entre em contato com cnptia.biblioteca@embrapa.br. |
Registro Completo |
Biblioteca(s): |
Embrapa Agricultura Digital. |
Data corrente: |
18/04/2005 |
Data da última atualização: |
17/01/2020 |
Autoria: |
OLIVEIRA, S. R. de M.; ZAÏANE, O. R. |
Afiliação: |
STANLEY ROBSON DE MEDEIROS OLIVEIRA, CNPTIA; OSMAR R. ZAÏANE, University of Alberta. |
Título: |
Achieving privacy preservation when sharing data for clustering. |
Ano de publicação: |
2004 |
Fonte/Imprenta: |
In: SECURE DATA MANAGEMENT WORKSHOP, 2004, Toronto. Secure data management: proceedings. Berlin: Springer, 2004. p. 67-82. |
Série: |
(Lectures Notes in Computer Science, 3178). |
ISBN: |
3-540-22983-3 |
Idioma: |
Inglês |
Notas: |
SDM 2004. Na publicação: Stanley R.M. Oliveira. |
Conteúdo: |
Abstract. In this paper, we address the problem of protecting the underlying attribute values when sharing data for clustering. The challenge is how to meet privacy requirements and guarantee valid clustering results as well. To achieve this dual goal, we propose a novel spatial data transformation method called Rotation-Based Transformation (RBT). The major features of our data transformation are: a) it is independent of any clustering algorithm, b) it has a sound mathematical foundation; c) it is efficient and accurate; and d) it does not rely on intractability hypotheses from algebra and does not require CPU-intensive operations. We show analytically that although the data are transformed to achieve privacy, we can also get accurate clustering results by the safeguard of the global distances between data points. |
Palavras-Chave: |
Clustering; Clusterização; Privacidade. |
Thesaurus Nal: |
Cluster analysis. |
Categoria do assunto: |
X Pesquisa, Tecnologia e Engenharia |
Marc: |
LEADER 01559nam a2200205 a 4500 001 1009025 005 2020-01-17 008 2004 bl uuuu u00u1 u #d 020 $a3-540-22983-3 100 1 $aOLIVEIRA, S. R. de M. 245 $aAchieving privacy preservation when sharing data for clustering.$h[electronic resource] 260 $aIn: SECURE DATA MANAGEMENT WORKSHOP, 2004, Toronto. Secure data management: proceedings. Berlin: Springer, 2004. p. 67-82.$c2004 490 $a(Lectures Notes in Computer Science, 3178). 500 $aSDM 2004. Na publicação: Stanley R.M. Oliveira. 520 $aAbstract. In this paper, we address the problem of protecting the underlying attribute values when sharing data for clustering. The challenge is how to meet privacy requirements and guarantee valid clustering results as well. To achieve this dual goal, we propose a novel spatial data transformation method called Rotation-Based Transformation (RBT). The major features of our data transformation are: a) it is independent of any clustering algorithm, b) it has a sound mathematical foundation; c) it is efficient and accurate; and d) it does not rely on intractability hypotheses from algebra and does not require CPU-intensive operations. We show analytically that although the data are transformed to achieve privacy, we can also get accurate clustering results by the safeguard of the global distances between data points. 650 $aCluster analysis 653 $aClustering 653 $aClusterização 653 $aPrivacidade 700 1 $aZAÏANE, O. R.
Download
Esconder MarcMostrar Marc Completo |
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
URL |
Voltar
|
|
Registros recuperados : 16 | |
7. | | OLIVEIRA, S. R. de M.; ZAÏANE, O. R.; SAYGIN, Y. Secure association rule sharing. In: PACIFIC-ASIA CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 8., 2004, Sidney, Australia. Advances in knowledge discovery and data mining: proceedings. Berlin: Springer, 2004. p. 74-85. (Lecture notes in artificial intelligence, 3056). Editores: Honghua Dai, Ramakrishnan Srikant, Chengqi Zhang. PAKDD 2004. Na publicação: Stanley R. M. Oliveira.Biblioteca(s): Embrapa Agricultura Digital. |
| |
Registros recuperados : 16 | |
|
Nenhum registro encontrado para a expressão de busca informada. |
|
|