1 / 14

MIS 510: WEB MINING PROJECT HinduShrines.com

MIS 510: WEB MINING PROJECT HinduShrines.com. Anand Sundaram Bansri Poduval Prajani K.C Rahul Nair. Agenda. Business Model Features Competitor Analysis Architecture Recommender System Novelty Work Distribution. Business Model.

mea
Download Presentation

MIS 510: WEB MINING PROJECT HinduShrines.com

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MIS 510: WEB MINING PROJECTHinduShrines.com Anand Sundaram Bansri Poduval Prajani K.C Rahul Nair

  2. Agenda Business Model Features Competitor Analysis Architecture Recommender System Novelty Work Distribution

  3. Business Model • Hindu Shrines is a comprehensive information based website on various Hindu temples, Gods and Hindu festivals in India. • Available in YOUR Language • A huge database with more than 1600 temples with text and multimedia data like no other source on the web • Temple ratings & a Recommender System to decide your itinerary • Revenue Opportunities: • Possible tie ups with Travel agencies or even the Ministry of Tourism, Government of India • Revenue through advertizing Amazon products

  4. Features V 1.0 V 2.0 HinduShrines .com Recommendation System Recommendation System User Forums Rating System

  5. Competitor Analysis

  6. Architecture

  7. Recommender System • The objective is to allow users to decide on a sequence of temples that they would be interested in visiting depending on their current location and willingness to travel. • Algorithm Used – Dijkstra’s Shortest Path • Enter starting Temple (Partial String) • Select Temple • Enter Distance Limiter • Dijkstra’s Algorithm returns temples within the entered distance • Select Next Temple to visit • Goto Step 3

  8. Recommender System 4 T1 4 4 T0 6 T3 6 6 3 T2 3 3

  9. Recommender System 9>4=4 T1 4 4 T0 T3 6 6=6 6 3 T2 3 3

  10. Recommender System T1 4 4 4 T3 T0 6 8>6=6 6 3 T2 3 3

  11. Recommender System T1 4 4 4 T3 T0 6 8>6=6 6 3 T2 3 3

  12. Novelty A one stop for all the information about 1600+ temples, Gods and festivals. Web site content available in multiple languages through the use of Google Translation Popularity measure for temples based on user ratings A completely dynamic recommendation system that allows users to plan their itinerary depending on their location and willingness to travel

  13. Work Distribution

  14. Q & A

More Related