Discovering items with potential popularity on social media
April 05, 2016 Β· Declared Dead Β· π 2016 IEEE 14th Intl Conf on Dependable, Autonomic and Secure Computing, 14th Intl Conf on Pervasive Intelligence and Computing, 2nd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Khushnood Abbas, Shang Mingsheng, Luo Xin
arXiv ID
1604.01131
Category
cs.IR: Information Retrieval
Cross-listed
cs.SI
Citations
4
Venue
2016 IEEE 14th Intl Conf on Dependable, Autonomic and Secure Computing, 14th Intl Conf on Pervasive Intelligence and Computing, 2nd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)
Last Checked
4 months ago
Abstract
Predicting the future popularity of online content is highly important in many applications. Preferential attachment phenomena is encountered in scale free networks.Under it's influece popular items get more popular thereby resulting in long tailed distribution problem. Consequently, new items which can be popular (potential ones), are suppressed by the already popular items. This paper proposes a novel model which is able to identify potential items. It identifies the potentially popular items by considering the number of links or ratings it has recieved in recent past along with it's popularity decay. For obtaining an effecient model we consider only temporal features of the content, avoiding the cost of extracting other features. We have found that people follow recent behaviours of their peers. In presence of fit or quality items already popular items lose it's popularity. Prediction accuracy is measured on three industrial datasets namely Movielens, Netflix and Facebook wall post. Experimental results show that compare to state-of-the-art model our model have better prediction accuracy.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Information Retrieval
R.I.P.
π»
Ghosted
π
π
Old Age
Neural Graph Collaborative Filtering
R.I.P.
π»
Ghosted
DeepFM: A Factorization-Machine based Neural Network for CTR Prediction
R.I.P.
π»
Ghosted
BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer
R.I.P.
π
404 Not Found
Graph Neural Networks for Social Recommendation
R.I.P.
π»
Ghosted
Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted