Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

Forecasting movie rating using k-nearest neighbor based collaborative filtering

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 6 (2022)

DOI
10.11591/ijece.v12i6.pp6506-6512
ISSN
2722-2578, 2088-8708
Published
2022-12-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Expressing reviews in the form of sentiments or ratings for item used or movie seen is the part of human habit. These reviews are easily available on different social websites. Based on interest pattern of a user, it is important to recommend him the items. Recommendation system is playing a vital role in everyone’s life as demand of recommendation for user’s interest increasing day by day. Movie recommendation system based on available ratings for a movie has become interesting part for new users. Till today, a lot many recommendation systems are designed using several machine learning algorithms. Still, sparsity problems, cold start problem, scalability, grey sheep problem are the hurdles for the recommendation systems that must be resolved using hybrid algorithms. We proposed in this paper, a movie rating system using a k-nearest neighbor (KNN-based) collaborative filtering (CF) approach. We compared user’s ratings for different movies to get top K users. Then we have used this top K set to find missing ratings by user for a movie using CF. Our proposed system when evaluated for various criteria shows promising results for movie recommendations compared with existing systems.

Collaboration network of the authors

8 authors · 11 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Koneru Lakshmaiah Education Foundation
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Aruna Kumari DKoneru Lakshmaiah Education Foundation2
D. RadhikaKoneru Lakshmaiah Education Foundation1
Swati Babasaheb BhondeAffiliation unknown1
Prashant Laxmanrao PaikraoAffiliation unknown1
Umesh B. PawarAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Oct 2026, last seen 22 Nov 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Forecasting movie rating using k-nearest neighbor based collaborative filtering</dc:title><dc:creator>Rokade, Prakash Pandharinath</dc:creator><dc:creator>Prasad Rao, PVRD</dc:creator><dc:creator>Devarakonda, Aruna Kumari</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p&amp;gt;&amp;lt;span lang="EN-US"&amp;gt;Expressing reviews in the form of sentiments or ratings for item used or movie seen is the part of human habit. These reviews are easily available on different social websites. Based on interest pattern of a user, it is important to recommend him the items. Recommendation system is playing a vital role in everyone’s life as demand of recommendation for user’s interest increasing day by day. Movie recommendation system based on available ratings for a movie has become interesting part for new users. Till today, a lot many recommendation systems are designed using several machine learning algorithms. Still, sparsity problems, cold start problem, scalability, grey sheep problem are the hurdles for the recommendation systems that must be resolved using hybrid algorithms. We proposed in this paper, a movie rating system using a k-nearest neighbor (KNN-based) collaborative filtering (CF) approach. We compared user’s ratings for different movies to get top K users. Then we have used this top K set to find missing ratings by user for a movie using CF. Our proposed system when evaluated for various criteria shows promising results for movie recommendations compared with existing systems.&amp;lt;/span&amp;gt;&amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v12i6.pp6506-6512</dc:identifier><dc:identifier>10.11591/ijece.v12i6.pp6506-6512</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 6 (2022); 6506</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/25670/16100</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>