Documents disponibles écrits par cet auteur

SOM-based recommendations with privacy on multi-party vertically distributed data / C. Kaleli in Journal of the operational research society (JORS), Vol. 63 N° 6 (Juin 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 6 (Juin 2012) . - pp. 826–838 Titre : SOM-based recommendations with privacy on multi-party vertically distributed data Type de document : texte imprimé Auteurs : C. Kaleli, Auteur ; H. Polat, Auteur Année de publication : 2012 Article en page(s) : pp. 826–838 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Privacy  Vertically  distributed  data  Prediction  SOM Index. décimale : 001.424 Résumé : Data collected for providing recommendations can be partitioned among different parties. Offering distributed data-based predictions is popular due to mutual advantages. It is almost impossible to present trustworthy referrals with decent accuracy from split data only. Meaningful outcomes can be drawn from adequate data. Those companies with distributed data might want to collaborate to produce accurate and dependable recommendations to their customers. However, they hesitate to work together or refuse to collaborate because of privacy, financial concerns, and legal issues. If privacy-preserving measures are provided, such data holders might decide to collaborate for better predictions. In this study, we investigate how to provide predictions based on vertically distributed data (VDD) among multiple parties without deeply jeopardizing their confidentiality. Users are first grouped into various clusters off-line using self-organizing map clustering while protecting the online vendors’ privacy. With privacy concerns, recommendations are produced based on partitioned data using a nearest neighbour prediction algorithm. We analyse our privacy-preserving scheme in terms of confidentiality and supplementary costs. Our analysis shows that our method offers recommendations without greatly exposing data holders’ privacy and causes negligible superfluous costs because of privacy concerns. To evaluate the scheme in terms of accuracy, we perform real-data-based experiments. Our experiment results demonstrate that the scheme is still able to provide truthful predictions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n6/abs/jors201176a.html [article] SOM-based recommendations with privacy on multi-party vertically distributed data [texte imprimé] / C. Kaleli, Auteur ; H. Polat, Auteur . - 2012 . - pp. 826–838. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 6 (Juin 2012) . - pp. 826–838 Mots-clés : Privacy  Vertically  distributed  data  Prediction  SOM Index. décimale : 001.424 Résumé : Data collected for providing recommendations can be partitioned among different parties. Offering distributed data-based predictions is popular due to mutual advantages. It is almost impossible to present trustworthy referrals with decent accuracy from split data only. Meaningful outcomes can be drawn from adequate data. Those companies with distributed data might want to collaborate to produce accurate and dependable recommendations to their customers. However, they hesitate to work together or refuse to collaborate because of privacy, financial concerns, and legal issues. If privacy-preserving measures are provided, such data holders might decide to collaborate for better predictions. In this study, we investigate how to provide predictions based on vertically distributed data (VDD) among multiple parties without deeply jeopardizing their confidentiality. Users are first grouped into various clusters off-line using self-organizing map clustering while protecting the online vendors’ privacy. With privacy concerns, recommendations are produced based on partitioned data using a nearest neighbour prediction algorithm. We analyse our privacy-preserving scheme in terms of confidentiality and supplementary costs. Our analysis shows that our method offers recommendations without greatly exposing data holders’ privacy and causes negligible superfluous costs because of privacy concerns. To evaluate the scheme in terms of accuracy, we perform real-data-based experiments. Our experiment results demonstrate that the scheme is still able to provide truthful predictions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n6/abs/jors201176a.html