Computer Science ›› 2020, Vol. 47 ›› Issue (2): 31-36.doi: 10.11896/jsjkx.190500130

• Database & Big Data & Data Science • Previous Articles     Next Articles

New Similarity Measure Based on Extremely Rating Behavior

FENG Chen-jiao1,2,LIANG Ji-ye1,SONG Peng3,WANG Zhi-qiang1   

  1. (Key Laboratory of Computation Intelligence & Chinese Information Processing (Shanxi University),Ministry of Education,Taiyuan 030006,China)1;
    (College of Applied Mathematics,Shanxi University of Finance and Economics,Taiyuan 030006,China)2;
    (School of Economics and Management,Shanxi University,Taiyuan 030006,China)3
  • Received:2019-05-23 Online:2020-02-15 Published:2020-03-18
  • About author:FENG Chen-jiao,born in 1977,doctorial student,lecturer,is member of China Computer Federation.Her main research interests include data mining,big data correlation analysis and recommender systems;LIANG Ji-ye,born in 1962,Ph.D,professor,Ph.D supervisor,is member of China Computer Federation.His main research interests include granular computing,data mining and machine learning.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61876103), Projects of Key Research and Development Plan of Shanxi Province (201603D111014), Research Project Supported by Shanxi Scholarship Council of China (2017-005) and 1331 Engineering Project of Shanxi Province, China.

Abstract: With the rapid development of Internet technology,drastic Internet information explosion makes information overload as an increasingly serious problem.Faced with the massive Internet information,users consume a lot of time to search for information or products,but the search solution is constrained.The recommender systems is hence proposed to address the problem of information overload.The recommender systems use users’ historical behaviors to speculate their needs,interests,etc.,and recommend the information and products users may be interested in.As an important type of recommendation approach,the memory-based collaborative filtering methods establish the rating prediction function based on neighbor information of the user or pro-duct.The essence of the function is to precisely measure the similarity between users or products.The traditional similarity mea-sures such as Pearson,Cosin and Spearman rank correlation coefficients,only take into account the linear relationship between users,while the heuristic similarities,such as the PIP measurement based on three special factors and its improved version,only depict the non-liner relationship between users.Indeed,in the recommender systems,it is neither the linear relation nor the non-linear relation is good for measuring the similarity between users.In order to describe the similarity among users more finely,this paper proposed a similarity measure index of the correlation level considering the extreme rating behaviors based on anonli-near function.By integrating this index with the traditional linear correlation coefficients,this paper constructed a novel similarity measure.Comparative experiments were conducted to test the practicability and validity of the proposed approach on Ml (100k) and Ml-latest-small datasets.The results demonstrate that the proposed method performs better judged by indicators of MAE and RMSE.

Key words: Collaborative filtering, Extremely rating behavior, Memory-based collaborative filtering, Recommender systems, Similarity

CLC Number: 

  • TP182
