🎥 Demo in action! Yesterday I shared screenshots of my Movie Recommendation System. Here’s a quick 50-second walkthrough of how it actually works. Select a movie → Instantly get 5 similar recommendations with posters. Built using: • Content-based filtering • CountVectorizer • Cosine similarity • Streamlit + Python Still improving it — next step: collaborative filtering. Would love your thoughts 🙌 #MachineLearning #Python #RecommendationSystem #StudentDeveloper
More Relevant Posts
-
We just finished the first YouTube series on py-dss-toolkit. If you use OpenDSS with Python, this series shows practical ways to explore models, extract results, and visualize studies more efficiently. You can use py-dss-toolkit to: ✅ work with OpenDSS data in a more structured way 📊 move results into pandas DataFrames for analysis 💻 create visual workflows, including in Google Colab I’d love your feedback: what should the next series focus on? 🔎 Plotting? 🔎 QSTS? 🔎 Model exploration? 🔎 Automation? #OpenDSS #Python #PowerSystems
To view or add a comment, sign in
-
Still slicing DataFrames the hard way? Here are the three essentials: grab one column with df['col'], pick multiple with df[['a','b']], then filter rows by building a boolean mask like df[df['age'] >= 18]. Master these and inspecting/subsetting data becomes effortless.#pandas #python #datascience #dataanalysis
To view or add a comment, sign in
-
-
🚀 Day 56 — LeetCode 451: Sort Characters by Frequency using HashMap + Sorting. 💡 Key Learnings: • Counting character frequency using dictionary • Custom sorting with key=lambda • Efficient string building using "".join() • Understanding time vs space complexity trade-offs ⏱️ Complexity: Time — O(n + k log k) Space — O(k) #Day56 #LeetCode #Python #DataStructures #DSA #CodingJourney #ProblemSolving
To view or add a comment, sign in
-
-
Solved an interesting array problem using prefix sums + hash maps 🚀 This solution efficiently finds the longest subarray based on a comparison condition (arr[i] > k) by converting the problem into a prefix sum balance and tracking first occurrences with a hashmap. ✅ O(n) time complexity ✅ Smart use of prefix sums ✅ Great example of turning a complex condition into a simple math problem Always fun when problem-solving meets optimization! 💻📊 #Python #DataStructures #Algorithms #CodingInterview #ProblemSolving #100DaysOfCode
To view or add a comment, sign in
-
-
Day 14 | Problem-Solving Practice Back to practice and worked on number system conversions today: • Binary to Decimal conversion • Decimal to Binary conversion Implemented both mathematical logic and built-in approaches to understand the underlying concept as well as practical shortcuts. Continuing to rebuild momentum step by step. GitHub: https://lnkd.in/g35tV9Gj #ProblemSolving #Python #LearningInPublic
To view or add a comment, sign in
-
🔁 Rotate Matrix by 90° — Clean In-Place Trick! Solved the classic Rotate Matrix by 90° problem using a simple observation: • Transpose the matrix • Reverse it column-wise This approach rotates the matrix in-place with O(n²) time and O(1) extra space. Sometimes the best solutions come from simple transformations on the matrix. 🚀 #DSA #ProblemSolving #Python #CodingInterview #Algorithms
To view or add a comment, sign in
-
-
#1 — Hardcoded / Magic Numbers It works. But where do 9, 5, and 32 come from? Part of the series: One Problem – Different Approaches Start here: https://lnkd.in/dU4kN-q8 #OneProblemDifferentApproaches #CelsiusToFahrenheit #Python #sedatçapar
To view or add a comment, sign in
-
-
✅Day 12 of #DSAPrep > Problem: Product of Array Except Self > Platform: LeetCode > Concept: Prefix Sum + Suffix Product Solved using an optimized approach by calculating the product of elements on the left and right side separately. First pass stores left products, second pass multiplies right products — without using division. > Time Complexity: O(n) > Space Complexity: O(1) #DataStructures #Algorithms #Python #ProblemSolving #CodingJourney
To view or add a comment, sign in
-
-
🐍 Ever wondered what "cannot pickle" actually means? When you run a deepcopy or try to save a complex object, Python uses a process called Serialization (or Pickling). It's the magic trick that turns an object into a stream of bytes. But the magic has limits. In our latest episode in The Secret Life of Python, Timothy and Margaret head to the whiteboard to demystify the pickle module. The Lesson: ✅ How Python translates objects into a Byte Stream. ✅ Why system resources (like database connections) can't be "pickled." ✅ Why you should NEVER unpickle data from untrusted sources. Understand how your data moves behind the scenes. 👉 Read the full story here: https://lnkd.in/gdPVgXcD #Python #Coding #SoftwareEngineering #Security
To view or add a comment, sign in
-
Explore related topics
- Collaborative Filtering Systems
- Techniques for Improving AI Recommendation Accuracy
- How Amazon Shapes Recommender System Technology
- Utilizing Natural Language Processing in AI Recommendations
- Recommendation System Testing
- Evaluating AI Recommendation System Performance
- Recommendation System Optimization
- Creating a Feedback Loop for AI Recommendation Systems
- Designing User-Centric AI Recommendation Interfaces
- How LLMs Improve Travel Recommendation Engines
Explore content categories
- Career
- Productivity
- Finance
- Soft Skills & Emotional Intelligence
- Project Management
- Education
- Technology
- Leadership
- Ecommerce
- User Experience
- Recruitment & HR
- Customer Experience
- Real Estate
- Marketing
- Sales
- Retail & Merchandising
- Science
- Supply Chain Management
- Future Of Work
- Consulting
- Writing
- Economics
- Artificial Intelligence
- Employee Experience
- Workplace Trends
- Fundraising
- Networking
- Corporate Social Responsibility
- Negotiation
- Communication
- Engineering
- Hospitality & Tourism
- Business Strategy
- Change Management
- Organizational Culture
- Design
- Innovation
- Event Planning
- Training & Development