Literatura académica sobre el tema "Privacy preserving clustering"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Privacy preserving clustering".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Privacy preserving clustering"
Hegde, Aditya, Helen Möllering, Thomas Schneider y Hossein Yalame. "SoK: Efficient Privacy-preserving Clustering". Proceedings on Privacy Enhancing Technologies 2021, n.º 4 (23 de julio de 2021): 225–48. http://dx.doi.org/10.2478/popets-2021-0068.
Texto completoLyu, Lingjuan, James C. Bezdek, Yee Wei Law, Xuanli He y Marimuthu Palaniswami. "Privacy-preserving collaborative fuzzy clustering". Data & Knowledge Engineering 116 (julio de 2018): 21–41. http://dx.doi.org/10.1016/j.datak.2018.05.002.
Texto completoGao, Zhiqiang, Yixiao Sun, Xiaolong Cui, Yutao Wang, Yanyu Duan y Xu An Wang. "Privacy-Preserving Hybrid K-Means". International Journal of Data Warehousing and Mining 14, n.º 2 (abril de 2018): 1–17. http://dx.doi.org/10.4018/ijdwm.2018040101.
Texto completoMohassel, Payman, Mike Rosulek y Ni Trieu. "Practical Privacy-Preserving K-means Clustering". Proceedings on Privacy Enhancing Technologies 2020, n.º 4 (1 de octubre de 2020): 414–33. http://dx.doi.org/10.2478/popets-2020-0080.
Texto completoNi, Weiwei y Zhihong Chong. "Clustering-oriented privacy-preserving data publishing". Knowledge-Based Systems 35 (noviembre de 2012): 264–70. http://dx.doi.org/10.1016/j.knosys.2012.05.012.
Texto completoJahan, Thanveer. "Privacy Preserving Clustering on Distorted data". IOSR Journal of Computer Engineering 5, n.º 2 (2012): 25–29. http://dx.doi.org/10.9790/0661-0522529.
Texto completoWei, Weiming, Chunming Tang y Yucheng Chen. "Efficient Privacy-Preserving K-Means Clustering from Secret-Sharing-Based Secure Three-Party Computation". Entropy 24, n.º 8 (18 de agosto de 2022): 1145. http://dx.doi.org/10.3390/e24081145.
Texto completoOliveira, Stanley R. M. y Osmar R. Zaïane. "Privacy-Preserving Clustering to Uphold Business Collaboration". International Journal of Information Security and Privacy 1, n.º 2 (abril de 2007): 13–36. http://dx.doi.org/10.4018/jisp.2007040102.
Texto completoNguyen, Huu Hiep. "Privacy-preserving mechanisms for k-modes clustering". Computers & Security 78 (septiembre de 2018): 60–75. http://dx.doi.org/10.1016/j.cose.2018.06.003.
Texto completoİnan, Ali, Selim V. Kaya, Yücel Saygın, Erkay Savaş, Ayça A. Hintoğlu y Albert Levi. "Privacy preserving clustering on horizontally partitioned data". Data & Knowledge Engineering 63, n.º 3 (diciembre de 2007): 646–66. http://dx.doi.org/10.1016/j.datak.2007.03.015.
Texto completoTesis sobre el tema "Privacy preserving clustering"
Cui, Yingjie y 崔英杰. "A study on privacy-preserving clustering". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B4357225X.
Texto completoCui, Yingjie. "A study on privacy-preserving clustering". Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B4357225X.
Texto completoThapa, Nirmal. "CONTEXT AWARE PRIVACY PRESERVING CLUSTERING AND CLASSIFICATION". UKnowledge, 2013. http://uknowledge.uky.edu/cs_etds/15.
Texto completoLin, Zhenmin. "Privacy Preserving Distributed Data Mining". UKnowledge, 2012. http://uknowledge.uky.edu/cs_etds/9.
Texto completoChatalic, Antoine. "Efficient and privacy-preserving compressive learning". Thesis, Rennes 1, 2020. http://www.theses.fr/2020REN1S030.
Texto completoThe topic of this Ph.D. thesis lies on the borderline between signal processing, statistics and computer science. It mainly focuses on compressive learning, a paradigm for large-scale machine learning in which the whole dataset is compressed down to a single vector of randomized generalized moments, called the sketch. An approximate solution of the learning task at hand is then estimated from this sketch, without using the initial data. This framework is by nature suited for learning from distributed collections or data streams, and has already been instantiated with success on several unsupervised learning tasks such as k-means clustering, density fitting using Gaussian mixture models, or principal component analysis. We improve this framework in multiple directions. First, it is shown that perturbing the sketch with additive noise is sufficient to derive (differential) privacy guarantees. Sharp bounds on the noise level required to obtain a given privacy level are provided, and the proposed method is shown empirically to compare favourably with state-of-the-art techniques. Then, the compression scheme is modified to leverage structured random matrices, which reduce the computational cost of the framework and make it possible to learn on high-dimensional data. Lastly, we introduce a new algorithm based on message passing techniques to learn from the sketch for the k-means clustering problem. These contributions open the way for a broader application of the framework
Chen, Keke. "Geometric Methods for Mining Large and Possibly Private Datasets". Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11561.
Texto completoShen, Chih-Chin y 沈志欽. "Privacy-Preserving Clustering of Data Streams". Thesis, 2009. http://ndltd.ncl.edu.tw/handle/98062034798829819799.
Texto completo東吳大學
資訊管理學系
97
Due to most historic studies on privacy-preserving data mining placed importance on the security of the massive amount of data from static database, consequently data undergoing privacy-preserving often lead to the decline in accuracy of mining result. Furthermore, following by the rapid advancement on internet and telecommunication technology, subsequently data types have transformed from traditional static data into data streams with consecutive, rapid, temporal, and caducous, as well as unpredictable properties. Due to the raising of such data types, traditional privacy-preserving data mining algorithm requiring complex calculation is no longer applicable. As a result, this paper has proposed a method of Privacy-Preserving Clustering of Data Streams (PPCDS) to improve data stream mining procedures while concurrently preserve privacy and a good mining accuracy. PPCDS is mainly composed of two phases: Rotation-Based Perturbation and cluster mining. In the phase of data rotating perturbation, a rotation transformation matrix is applied to rapidly perturb the data streams in order to preserve data privacy. In the cluster mining phase, perturbed data will first establish micro-cluster through optimization of cluster centers, then applying statistical calculation to update micro-cluster, as well as using geometric time frame to allocate and store micro-cluster, and finally input mining result through macro-cluster generation. Two simple data structure is added in the macro-cluster generation process to avoid recalculating the distance between the macro-point and the cluster center in the generation process. This process reduces the repeated calculation time in order to enhance mining efficiency without losing mining accuracy.
Hsieh, Ping-Yen y 謝秉諺. "A Study of Some Privacy-Preserving Clustering Schemes". Thesis, 2008. http://ndltd.ncl.edu.tw/handle/45450894976786879943.
Texto completo國立臺灣大學
資訊網路與多媒體研究所
96
Clustering is one of the most useful techniques to do some data analysis. But the conventional way to perform clustering usually offends one’s privacy. In the era of digital information, privacy is a very important concern in our daily life. To preserve one’s privacy, we exploit several privacy-preserving clustering schemes in this thesis. In the beginning, introduction to clustering, distributed clustering, and privacy-preserving clustering schemes will be given in order. And then, two major schemes, privacy-preserving k-means clustering and privacy-preserving hierarchical clustering, are illustrated in details. We implement these algorithms and perform experiments with both simulated ones and realistic data sets to learn the characteristics of each privacy-preserving clustering algorithm and evaluate the feasibility and usefulness of privacy-preserving clustering schemes.
Hsieh, Ping-Yen. "A Study of Some Privacy-Preserving Clustering Schemes". 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-0307200801072600.
Texto completoCunha, Mariana da Cruz. "Privacy-Preserving Mechanisms for Location Traces". Master's thesis, 2019. http://hdl.handle.net/10316/87304.
Texto completoLocation-Based Services are increasingly present in our daily lives. However, regardless of the benefits that these services offer to users, the shared data are not always and only used for the initial purpose. These data can be made public or sold, for example, for commercial purposes. The fact that location data contain information that can reveal the person’s identity, routines and habits, raises serious privacy concerns. In order to respond to this problem, there are privacy-preserving mechanisms, namely, for obfuscation and for anonymization of data. However, the correlation between location reports, which can potentially be used by an adversary to estimate the position of the user, has been underlooked in privacy protection. The aim of this thesis is to develop a user-centric Location Privacy-Preserving Mechanism, that is, a mechanism that protects privacy of a user at collection time. In addition, it is intended to protect the users not only against single reports, but also over time, against continuous reports. In this latter scenario, we intent to develop a protection mechanism that is suitable to different frequency of updates and/or to the correlation between reports as to mitigate possible privacy violations that advent from exploring these intrinsic characteristics of location data. Towards this end, we started by evaluating the impact of the frequency of updates on location privacy. For that, we implemented a state-of-the-art tracking attack that allows us to assess the effect of the frequency of updates by estimating the exact user locations. According to the performed analysis, we developed a new mechanism based on geo-indistinguishability that creates obfuscation clusters to aggregate closer locations. This developed mechanism is designated clustering geo-indistinguishability. To evaluate the utility of the mechanism, we resorted to a real use-case based on geofencing. Lastly, the evaluation of the mechanism enables us to conclude that it safeguards the level of privacy and the utility of continuous reports of location data, in a way that it can still be used for the purpose of a service.
Os serviços baseados em localização estão cada vez mais presentes no nosso quotidiano. No entanto, apesar do benefício que estes serviços oferecem aos utilizadores, os dados partilhados nem sempre são usados apenas com o propósito inicial. Estes dados podem ser tornados públicos ou vendidos, por exemplo, para fins comerciais. O facto dos dados de localização conterem informações passíveis de revelar a identidade, as rotinas e os hábitos de uma pessoa, levantam sérias preocupações de privacidade. Para dar resposta a este desiderato, existem mecanismos de preservação de privacidade, nomeadamente, de ofuscação e anonimização dos dados. Contudo, a correlação entre os dados de localização partilhados, que pode ser usada por um adversário para estimar a posição de um utilizador, tem sido negligenciada na proteção da privacidade. O objetivo desta tese é desenvolver um mecanismo de preservação de privacidade de localização centrado no utilizador, isto é, um mecanismo que proteja os utilizadores no momento da partilha de dados. Para além disso, pretende-se proteger o utilizador não só quando este reporta localizações únicas, mas também ao longo do tempo, isto é, quando reporta localizações de modo contínuo. Neste último cenário, pretendemos desenvolver um mecanismo de proteção que seja adequado a diferentes frequências de atualização de localização e/ou à correlação existente entre as localizações partilhadas, de modo a mitigar possíveis violações de privacidade que advenham da exploração destas características intrínsecas dos dados de localização. Neste sentido, começámos por avaliar o impacto da frequência na privacidade de localização. Para tal, implementámos um ataque considerado estado da arte que permite localizar o utilizador ao longo do tempo e do espaço, viabilizando a avaliação do efeito da frequência através da estimação da localização exata do utilizador. De acordo com a análise efetuada, desenvolvemos um mecanismo novo baseado em geo-indistinguishability que cria áreas de ofuscação para agregar localizações próximas. O mecanismo desenvolvido é designado clustering geo-indistinguisahbility. Para avaliar a utilidade do mecanismo, utilizámos um caso de uso real baseado em geofencing. Por fim, a avaliação do mecanismo permitiu-nos concluir que este salvaguarda o nível de privacidade e a utilidade dos dados, de tal modo que continuam a poder ser usados para o propósito do serviço.
Outro - Este trabalho é suportado pelos projetos SWING2 (PTDC/EEI-TEL/3684/2014) e Mobiwise (P2020 SAICTPAC/001/2015), financiado pelos Fundos Europeus Estruturais e de Investimento (FEEI) Europeus através do Programa Operacional Competitividade e Internacionalização - COMPETE 2020 e por Fundos Nacionais através da FCT - Fundação para a Ciência e a Tecnologia no âmbito do projeto POCI-01-0145-FEDER-016753, e pelo Fundo Europeu de Desenvolvimento Regional.
Capítulos de libros sobre el tema "Privacy preserving clustering"
Jha, Somesh, Luis Kruger y Patrick McDaniel. "Privacy Preserving Clustering". En Computer Security – ESORICS 2005, 397–417. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11555827_23.
Texto completoUpmanyu, Maneesh, Anoop M. Namboodiri, Kannan Srinathan y C. V. Jawahar. "Efficient Privacy Preserving K-Means Clustering". En Intelligence and Security Informatics, 154–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13601-6_17.
Texto completoKumar, K. Anil y C. Pandu Rangan. "Privacy Preserving DBSCAN Algorithm for Clustering". En Advanced Data Mining and Applications, 57–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73871-8_7.
Texto completoHamidi, Mona, Mina Sheikhalishahi y Fabio Martinelli. "Privacy Preserving Expectation Maximization (EM) Clustering Construction". En Distributed Computing and Artificial Intelligence, 15th International Conference, 255–63. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94649-8_31.
Texto completoSheikhalishahi, Mina, Mona Hamidi y Fabio Martinelli. "Privacy Preserving Collaborative Agglomerative Hierarchical Clustering Construction". En Communications in Computer and Information Science, 261–80. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25109-3_14.
Texto completoLiang, Shaopeng, Haomiao Yang, Qixian Zhou y Minglu Zhang. "Privacy-Preserving and Outsourced Density Peaks Clustering Algorithm". En Communications in Computer and Information Science, 538–52. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-9739-8_40.
Texto completoHu, Xiaoyi, Liping Lu, Dongdong Zhao, Jianwen Xiang, Xing Liu, Haiying Zhou, Shengwu Xiong y Jing Tian. "Privacy-Preserving K-Means Clustering Upon Negative Databases". En Neural Information Processing, 191–204. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04212-7_17.
Texto completoLi, Wenye. "A Unified Framework for Privacy Preserving Data Clustering". En Neural Information Processing, 319–26. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12637-1_40.
Texto completoLi, Wenye. "Privacy Preserving Clustering: A k-Means Type Extension". En Neural Information Processing, 319–26. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12640-1_39.
Texto completoLuo, Junwei, Xun Yi, Fengling Han, Xuechao Yang y Xu Yang. "An Efficient Clustering-Based Privacy-Preserving Recommender System". En Network and System Security, 387–405. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-23020-2_22.
Texto completoActas de conferencias sobre el tema "Privacy preserving clustering"
Bozdemir, Beyza, Sébastien Canard, Orhan Ermis, Helen Möllering, Melek Önen y Thomas Schneider. "Privacy-preserving Density-based Clustering". En ASIA CCS '21: ACM Asia Conference on Computer and Communications Security. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3433210.3453104.
Texto completoDash, Sanjit Kumar, Debi Pr Mishra, Ranjita Mishra y Sweta Dash. "Privacy preserving K-Medoids clustering". En the Second International Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2393216.2393290.
Texto completoDas, Ananda Swarup y Kannan Srinathan. "Privacy Preserving Cooperative Clustering Service". En 15th International Conference on Advanced Computing and Communications (ADCOM 2007). IEEE, 2007. http://dx.doi.org/10.1109/adcom.2007.52.
Texto completoZhan, Justin. "Privacy preserving K-Medoids clustering". En 2007 IEEE International Conference on Systems, Man and Cybernetics. IEEE, 2007. http://dx.doi.org/10.1109/icsmc.2007.4414177.
Texto completoLiu, Jinfei, Joshua Zhexue Huang, Jun Luo y Li Xiong. "Privacy preserving distributed DBSCAN clustering". En the 2012 Joint EDBT/ICDT Workshops. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2320765.2320819.
Texto completoLuong, The Dung y Tu Bao Ho. "Privacy Preserving EM-Based Clustering". En 2009 IEEE-RIVF International Conference on Computing and Communication Technologies. IEEE, 2009. http://dx.doi.org/10.1109/rivf.2009.5174654.
Texto completoFan-rong Meng, Bin Liu y Chu-jiao Wang. "Privacy preserving clustering over distributed data". En 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icacte.2010.5579456.
Texto completoBiswas, Chandan, Debasis Ganguly, Dwaipayan Roy y Ujjwal Bhattacharya. "Privacy Preserving Approximate K-means Clustering". En CIKM '19: The 28th ACM International Conference on Information and Knowledge Management. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3357384.3357969.
Texto completoVashkevich, Alexey V. y Vagim G. Zhukov. "Privacy-preserving clustering using C-means". En 2015 International Siberian Conference on Control and Communications (SIBCON). IEEE, 2015. http://dx.doi.org/10.1109/sibcon.2015.7147017.
Texto completoKalita, M., D. K. Bhattacharyya y M. Dutta. "Privacy Preserving Clustering-A Hybrid Approach". En 2008 16th International Conference on Advanced Computing and Communications (ADCOM). IEEE, 2008. http://dx.doi.org/10.1109/adcom.2008.4760438.
Texto completo