[1]GOLDBERG D,NICHOLS D,OKIB M,et al.Using collaborative filtering to weave an information tapestry[J].Communications of ACM,1992,35(12):61-70.
[2]RESNICK P,VARIAN H R.Recommender systems[J].Communications of ACM,1997,40(3):56-58.
[3]ZENEBE A,NORCIO A F.Representation:Similarity measures and aggregation methods using fuzzy sets for content-based re-commender systems[J].Fuzzy Sets and Systems,2009,160(1):76-94.
[4]SCHAFER J B,KONSTAN J A,RIEDL J.E-commerce recommendation applications[J].Data Mining and Knowledge Disco-very,2001,5(1/2):115-153.
[5]BOBADILLA J,ORTEGA F,HERNANDO A,et al.Recom-mender systems survey[J].Knowledge-Based Systems,2013,46(1):109-132.
[6]AAMIR M,BHUSRY M.Recommendation system:State of the art approach[J].International Journal of Computer Applications,2015,120:25-32.
[7]XIAO Y Y,ZHANG H Y.Friend recommendation method based on users’latent features in social networks[J].Computer Science,2018,45(3):220-254.
[8]ZHANG S,YAO L,SUN A,et al.Deep learning based recommender system:A survey and new perspectives [J].ACM Computing Surveys,2017,1(1):1-35.
[9]HANG L V,JIANG B T,LV S Y,et al.Survey on deep learning based recommender systems[J].Chinese Journal of Computers,2018,41(7):191-219.
[10]HSU C C,YEH M Y,LIN S D.A general framework for impli-cit and explicit social recommendation[J].IEEE Transactions on Knowledge and Data Engineering,2018,14(8):1-14.
[11]KATZMAN J,SHAHAM U,BATES J,et al.DeepSurv:perso-nalized treatment recommender system using a cox proportional hazards deep neural network[J].Bmc Medical Research Metho-dology,2016,18(1):24.
[12]QUADRANA M,CREMONESI P,JANNACH D.Sequence-aware recommender systems[J].ACM Computing Surveys,2018,51(4):373-374.
[13]BREESE J S,HECKERMAN D,KADIE C.Empirical analysis of predictive algorithms for collaborative filtering[J].Uncertainty in Artificial Intelligence,2013,98(7):43-52.
[14]SU X Y,KHOSHGOFTAAR T M.A survey of collaborative filtering techniques[J].Advances in Artificial Intelligence,2012,2009(12):1-19.
[15]SHI Y,LARSON M,HANJALIC A.Collaborative filtering beyond the user-item matrix:A survey of the state of the art and future challenges[J].ACM Computing Surveys,2014,47(1):1-45.
[16]LEE S.Using entropy for similarity measures in collaborative filtering[J/OL].Journal of Ambient Intelligence and Humanized Computing,2019.
[17]HE X,HE Z,SONG J,et al.NAIS:Neural attentive item similarity model for recommendation[J].IEEE Transactions on Knowledge and Data Engineering,2018,30(12):2354-2366.
[18]LIAN D,GE Y,ZHANG F,et al.Scalable content-aware colla-borative filtering for location recommendation[J].IEEE Transa-ctions on Knowledge and Data Engineering,2018,30(6):1122- 1135.
[19]SARWAR B M,KARYPIS G,KONSTAN J A,et al. Analysis of recommendation algorithms for e-commerce[C]∥Proceedings of ACM E-Commerce.Minneapolis,Minn,USA,2000:158-167.
[20]RESNICK P,IACOVOU N,SUCHAK M,et al.Grouplens:An open architecture for collaborative filtering of netnews[C]∥Proceedings of the ACM Conference on Computer Supported Cooperative Work.New York:ACM Press,1994:175-186.
[21]SHARDANAND U,MAES P.Social information filtering:algorithm for automating’ word of mouth’[C]∥Proceedings of ACM CHI’95 Conference on Human Factors in Computing Systems.New York:ACM Press,1995:210-217.
[22]KENDALL M G.Rank correlation methods[J].British Journal of Psychology,1990,25(1):86-91.
[23]AHN H J.A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem[J].Information Sciences,2008,178(1):37-51.
[24]LIU H,ZHENG H,MIAN A,et al.A new user similarity model to improve the accuracy of collaborative filtering[J].Knowledge-Based Systems,2014,56(3):156-166.
[25]HERLOCKER J L,KONSTAN J A,BORCHERS A,et al.An algorithmic framework for performing collaborative filtering[C]∥Proceedings of the SIGIR ’99 International ACM SIGIR Conference on Research and Development in Information Retrieval.New York:ACM Press,1999:230-237.
[26]JAMALI M,ESTER M.TrustWalker:A random walk model for combining trust-based and item-based recommendation[C]∥Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York:ACM Press,2009:397-406.
[1] CHENG Zhang-tao, ZHONG Ting, ZHANG Sheng-ming, ZHOU Fan. Survey of Recommender Systems Based on Graph Learning [J]. Computer Science, 2022, 49(9): 1-13.
[2] WANG Guan-yu, ZHONG Ting, FENG Yu, ZHOU Fan. Collaborative Filtering Recommendation Method Based on Vector Quantization Coding [J]. Computer Science, 2022, 49(9): 48-54.
[3] CHAI Hui-min, ZHANG Yong, FANG Min. Aerial Target Grouping Method Based on Feature Similarity Clustering [J]. Computer Science, 2022, 49(9): 70-75.
[4] ZHENG Wen-ping, LIU Mei-lin, YANG Gui. Community Detection Algorithm Based on Node Stability and Neighbor Similarity [J]. Computer Science, 2022, 49(9): 83-91.
[5] WU Zi-yi, LI Shao-mei, JIANG Meng-han, ZHANG Jian-peng. Ontology Alignment Method Based on Self-attention [J]. Computer Science, 2022, 49(9): 215-220.
[6] LI Bin, WAN Yuan. Unsupervised Multi-view Feature Selection Based on Similarity Matrix Learning and Matrix Alignment [J]. Computer Science, 2022, 49(8): 86-96.
[7] SUN Xiao-han, ZHANG Li. Collaborative Filtering Recommendation Algorithm Based on Rating Region Subspace [J]. Computer Science, 2022, 49(7): 50-56.
[8] ZENG Zhi-xian, CAO Jian-jun, WENG Nian-feng, JIANG Guo-quan, XU Bin. Fine-grained Semantic Association Video-Text Cross-modal Entity Resolution Based on Attention Mechanism [J]. Computer Science, 2022, 49(7): 106-112.
[9] HUANG Shao-bin, SUN Xue-wei, LI Rong-sheng. Relation Classification Method Based on Cross-sentence Contextual Information for Neural Network [J]. Computer Science, 2022, 49(6A): 119-124.
[10] CAI Xiao-juan, TAN Wen-an. Improved Collaborative Filtering Algorithm Combining Similarity and Trust [J]. Computer Science, 2022, 49(6A): 238-241.
[11] WANG Yi, LI Zheng-hao, CHEN Xing. Recommendation of Android Application Services via User Scenarios [J]. Computer Science, 2022, 49(6A): 267-271.
[12] HE Yi-chen, MAO Yi-jun, XIE Xian-fen, GU Wan-rong. Matrix Transformation and Factorization Based on Graph Partitioning by Vertex Separator for Recommendation [J]. Computer Science, 2022, 49(6A): 272-279.
[13] GUO Liang, YANG Xing-yao, YU Jiong, HAN Chen, HUANG Zhong-hao. Hybrid Recommender System Based on Attention Mechanisms and Gating Network [J]. Computer Science, 2022, 49(6): 158-164.
[14] CHENG Ke-yang, WANG Ning, CUI Hong-gang, ZHAN Yong-zhao. Interpretability Optimization Method Based on Mutual Transfer of Local Attention Map [J]. Computer Science, 2022, 49(5): 64-70.
[15] CHEN Zhuang, ZOU Hai-tao, ZHENG Shang, YU Hua-long, GAO Shang. Diversity Recommendation Algorithm Based on User Coverage and Rating Differences [J]. Computer Science, 2022, 49(5): 159-164.
Full text



No Suggested Reading articles found!