Effective contact recommendation in social networks by adaptation of information retrieval models. Issue 5 (September 2020)
- Record Type:
- Journal Article
- Title:
- Effective contact recommendation in social networks by adaptation of information retrieval models. Issue 5 (September 2020)
- Main Title:
- Effective contact recommendation in social networks by adaptation of information retrieval models
- Authors:
- Sanz-Cruzado, Javier
Castells, Pablo
Macdonald, Craig
Ounis, Iadh - Abstract:
- Highlights: IR models can be adapted as standalone algorithms to effectively recommend contacts in social networks. IR models are shown to be even more effective as neighbor selection methods in kNN. We achieve further effectiveness enhancements by learning to rank upon IR models. We test the researched approaches extensively in five network samples of different kind from Twitter and Facebook. Abstract: We investigate a novel perspective to the development of effective algorithms for contact recommendation in social networks, where the problem consists of automatically predicting people that a given user may wish or benefit from connecting to in the network. Specifically, we explore the connection between contact recommendation and the text information retrieval (IR) task, by investigating the adaptation of IR models (classical and supervised) for recommending people in social networks, using only the structure of these networks. We first explore the use of adapted unsupervised IR models as direct standalone recommender systems. Seeking additional effectiveness enhancements, we further explore the use of IR models as neighbor selection methods, in place of common similarity measures, in user-based and item-based nearest-neighbors (kNN) collaborative filtering approaches. On top of this, we investigate the application of learning to rank approaches borrowed from text IR to achieve additional improvements. We report thorough experiments over data obtained from Twitter andHighlights: IR models can be adapted as standalone algorithms to effectively recommend contacts in social networks. IR models are shown to be even more effective as neighbor selection methods in kNN. We achieve further effectiveness enhancements by learning to rank upon IR models. We test the researched approaches extensively in five network samples of different kind from Twitter and Facebook. Abstract: We investigate a novel perspective to the development of effective algorithms for contact recommendation in social networks, where the problem consists of automatically predicting people that a given user may wish or benefit from connecting to in the network. Specifically, we explore the connection between contact recommendation and the text information retrieval (IR) task, by investigating the adaptation of IR models (classical and supervised) for recommending people in social networks, using only the structure of these networks. We first explore the use of adapted unsupervised IR models as direct standalone recommender systems. Seeking additional effectiveness enhancements, we further explore the use of IR models as neighbor selection methods, in place of common similarity measures, in user-based and item-based nearest-neighbors (kNN) collaborative filtering approaches. On top of this, we investigate the application of learning to rank approaches borrowed from text IR to achieve additional improvements. We report thorough experiments over data obtained from Twitter and Facebook where we observe that IR models, particularly BM25, are competitive compared to state-of-the art contact recommendation methods. We provide further empirical analysis of the additional effectiveness that can be achieved by the integration of IR models into kNN and learning to rank schemes. Our research shows that the IR models are effective in three roles: as direct contact recommenders, as neighbor selectors in collaborative filtering and as samplers and features in learning to rank. … (more)
- Is Part Of:
- Information processing & management. Volume 57:Issue 5(2020:Sep.)
- Journal:
- Information processing & management
- Issue:
- Volume 57:Issue 5(2020:Sep.)
- Issue Display:
- Volume 57, Issue 5 (2020)
- Year:
- 2020
- Volume:
- 57
- Issue:
- 5
- Issue Sort Value:
- 2020-0057-0005-0000
- Page Start:
- Page End:
- Publication Date:
- 2020-09
- Subjects:
- Social networks -- Contact recommendation -- Information retrieval models -- k nearest neighbors -- Learning to rank -- Collaborative filtering
Information storage and retrieval systems -- Periodicals
Information science -- Periodicals
Systèmes d'information -- Périodiques
Sciences de l'information -- Périodiques
Information science
Information storage and retrieval systems
Periodicals
658.4038 - Journal URLs:
- http://www.sciencedirect.com/science/journal/03064573 ↗
http://www.elsevier.com/journals ↗ - DOI:
- 10.1016/j.ipm.2020.102285 ↗
- Languages:
- English
- ISSNs:
- 0306-4573
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 4493.893000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 13513.xml