From Neighbors to Global Neighbors in Collaborative Filtering: an Evolutionary Optimization Approach
Identifieur interne : 002464 ( Hal/Curation ); précédent : 002463; suivant : 002465From Neighbors to Global Neighbors in Collaborative Filtering: an Evolutionary Optimization Approach
Auteurs : Amine Boumaza [France] ; Armelle Brun [France]Source :
English descriptors
Abstract
The accuracy of recommendations of collaborative filtering bas\-ed recommender systems mainly depends on which users (the neighbors) are exploited to estimate a user's ratings. We propose a new approach of neighbor selection, which adopts a global point of view. This approach defines a unique set of possible neighbors, shared by all users, referred to as Global Neighbors ($GN$). We view the problem of defining $GN$ as a combinatorial optimization problem and propose to use an evolutionary algorithm to tackle this search. Our aim is to find a relatively small $GN$ as the size of the resulting model, as well as the complexity of the computation of recommendations highly depend on the size of $GN$. We present experiments and results on a standard benchmark data-set from the recommender system community that support our choice of the evolutionary approach and show that it leads to a high accuracy of recommendations and a high coverage, while dramatically reducing the size of the model (by 84\%). We also show that the evolutionary approach produces results able to generate accurate recommendations to unseen users, while easily allowing the insertion of new users in the system with little overhead.
Url:
DOI: 10.1145/2330163.2330214
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002464
Links to Exploration step
Hal:hal-00778495Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">From Neighbors to Global Neighbors in Collaborative Filtering: an Evolutionary Optimization Approach</title>
<author><name sortKey="Boumaza, Amine" sort="Boumaza, Amine" uniqKey="Boumaza A" first="Amine" last="Boumaza">Amine Boumaza</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-157346" status="VALID"><orgName>Laboratoire d'Informatique Signal et Image de la Côte d'Opale</orgName>
<orgName type="acronym">LISIC</orgName>
<desc><address><addrLine>Maison de la Recherche Blaise Pascal 50, rue Ferdinand Buisson BP 719 62228 Calais Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www-lisic.univ-littoral.fr/</ref>
</desc>
<listRelation><relation name="EA4491" active="#struct-300278" type="direct"></relation>
</listRelation>
<tutelles><tutelle name="EA4491" active="#struct-300278" type="direct"><org type="institution" xml:id="struct-300278" status="VALID"><orgName>Université du Littoral Côte d'Opale</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Brun, Armelle" sort="Brun, Armelle" uniqKey="Brun A" first="Armelle" last="Brun">Armelle Brun</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-206039" status="VALID"><orgName>Knowledge Information and Web Intelligence</orgName>
<orgName type="acronym">KIWI</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/kiwi</ref>
</desc>
<listRelation><relation active="#struct-423090" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423090" type="direct"><org type="department" xml:id="struct-423090" status="VALID"><orgName>Department of Complex Systems, Artificial Intelligence & Robotics</orgName>
<orgName type="acronym">LORIA - AIS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/complex-system-and-artificial-intelligence</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00778495</idno>
<idno type="halId">hal-00778495</idno>
<idno type="halUri">https://hal.inria.fr/hal-00778495</idno>
<idno type="url">https://hal.inria.fr/hal-00778495</idno>
<idno type="doi">10.1145/2330163.2330214</idno>
<date when="2012-07-07">2012-07-07</date>
<idno type="wicri:Area/Hal/Corpus">002464</idno>
<idno type="wicri:Area/Hal/Curation">002464</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">From Neighbors to Global Neighbors in Collaborative Filtering: an Evolutionary Optimization Approach</title>
<author><name sortKey="Boumaza, Amine" sort="Boumaza, Amine" uniqKey="Boumaza A" first="Amine" last="Boumaza">Amine Boumaza</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-157346" status="VALID"><orgName>Laboratoire d'Informatique Signal et Image de la Côte d'Opale</orgName>
<orgName type="acronym">LISIC</orgName>
<desc><address><addrLine>Maison de la Recherche Blaise Pascal 50, rue Ferdinand Buisson BP 719 62228 Calais Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www-lisic.univ-littoral.fr/</ref>
</desc>
<listRelation><relation name="EA4491" active="#struct-300278" type="direct"></relation>
</listRelation>
<tutelles><tutelle name="EA4491" active="#struct-300278" type="direct"><org type="institution" xml:id="struct-300278" status="VALID"><orgName>Université du Littoral Côte d'Opale</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Brun, Armelle" sort="Brun, Armelle" uniqKey="Brun A" first="Armelle" last="Brun">Armelle Brun</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-206039" status="VALID"><orgName>Knowledge Information and Web Intelligence</orgName>
<orgName type="acronym">KIWI</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/kiwi</ref>
</desc>
<listRelation><relation active="#struct-423090" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423090" type="direct"><org type="department" xml:id="struct-423090" status="VALID"><orgName>Department of Complex Systems, Artificial Intelligence & Robotics</orgName>
<orgName type="acronym">LORIA - AIS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/complex-system-and-artificial-intelligence</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1145/2330163.2330214</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Iterated Local Search</term>
<term>Recommender Systems</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The accuracy of recommendations of collaborative filtering bas\-ed recommender systems mainly depends on which users (the neighbors) are exploited to estimate a user's ratings. We propose a new approach of neighbor selection, which adopts a global point of view. This approach defines a unique set of possible neighbors, shared by all users, referred to as Global Neighbors ($GN$). We view the problem of defining $GN$ as a combinatorial optimization problem and propose to use an evolutionary algorithm to tackle this search. Our aim is to find a relatively small $GN$ as the size of the resulting model, as well as the complexity of the computation of recommendations highly depend on the size of $GN$. We present experiments and results on a standard benchmark data-set from the recommender system community that support our choice of the evolutionary approach and show that it leads to a high accuracy of recommendations and a high coverage, while dramatically reducing the size of the model (by 84\%). We also show that the evolutionary approach produces results able to generate accurate recommendations to unseen users, while easily allowing the insertion of new users in the system with little overhead.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">From Neighbors to Global Neighbors in Collaborative Filtering: an Evolutionary Optimization Approach</title>
<author role="aut"><persName><forename type="first">Amine</forename>
<surname>Boumaza</surname>
</persName>
<email></email>
<idno type="halauthor">810631</idno>
<orgName ref="#struct-164505"></orgName>
<affiliation ref="#struct-157346"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Armelle</forename>
<surname>Brun</surname>
</persName>
<email>armelle.brun@loria.fr</email>
<idno type="halauthor">66694</idno>
<affiliation ref="#struct-206039"></affiliation>
</author>
<editor role="depositor"><persName><forename>Armelle</forename>
<surname>Brun</surname>
</persName>
<email>armelle.brun@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2013-01-20 17:15:32</date>
<date type="whenModified">2015-09-22 01:11:06</date>
<date type="whenReleased">2013-01-20 17:15:32</date>
<date type="whenProduced">2012-07-07</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="113400"><persName><forename>Armelle</forename>
<surname>Brun</surname>
</persName>
<email>armelle.brun@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-00778495</idno>
<idno type="halUri">https://hal.inria.fr/hal-00778495</idno>
<idno type="halBibtex">boumaza:hal-00778495</idno>
<idno type="halRefHtml">GECCO - Genetic and Evolutionary Computation Conference - 2012, Jul 2012, Philadelphia, United States. ACM, pp.345-352, 2012, Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference - GECCO'12. <10.1145/2330163.2330214></idno>
<idno type="halRef">GECCO - Genetic and Evolutionary Computation Conference - 2012, Jul 2012, Philadelphia, United States. ACM, pp.345-352, 2012, Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference - GECCO'12. <10.1145/2330163.2330214></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LITTORAL">Université du Littoral Côte d'Opale</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="LORIA-CSAI" p="LORIA">Systèmes complexes et intelligence artificielle</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">From Neighbors to Global Neighbors in Collaborative Filtering: an Evolutionary Optimization Approach</title>
<author role="aut"><persName><forename type="first">Amine</forename>
<surname>Boumaza</surname>
</persName>
<idno type="halAuthorId">810631</idno>
<orgName ref="#struct-164505"></orgName>
<affiliation ref="#struct-157346"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Armelle</forename>
<surname>Brun</surname>
</persName>
<email>armelle.brun@loria.fr</email>
<idno type="halAuthorId">66694</idno>
<affiliation ref="#struct-206039"></affiliation>
</author>
</analytic>
<monogr><meeting><title>GECCO - Genetic and Evolutionary Computation Conference - 2012</title>
<date type="start">2012-07-07</date>
<date type="end">2012-07-11</date>
<settlement>Philadelphia</settlement>
<country key="US">United States</country>
</meeting>
<imprint><publisher>ACM</publisher>
<biblScope unit="serie">Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference - GECCO'12</biblScope>
<biblScope unit="pp">345-352</biblScope>
<date type="datePub">2012-07-09</date>
</imprint>
</monogr>
<idno type="doi">10.1145/2330163.2330214</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">Iterated Local Search</term>
<term xml:lang="en">Recommender Systems</term>
</keywords>
<classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">The accuracy of recommendations of collaborative filtering bas\-ed recommender systems mainly depends on which users (the neighbors) are exploited to estimate a user's ratings. We propose a new approach of neighbor selection, which adopts a global point of view. This approach defines a unique set of possible neighbors, shared by all users, referred to as Global Neighbors ($GN$). We view the problem of defining $GN$ as a combinatorial optimization problem and propose to use an evolutionary algorithm to tackle this search. Our aim is to find a relatively small $GN$ as the size of the resulting model, as well as the complexity of the computation of recommendations highly depend on the size of $GN$. We present experiments and results on a standard benchmark data-set from the recommender system community that support our choice of the evolutionary approach and show that it leads to a high accuracy of recommendations and a high coverage, while dramatically reducing the size of the model (by 84\%). We also show that the evolutionary approach produces results able to generate accurate recommendations to unseen users, while easily allowing the insertion of new users in the system with little overhead.</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002464 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 002464 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Hal |étape= Curation |type= RBID |clé= Hal:hal-00778495 |texte= From Neighbors to Global Neighbors in Collaborative Filtering: an Evolutionary Optimization Approach }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |