Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur Sumit Sarkar
Documents disponibles écrits par cet auteur
Affiner la rechercheAccelerated learning of user profiles / Pelin Atahan in Management science, Vol. 57 N° 2 (Février 2011)
[article]
in Management science > Vol. 57 N° 2 (Février 2011) . - pp. 215-239
Titre : Accelerated learning of user profiles Type de document : texte imprimé Auteurs : Pelin Atahan, Auteur ; Sumit Sarkar, Auteur Année de publication : 2011 Article en page(s) : pp. 215-239 Note générale : Management Langues : Anglais (eng) Mots-clés : Personalization Bayesian learning Information theory Recommendation systems Index. décimale : 658 Organisation des entreprises. Techniques du commerce Résumé : Websites typically provide several links on each page visited by a user. Whereas some of these links help users easily navigate the site, others are typically used to provide targeted recommendations based on the available user profile. When the user profile is not available (or is inadequate), the site cannot effectively target products, promotions, and advertisements. In those situations, the site can learn the profile of a user as the user traverses the site. Naturally, the faster the site can learn a user's profile, the sooner the site can benefit from personalization. We develop a technique that sites can use to learn the profile as quickly as possible. The technique identifies links for sites to make available that will lead to a more informative profile when the user chooses one of the offered links. Experiments conducted using our approach demonstrate that it enables learning the profiles markedly better after very few user interactions as compared to benchmark approaches. The approach effectively learns multiple attributes simultaneously, can learn well classes that have highly skewed priors, and remains quite effective even when the distribution of link profiles at a site is relatively homogeneous. The approach works particularly well when a user's traversal is influenced by the most recently visited pages on a site. Finally, we show that the approach is robust to noise in the estimates for the probability parameters needed for its implementation. DEWEY : 658 ISSN : 0025-1909 En ligne : http://mansci.journal.informs.org/cgi/content/abstract/57/2/215 [article] Accelerated learning of user profiles [texte imprimé] / Pelin Atahan, Auteur ; Sumit Sarkar, Auteur . - 2011 . - pp. 215-239.
Management
Langues : Anglais (eng)
in Management science > Vol. 57 N° 2 (Février 2011) . - pp. 215-239
Mots-clés : Personalization Bayesian learning Information theory Recommendation systems Index. décimale : 658 Organisation des entreprises. Techniques du commerce Résumé : Websites typically provide several links on each page visited by a user. Whereas some of these links help users easily navigate the site, others are typically used to provide targeted recommendations based on the available user profile. When the user profile is not available (or is inadequate), the site cannot effectively target products, promotions, and advertisements. In those situations, the site can learn the profile of a user as the user traverses the site. Naturally, the faster the site can learn a user's profile, the sooner the site can benefit from personalization. We develop a technique that sites can use to learn the profile as quickly as possible. The technique identifies links for sites to make available that will lead to a more informative profile when the user chooses one of the offered links. Experiments conducted using our approach demonstrate that it enables learning the profiles markedly better after very few user interactions as compared to benchmark approaches. The approach effectively learns multiple attributes simultaneously, can learn well classes that have highly skewed priors, and remains quite effective even when the distribution of link profiles at a site is relatively homogeneous. The approach works particularly well when a user's traversal is influenced by the most recently visited pages on a site. Finally, we show that the approach is robust to noise in the estimates for the probability parameters needed for its implementation. DEWEY : 658 ISSN : 0025-1909 En ligne : http://mansci.journal.informs.org/cgi/content/abstract/57/2/215