Small Clues Tell: a Collaborative Expansion Approach for Effective Content-Based Recommendations

IF 2 4区 管理学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yen-Hsien Lee, Chih-Ping Wei, P. H. Hu, T. Cheng, Ci-Wei Lan
{"title":"Small Clues Tell: a Collaborative Expansion Approach for Effective Content-Based Recommendations","authors":"Yen-Hsien Lee, Chih-Ping Wei, P. H. Hu, T. Cheng, Ci-Wei Lan","doi":"10.1080/10919392.2020.1718056","DOIUrl":null,"url":null,"abstract":"ABSTRACT Content-based recommendation techniques usually require a large number of training examples for model construction, which however may not always be available in many real-world scenarios. To address the training data availability constraint common to the content-based approach, we develop a collaborative expansion-based approach to expand the size of training examples, which could lead to improved content-based recommendations. We use a book rating data set collected from Amazon to evaluate our proposed method and compare its performance against those of two salient benchmark techniques. The results show that our method outperforms the benchmark techniques consistently and significantly. Our method expands the size of training examples for a focal customer by leveraging the available preferences of his or her referent group, and thereby better supports personalized recommendations than existing techniques that solely follow content-based or collaborative filtering, without incurring costs to identify, collect, and analyze additional information. This study reveals the value and feasibility of collaborative expansion as a viable means to increase training size for the focal customer and thus address the training data availability constraint that seriously hinders the performance of content-based recommender systems.","PeriodicalId":54777,"journal":{"name":"Journal of Organizational Computing and Electronic Commerce","volume":"30 1","pages":"111 - 128"},"PeriodicalIF":2.0000,"publicationDate":"2020-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/10919392.2020.1718056","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Organizational Computing and Electronic Commerce","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/10919392.2020.1718056","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 7

Abstract

ABSTRACT Content-based recommendation techniques usually require a large number of training examples for model construction, which however may not always be available in many real-world scenarios. To address the training data availability constraint common to the content-based approach, we develop a collaborative expansion-based approach to expand the size of training examples, which could lead to improved content-based recommendations. We use a book rating data set collected from Amazon to evaluate our proposed method and compare its performance against those of two salient benchmark techniques. The results show that our method outperforms the benchmark techniques consistently and significantly. Our method expands the size of training examples for a focal customer by leveraging the available preferences of his or her referent group, and thereby better supports personalized recommendations than existing techniques that solely follow content-based or collaborative filtering, without incurring costs to identify, collect, and analyze additional information. This study reveals the value and feasibility of collaborative expansion as a viable means to increase training size for the focal customer and thus address the training data availability constraint that seriously hinders the performance of content-based recommender systems.
小线索告诉:有效的基于内容的推荐的协作扩展方法
基于内容的推荐技术通常需要大量的训练样例来构建模型,然而在许多现实场景中并不总是可用的。为了解决基于内容的方法常见的训练数据可用性约束,我们开发了一种基于协作扩展的方法来扩展训练示例的大小,这可能导致改进的基于内容的推荐。我们使用从Amazon收集的图书评级数据集来评估我们提出的方法,并将其性能与两种显著的基准测试技术进行比较。结果表明,我们的方法持续且显著地优于基准测试技术。我们的方法通过利用他或她的参考群体的可用偏好来扩展焦点客户的训练示例的大小,因此比现有的仅遵循基于内容或协作过滤的技术更好地支持个性化推荐,而不会产生识别、收集和分析额外信息的成本。本研究揭示了协作扩展作为增加焦点客户训练规模的可行手段的价值和可行性,从而解决了严重阻碍基于内容的推荐系统性能的训练数据可用性约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Organizational Computing and Electronic Commerce
Journal of Organizational Computing and Electronic Commerce 工程技术-计算机:跨学科应用
CiteScore
5.80
自引率
17.20%
发文量
7
审稿时长
>12 weeks
期刊介绍: The aim of the Journal of Organizational Computing and Electronic Commerce (JOCEC) is to publish quality, fresh, and innovative work that will make a difference for future research and practice rather than focusing on well-established research areas. JOCEC publishes original research that explores the relationships between computer/communication technology and the design, operations, and performance of organizations. This includes implications of the technologies for organizational structure and dynamics, technological advances to keep pace with changes of organizations and their environments, emerging technological possibilities for improving organizational performance, and the many facets of electronic business. Theoretical, experimental, survey, and design science research are all welcome and might look at: • E-commerce • Collaborative commerce • Interorganizational systems • Enterprise systems • Supply chain technologies • Computer-supported cooperative work • Computer-aided coordination • Economics of organizational computing • Technologies for organizational learning • Behavioral aspects of organizational computing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信