DocumentCode :
131298
Title :
Analiysis of self-similarity in recommender systems
Author :
Aghdam, Mehdi Hosseinzadeh ; Analoui, Morteza ; Kabiri, Peyman
Author_Institution :
Sch. of Comput. Eng., Iran Univ. of Sci. & Technol., Tehran, Iran
fYear :
2014
fDate :
4-6 Feb. 2014
Firstpage :
1
Lastpage :
4
Abstract :
The objective of recommender systems is to estimate the unknown ratings. This paper presents an efficient method to generate the self-similarity rating matrix for recommender systems. We show that the rating behavior of users is statistically self-similar that none of the commonly used recommender system models is able to detect this fractal behavior. This behavior can be used to predict the unknown ratings. The experimental results showed that the proposed method obtains similar accuracy in comparison to the traditional recommender system method with much less computational cost.
Keywords :
recommender systems; fractal behavior; recommender systems; self-similarity analysis; self-similarity rating matrix; unknown rating estimation; user rating behavior; Collaboration; Computers; Educational institutions; Recommender systems; Sparse matrices; Vectors; Hurst Factor; rating sequence; recommender system; self-similarity;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems (ICIS), 2014 Iranian Conference on
Conference_Location :
Bam
Print_ISBN :
978-1-4799-3350-1
Type :
conf
DOI :
10.1109/IranianCIS.2014.6802568
Filename :
6802568
Link To Document :
بازگشت