{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T22:37:43Z","timestamp":1774737463629,"version":"3.50.1"},"reference-count":31,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T00:00:00Z","timestamp":1457308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,3,7]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>\u2013 Collaborative recommender systems play a crucial role in providing personalized services to online consumers. Most online shopping sites and many other applications now use the collaborative recommender systems. The measurement of the similarity plays a fundamental role in collaborative recommender systems. Some of the most well-known similarity measures are: Pearson\u2019s correlation coefficient, cosine similarity and mean squared differences. However, due to data sparsity, accuracy of the above similarity measures decreases, which makes the formation of inaccurate neighborhood, thereby resulting in poor recommendations. The purpose of this paper is to propose a novel similarity measure based on potential field.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>\u2013 The proposed approach constructs a dense matrix: user-user potential matrix, and uses this matrix to compute potential similarities between users. Then the potential similarities are modified based on users\u2019 preliminary neighborhoods, and<jats:italic>k<\/jats:italic>users with the highest modified similarity values are selected as the active user\u2019s nearest neighbors. Compared to the rating matrix, the potential matrix is much denser. Thus, the sparsity problem can be efficiently alleviated. The similarity modification scheme considers the number of common neighbors of two users, which can further improve the accuracy of similarity computation.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>\u2013 Experimental results show that the proposed approach is superior to the traditional similarity measures.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>\u2013 The research highlights of this paper are as follows: the authors construct a dense matrix: user-user potential matrix, and use this matrix to compute potential similarities between users; the potential similarities are modified based on users\u2019 preliminary neighborhoods, and<jats:italic>k<\/jats:italic>users with the highest modified similarity values are selected as the active user\u2019s nearest neighbors; and the proposed approach performs better than the traditional similarity measures. The manuscript will be of particular interests to the scientists interested in recommender systems research as well as to readers interested in solution of related complex practical engineering problems.<\/jats:p><\/jats:sec>","DOI":"10.1108\/k-10-2014-0212","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T12:25:27Z","timestamp":1456748727000},"page":"434-445","source":"Crossref","is-referenced-by-count":13,"title":["A collaborative filtering similarity measure based on potential field"],"prefix":"10.1108","volume":"45","author":[{"given":"Yajun","family":"Leng","sequence":"first","affiliation":[]},{"given":"Qing","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Changyong","family":"Liang","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2020121800281934700_b1","doi-asserted-by":"crossref","unstructured":"Adomavicius, G. and Tuzhilin, A. (2005), \u201cToward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions\u201d, IEEE Transactions on Knowledge and Data Engineering , Vol. 17 No. 6, pp. 734-749.","DOI":"10.1109\/TKDE.2005.99"},{"key":"key2020121800281934700_b2","doi-asserted-by":"crossref","unstructured":"Ahn, H.J. (2008), \u201cA new similarity measure for collaborative filtering to alleviate the new user cold-starting problem\u201d, Information Sciences , Vol. 178 No. 1, pp. 37-51.","DOI":"10.1016\/j.ins.2007.07.024"},{"key":"key2020121800281934700_b3","doi-asserted-by":"crossref","unstructured":"Albadvi, A. and Shahbazi, M. (2009), \u201cA hybrid recommendation technique based on product category attributes\u201d, Expert Systems with Applications , Vol. 36 No. 9, pp. 11480-11488.","DOI":"10.1016\/j.eswa.2009.03.046"},{"key":"key2020121800281934700_b5","doi-asserted-by":"crossref","unstructured":"Bobadilla, J. , Ortega, F. and Hernando, A. (2012a), \u201cA collaborative filtering similarity measure based on singularities\u201d, Information Processing and Management , Vol. 48 No. 2, pp. 204-217.","DOI":"10.1016\/j.ipm.2011.03.007"},{"key":"key2020121800281934700_b4","doi-asserted-by":"crossref","unstructured":"Bobadilla, J. , Hernando, A. , Ortega, F. and Guti\u00e9rrez, A. (2012b), \u201cCollaborative filtering based on significances\u201d, Information Sciences , Vol. 185 No. 1, pp. 1-17.","DOI":"10.1016\/j.ins.2011.09.014"},{"key":"key2020121800281934700_b6","unstructured":"Deng, A. , Zhu, Y. and Shi, B. (2003), \u201cA collaborative filtering recommendation algorithm based on item rating prediction\u201d, Journal of Software , Vol. 14 No. 9, pp. 1621-1628."},{"key":"key2020121800281934700_b7","doi-asserted-by":"crossref","unstructured":"Hatamlou, A. , Abdullah, S. and Nezamabadi-pour, H. (2012), \u201cA combined approach for clustering based on k-means and gravitational search algorithms\u201d, Swarm and Evolutionary Computation , Vol. 6, pp. 47-52.","DOI":"10.1016\/j.swevo.2012.02.003"},{"key":"key2020121800281934700_b8","unstructured":"Holliday, D. , Resnick, R. and Walker, J. (1993), Fundamentals of Physics , John Wiley and Sons, New York, NY."},{"key":"key2020121800281934700_b9","doi-asserted-by":"crossref","unstructured":"Kim, H.N. , EI Saddik, A. and Jo, G.S. (2011), \u201cCollaborative error-reflected models for cold-start recommender systems\u201d, Decision Support Systems , Vol. 51 No. 3, pp. 519-531.","DOI":"10.1016\/j.dss.2011.02.015"},{"key":"key2020121800281934700_b10","doi-asserted-by":"crossref","unstructured":"Kim, H.N. , Ji, A.T. , Ha, I. and Jo, G.S. (2010), \u201cCollaborative filtering based on collaborative tagging for enhancing the quality of recommendation\u201d, Electronic Commerce Research and Applications , Vol. 9 No. 1, pp. 73-83.","DOI":"10.1016\/j.elerap.2009.08.004"},{"key":"key2020121800281934700_b11","doi-asserted-by":"crossref","unstructured":"Lee, T.Q. , Park, Y. and Park, Y.T. (2009), \u201cAn empirical study on effectiveness of temporal information as implicit ratings\u201d, Expert Systems with Applications , Vol. 36 No. 2, pp. 1315-1321.","DOI":"10.1016\/j.eswa.2007.11.047"},{"key":"key2020121800281934700_b12","doi-asserted-by":"crossref","unstructured":"Leung, C.W.K. , Chan, S.C.F. and Chung, F.L. (2006), \u201cA collaborative filtering framework based on fuzzy association rules and multiple-level similarity\u201d, Knowledge and Information Systems , Vol. 10 No. 3, pp. 357-381.","DOI":"10.1007\/s10115-006-0002-1"},{"key":"key2020121800281934700_b14","doi-asserted-by":"crossref","unstructured":"Liu, D.R. and Liou, C.H. (2011), \u201cMobile commerce product recommendations based on hybrid multiple channels\u201d, Electronic Commerce Research and Applications , Vol. 10 No. 1, pp. 94-104.","DOI":"10.1016\/j.elerap.2010.08.004"},{"key":"key2020121800281934700_b13","doi-asserted-by":"crossref","unstructured":"Liu, D.R. , Lai, C.H. and Lee, W.J. (2009), \u201cA hybrid of sequential rules and collaborative filtering for product recommendation\u201d, Information Sciences , Vol. 179 No. 20, pp. 3505-3519.","DOI":"10.1016\/j.ins.2009.06.004"},{"key":"key2020121800281934700_b15","doi-asserted-by":"crossref","unstructured":"Lu, Y. and Wan, Y. (2012), \u201cClustering by sorting potential values (CSPV): a novel potential-based clustering method\u201d, Pattern Recognition , Vol. 45 No. 9, pp. 3512-3522.","DOI":"10.1016\/j.patcog.2012.02.035"},{"key":"key2020121800281934700_b16","doi-asserted-by":"crossref","unstructured":"Lu, Y. and Wan, Y. (2013), \u201cPHA: a fast potential-based hierarchical agglomerative clustering method\u201d, Pattern Recognition , Vol. 46 No. 5, pp. 1227-1239.","DOI":"10.1016\/j.patcog.2012.11.017"},{"key":"key2020121800281934700_b17","doi-asserted-by":"crossref","unstructured":"Luo, H. , Niu, C.Y. , Shen, R.M. and Ullrich, C. (2008), \u201cA collaborative filtering framework based on both local user similarity and global user similarity\u201d, Machine Learning , Vol. 72 No. 3, pp. 231-245.","DOI":"10.1007\/s10994-008-5068-4"},{"key":"key2020121800281934700_b18","doi-asserted-by":"crossref","unstructured":"Papagelis, M. , Plexousakis, D. and Kutsuras, T. (2005), \u201cAlleviation the sparsity problem of collaborative filtering using trust inferences\u201d, Proceedings of the 3rd International Conference on Trust Management, pp. 224-239.","DOI":"10.1007\/11429760_16"},{"key":"key2020121800281934700_b19","doi-asserted-by":"crossref","unstructured":"Qin, G. and Gao, L. (2010), \u201cSpectral clustering for detecting protein complexes in protein-protein interaction (PPI) networks\u201d, Mathematical and Computer Modelling , Vol. 52 Nos 11\/12, pp. 2066-2074.","DOI":"10.1016\/j.mcm.2010.06.015"},{"key":"key2020121800281934700_b20","doi-asserted-by":"crossref","unstructured":"Rashedi, E. , Nezamabadi-pour, H. and Saryazdi, S. (2009), \u201cGSA: a gravitational search algorithm\u201d, Information Sciences , Vol. 179 No. 13, pp. 2232-2248.","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"key2020121800281934700_b21","doi-asserted-by":"crossref","unstructured":"Resnick, P. , Iacovou, N. , Suchak, M. , Bergstrom, P. and Riedl, J. (1994), \u201cGroupLens: an open architecture for collaborative filtering of netnews\u201d, Proceedings of ACM 1994 Conference on Computer Supported Cooperative Work, pp. 175-186.","DOI":"10.1145\/192844.192905"},{"key":"key2020121800281934700_b22","doi-asserted-by":"crossref","unstructured":"Sanchez, M.A. , Castillo, O. , Castro, J.R. and Melin, P. (2014), \u201cFuzzy granular gravitational clustering algorithm for multivariate data\u201d, Information Sciences , Vol. 279, pp. 498-511.","DOI":"10.1016\/j.ins.2014.04.005"},{"key":"key2020121800281934700_b23","doi-asserted-by":"crossref","unstructured":"Sarwar, B. , Karypis, G. , Konstan, J. and Riedl, J. (2000), \u201cApplication of dimensionality reduction in recommender system-a case study\u201d, Proceedings of the Workshop on Web Mining for E-commerce, MN, available at: www.dtic.mil\/get-tr-doc\/pdf?AD=ADA439541 (accessed August 10, 2014).","DOI":"10.21236\/ADA439541"},{"key":"key2020121800281934700_b24","unstructured":"Sarwar, B. , Karypis, G. , Konstan, J. and Riedl, J. (2002), \u201cRecommender systems for large-scale e-commerce: scalable neighborhood formation using cluste8ring\u201d, Proceedings of the 5th International Conference on Computer and Information Technology, MN, available at: www.grouplens.org\/papers\/pdf\/sarwar_cluster.pdf (accessed August 10, 2014)."},{"key":"key2020121800281934700_b25","doi-asserted-by":"crossref","unstructured":"Schafer, J.B. , Konstan, J. and Riedl, J. (2001), \u201cE-commerce recommendation applications\u201d, Data Mining and Knowledge Discovery , Vol. 5 Nos 1\/2, pp. 115-153.","DOI":"10.1023\/A:1009804230409"},{"key":"key2020121800281934700_b26","doi-asserted-by":"crossref","unstructured":"Shams, M. , Rashedi, E. and Hakimi, A. (2015), \u201cClustered-gravitational search algorithm and its application in parameter optimization of a low noise amplifier\u201d, Applied Mathematics and Computation , Vol. 258, pp. 436-453.","DOI":"10.1016\/j.amc.2015.02.020"},{"key":"key2020121800281934700_b27","unstructured":"Shi, S. , Yang, G. , Wang, D. and Zheng, W. (2002), \u201cPotential-based hierarchical clustering\u201d, Proceedings of the 16th International Conference on Pattern Recognition, pp. 272-275."},{"key":"key2020121800281934700_b28","unstructured":"Su, X. , Khoshgoftaar, T.M. and Greiner, R. (2008), \u201cA mixture imputation-boosted collaborative filter\u201d, Proceedings of the 21st International Florida Artificial Intelligence Research Society Conference, pp. 312-316."},{"key":"key2020121800281934700_b29","doi-asserted-by":"crossref","unstructured":"Symeonidis, P. , Nanopoulos, A. , Papadopoulos, A.N. and Manolopoulos, Y. (2008), \u201cCollaborative recommender systems: combining effectiveness and efficiency\u201d, Expert Systems with Applications , Vol. 34 No. 4, pp. 2995-3013.","DOI":"10.1016\/j.eswa.2007.05.013"},{"key":"key2020121800281934700_b30","doi-asserted-by":"crossref","unstructured":"Wang, J. , de Vries, A.P. and Reinders, M.J.T. (2006), \u201cUnifying user-based and item-based collaborative filtering approaches by similarity fusion\u201d, Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 501-508.","DOI":"10.1145\/1148170.1148257"},{"key":"key2020121800281934700_b31","unstructured":"Yamachi, H. , Kambayashi, Y. and Tsujimura, Y. (2009), \u201cA clustering method based on potential field\u201d, Proceedings of the 10th Asia Pacific Industrial Engineering and Management System Conference, pp. 846-855."}],"container-title":["Kybernetes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/K-10-2014-0212","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-10-2014-0212\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/K-10-2014-0212\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:50:29Z","timestamp":1753393829000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/k\/article\/45\/3\/434-445\/260359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,7]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3,7]]}},"alternative-id":["10.1108\/K-10-2014-0212"],"URL":"https:\/\/doi.org\/10.1108\/k-10-2014-0212","relation":{},"ISSN":["0368-492X"],"issn-type":[{"value":"0368-492X","type":"print"}],"subject":[],"published":{"date-parts":[[2016,3,7]]}}}