Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM61842
Volume:
10 |
4 |
April 2026
Pages:
1-8
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.

Computer Science of Engineering
College of Engineering And Techonology , Akola
Computer Science of Engineering
College of Engineering And Techonology , Akola
Computer Science of Engineering
College of Engineering And Techonology , Akola
Computer Science of Engineering
College of Engineering And Techonology , Akola
Computer Science of Engineering
College of Engineering And Techonology , Akola
People who consume a lot of digital media share one frustration that the platforms themselves have arguably made worse: the discovery problem. You know the kind of thing you want to watch or read next, but the tools for finding it are either too blunt or built around assumptions that fall apart when you are a new user with no watch history. MediaMind grew out of that frustration. It is a full-stack web application we built to let people discover anime, movies, books, and web series using an engine that works from the content of the media itself, not from what other users clicked on. At its core is a weighted Jaccard similarity function that scores every item in the catalogue against a chosen title across three dimensions — genre overlap (0.50 weight), thematic tag intersection (0.35), and media-type affinity (0.15) — and returns the five closest matches. Surrounding that engine is a complete application: JWT authentication, personal collections, watch history, a four-label review system (Skip / Timepass / Go for it / Perfection), real-time keyword search with session history, an admin panel for catalogue management, and weekly digest emails delivered through Nodemailer on a cron schedule. We tested the finished system with fourteen API cases, all of which passed, and five user evaluators who completed a structured task flow at a 95% rate, scoring the experience 4.2 out of 5 on average. The recommendation computation itself takes under 5 milliseconds across a 200-item catalogue, which matters because it runs synchronously inside the request cycle.
KEYWORDS
MediaMind demonstrates that content-based filtering can be built into a fully functional, multi-domain discovery platform without requiring a large user base, proprietary training data, or any machine learning infrastructure. The weighted Jaccard similarity engine is intentionally simple — three features, three weights, one formula — but the results it produces are semantically meaningful. Items sharing high genre and tag overlap with a target consistently ranked at the top of the recommendation list in testing. Cross-domain results appeared in the right circumstances: when a book and an anime genuinely shared enough content features, the book surfaced. The 95% UAT completion rate and 4.2/5 satisfaction score are meaningful numbers because they came from evaluators with no prior exposure to the system. The single failure — one evaluator hesitating over the "Timepass" label — is the kind of small friction point you cannot anticipate in design but catch immediately in user testing, which is exactly why that testing phase exists. The work that would make the most difference in a future version is clear from the limitations: external API integration to automate catalogue growth, a behavioural feedback term in the similarity function, and server-side pagination. The architecture supports all three additions without requiring significant restructuring. Building them out is the next step.
[1] P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl,"GroupLens: An open architecture for collaborative filtering of netnews," in Proc. ACM Conf. on Computer-Supported Cooperative Work (CSCW), Chapel Hill, NC, 1994, pp. 175–186. [2] J. S. Breese, D. Heckerman, and C. Kadie, "Empirical analysis ofpredictive algorithms for collaborative filtering," in Proc. 14th Conf. on Uncertainty in Artificial Intelligence (UAI), Madison, WI, 1998, pp. 43–52. [3] M. J. Pazzani and D. Billsus, "Content-based recommendationsystems," in P. Brusilovsky, A. Kobsa, and W. Nejdl (Eds.), The Adaptive Web: Methods and Strategies of Web Personalization, LNCS vol. 4321, Springer, 2007, pp. 325–341. [4] R. Burke, "Hybrid recommender systems: Survey and experiments,"User Modeling and User-Adapted Interaction, vol. 12, no. 4, pp. 331–370, Nov. 2002. [5] Y. Koren, R. Bell, and C. Volinsky, "Matrix factorization techniquesfor recommender systems," IEEE Computer, vol. 42, no. 8, pp. 30–37, Aug. 2009. [6] OpenJS Foundation, Node.js v18 LTS API Documentation. [Online]. Available: https://nodejs.org/docs/latest-v18.x/api/. [Accessed: Apr. 2025]. [7] Oracle Corp., MySQL 8.0 Reference Manual. [Online]. Available: https://dev.mysql.com/doc/refman/8.0/en/. [Accessed: Apr. 2025]. [8] Express.js Contributors, Express 5.x API Reference. [Online]. Available: https://expressjs.com/en/5x/api.html. [Accessed: Mar. 2025]. [9] Nodemailer Contributors, Nodemailer — Node.js Mailer Documentation. [Online]. Available: https://nodemailer.com/about/. [Accessed: Apr. 2025]. [10] Auth0, "Introduction to JSON Web Tokens." [Online]. Available: https://jwt.io/introduction. [Accessed: Mar. 2025].
Publication Date
4/30/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
4
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...