Social media marketing through time-aware collaborative filtering

被引:14
|
作者
De Maio, Carmen [1 ]
Fenza, Giuseppe [2 ]
Gallo, Mariacristina [1 ]
Loia, Vincenzo [2 ]
Parente, Mimmo [1 ]
机构
[1] Univ Salerno, Dipartimento Ingn Informaz Elettr & Matemat Appli, I-84084 Salerno, Italy
[2] Univ Salerno, Dipartimento Sci Aziendali Management & Innovat S, I-84084 Salerno, Italy
来源
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE | 2018年 / 30卷 / 01期
关键词
collaborative filtering; recommender system; social media marketing; time-awareness;
D O I
10.1002/cpe.4098
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Social media is assuming a crucial role in purchasing decisions, and most companies are using social media for marketing. Making sense of the unstructured information content shared by users along the time is an emerging challenge. We advise that the dynamic nature with which trends and user's interests evolve along the timeline requires the revising of well-assessed methods to address, for instance, recommendation provisioning, information retrieval, and so on. Time-awareness is crucial to more effectively estimate user's interests in the future to better address social media marketing attempting to increase the traction, for instance, posting the right message at the right time. This work defines time-aware collaborative filtering for estimating users' interest along the time in Twitter. It uses text analysis services to semantically annotate tweets' content and to track concepts considering post frequencies along the time. A model-based approach implementing K-Nearest Neighbors is used to estimate user's similarity representing their profile by sampling user's interest with three different techniques: Vectorial Representation, Symbolic Aggregation Approximation, and Median. We show the experimental results comparing these techniques and performing model training in different time windows. The proposed approach is used to address some social media marketing questions.
引用
收藏
页数:11
相关论文
共 50 条
  • [41] Item Attribute-aware Graph Collaborative Filtering
    Li, Anchen
    Liu, Xueyan
    Yang, Bo
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 238
  • [42] Recency Aware Collaborative Filtering for Next Basket Recommendation
    Faggioli, Guglielmo
    Polato, Mirko
    Aiolli, Fabio
    UMAP'20: PROCEEDINGS OF THE 28TH ACM CONFERENCE ON USER MODELING, ADAPTATION AND PERSONALIZATION, 2020, : 80 - 87
  • [43] Trust-Aware Collaborative Filtering with a Denoising Autoencoder
    Wang, Meiqi
    Wu, Zhiyuan
    Sun, Xiaoxin
    Feng, Guozhong
    Zhang, Bangzuo
    NEURAL PROCESSING LETTERS, 2019, 49 (02) : 835 - 849
  • [44] Location-aware neural graph collaborative filtering
    Li, Shengwen
    Sun, Chenpeng
    Chen, Renyao
    Li, Xinchuan
    Liang, Qingzhong
    Gong, Junfang
    Yao, Hong
    INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2022, 36 (08) : 1550 - 1574
  • [45] Fairness-aware Differentially Private Collaborative Filtering
    Yang, Zhenhuan
    Ge, Yingqiang
    Su, Congzhe
    Wang, Dingxian
    Zhao, Xiaoting
    Ying, Yiming
    COMPANION OF THE WORLD WIDE WEB CONFERENCE, WWW 2023, 2023, : 927 - 931
  • [46] Trust-Aware Collaborative Filtering with a Denoising Autoencoder
    Meiqi Wang
    Zhiyuan Wu
    Xiaoxin Sun
    Guozhong Feng
    Bangzuo Zhang
    Neural Processing Letters, 2019, 49 : 835 - 849
  • [47] Individual Diversity Preference Aware Neural Collaborative Filtering
    Liang, Guanzhong
    Wen, Junhao
    Zhou, Wei
    KNOWLEDGE-BASED SYSTEMS, 2022, 258
  • [48] Enriching one-class collaborative filtering with content information from social media
    Ting Yuan
    Jian Cheng
    Xi Zhang
    Qinshan Liu
    Hanqing Lu
    Multimedia Systems, 2016, 22 : 51 - 62
  • [49] TaDb: A time-aware diffusion-based recommender algorithm
    Li, Wen-Jun
    Xu, Yuan-Yuan
    Dong, Qiang
    Zhou, Jun-Lin
    Fu, Yan
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2015, 26 (09):
  • [50] Enhancing O-O Middleware to Become Time-Aware
    E. Nett
    M. Gergeleit
    M. Mock
    Real-Time Systems, 2001, 20 : 211 - 228