Flowers

Predict Number of Upvotes

Online 28-01-2019 10:00 AM to 31-12-2024 11:59 PM
  • 6301

    Registered

  • Practice Problem

    Prizes

Crowdsourced online content platforms have a constant need to identify the best content in time to appropriately promote and thereby improve the engagement at the website. This challenge involves a similar problem of predicting the upvote count for a queries posted and identify the parameters that affect it the most.

Data Science Resources

Rules

  • One person cannot participate with more than one user accounts.
  • You are free to use any tool and machine you have rightful access to.
  • You can use any programming language or statistical software.
  • You are free to use solution checker as many times as you want.

FAQs

1. Are there any prizes/AV Points for this contest?

This contest is purely for learning and practicing purpose and hence no participant is eligible for prize or AV points.

2. Can I share my approach/code?

Absolutely. You are encouraged to share your approach and code file with the community. There is even a facility at the leaderboard to share the link to your code/solution description.

3. I am facing a technical issue with the platform/have a doubt regarding the problem statement. Where can I get support?

Post your query on discussion forum at the thread for this problem, discussion threads are given at the bottom of this page. You could also join the AV slack channel by clicking on 'Join Slack Live Chat' button and ask your query at channel: practice_problems.

ALT

Please register/login to participate in the contest

Please register to participate in the contest

Please register to participate in the contest

Support

We use cookies essential for this site to function well. Please click to help us improve its usefulness with additional cookies. Learn about our use of cookies in our Privacy Policy.

Feedback

We believe in making Analytics Vidhya the best experience possible for Data Science enthusiasts. Help us by providing valuable Feedback.