Keywords
|
Cloud computing,Mobile user behavior analysis,multimedia service recommendation |
INTRODUCTION
|
In the recommendation system all forms of video likethat (TV, video on user demand, Internet, and P2P) will continue to be approximately 90% of global consumer traffic by 2015. Internet users post a manylarge number of audio, video clips onaudio, video-sharing websites and social network(Facebook, Twitter) applications everyday [1]. The number of audio, video may be duplicate, similar, related, or quite different. The user facing billions of multimedia web-pages, online users are usually vey hard time finding their favorites videos. This situation is very hard for mobile users because of screen limit and low bandwidth.How to help mobile users obtain their favorite content lists from millions of webpages in a short time is very challenging [2]. Some video-sharing websites recommend video lists for end users according to video classification, video description tags, or watching history.The existing recommendation algorithms,the typical system consists of two essential components: 1) a content recommender that takes charge of user interest identification, user interest recommendation, and result reranking and 2) various collectors that collect user context and activities, content attributes, and updates. In recommendation system initialization, a few contextual information, e.g., time and location, is collected [6]. To capture the interests of users in a ubiquitous environment, more and more contextual information, such as user opinions, watching times, and video ages, is logged in the recommendation system [4]. Real-time recommendation cannot be guaranteed due to inevitable increment of computations.User interests and content clustering are often used to narrow the searching range of related content.The system is implemented on the Hadoop platform to satisfy the huge computation requirements for real-time recommendation systems. The Hadoopis open-source framework uses a simple programming model to enable distributed processing of large data sets on clusters of computers. The complete technology stack includes common utilities, a distributed file system, analytics and data. The recommender systems, there are three differences: 1) the collector and user profiles are decentralized into several computing nodes; 2) the user behavior clusters are collected except for only user profiles; and 3) the graph-based optimization mechanism is introduced into the recommender to speed up the recommendation process. The Hadoop platform is used in the proposed multimedia recommendation system. On the platform, user clusters and multimedia content are collected, distributed, and stored into the Hadoop distributed file system (HDFS). During user content recommendation, those data are partitioned into several chunks, the chunks are processed simultaneously by several mapper, and then, the results are reduced and merged together . The Hadoop framework is more cost- effective for handling large, complex, or unstructured data sets than conventional approaches, and it offers massive scalability and speed. |
LITERATURE REVIEW
|
Existing System: Internet users post a large number of video clips on Video-sharing websites and social network applications every day. The video content may be duplicate, similar,related, or quite different. Facing billions of multimedia WebPages,online users are usually having a hard time finding theirfavorites. Some video-sharingwebsites recommend video lists for end users according tovideo classification, video description tags, or watching history. However, these recommendations are not accurate and are always not consistent with the end users’ interests. To improve this, some websites also provide users with search engine to search theirdesired videos quickly. However, searching is based on the keywords. Online Trading is being hosted on Stand Alone Server. |
• Very hard to reuse video-tag module. |
• Payment for combination of Physical Hosting and Hardware is demanded by the Web Hosting. |
• Lack of scalability in identified Servers. |
• Very hard to dedicated the Spammers in online. |
• Noise and inconsistencies inherent to the data, and determine the hard of the task. |
• Increasing total amount by provider on the monthly basis. |
Proposed System: Cloud-based mobile multimedia recommendation system which can reduce network overhead and speed up the recommendation process The users are classified into several groups according to their context types and values. With the accurate classification rules, the context details are not necessary to compute, and the huge network overhead is reduced. Moreover, user contexts, user relationships, and user profiles are collected from video-sharing websites to generate multimedia recommendation. That the proposed approach can recommend desired services with high precision, high recall, and low response delay. User clusters are collected instead of detailed user profiles. To avoid the explosion of networkoverhead, user-behavior-based clustering is performedfirst, and the collectors calculate user clusters according to the clustering rules and then report the user cluster to the recommender only. |
• Proposed tag-cloud recommendation approaches. |
• A mobile- computing platform distributed in number of large data center. |
• Mobile-Computing and storage resources. |
• A recommendation system ranked lists of top videos. |
• Reusability and extensibility of this framework component. |
• Private Storage space for each and every Provider. |
• Detection video spammers and promoters Process is easy. |
RELATED WORK
|
In a RecommendationSystem, the systems used on a specific domain likethat Google News provides personalize information news recommendation services for a number of online readers. Amazon uses the recommender system to help users find their own choice or favorite products. YouTube uses user watching history to predict and recommend videos for users.Recommendation System have been categorized by four algorithm exploited by the recommender system: CB recommendation, CF-based recommendation, context-aware recommendation, and graph-based recommendation.In the multimedia information overload and to allow users to have easily access to relevan multimedia contents in their mobile devices, today’s main focus and challenges of researchers is on how to develop multimedia recommender systemsfor mobile devices. |
CB recommendation: The content-based systems make recommendation based on the content names, tags, or explanations.Some systems determine user-interested items based on user’s individual reading history in term of content. CB recommendersystems are very easy to implement. In the content based systems are provided by automatically matching a user’s interests with item contents. In content based recommendation very similar items to previous items consumed by the user are recommended which creates a problem of overspecialization. |
CF-based recommendation: The Collaborative Filtering-based systems make filtration based on abundant user transaction histories and content popularity. In the collaborative systems, individual user’s interests arepredicted by a group of similar users .CF systems obtained enough historical consumption record and feedback. On other side prediction,implicit feedback, or opinion classification methods should beadopted to solve new user issues. In collaborative filtering,The ratings of users were used to clustering users to groups, todetermine a socialcommunity.Then the similarity of users findout within the group to be used for prediction and recommendations. |
Context-aware recommendation: The Context-aware systems provide stable recommendation without considering usercontext information. The user interests vary according tolocation, time, and emotion. Context-aware recommendationsystems complement user context sensed on smartphone andlong-time user profile to assist the user in selecting better services, photographs, or videos dynamically. Context is avery difficultconcept to capture and explain; fuzzy ontologies and semanticreasoning are used to augment and enrich the explanation ofcontext. |
Graph-based recommendation: The Graph –based recommendation built in the systemsto determine the correlation between filtrationobjects. Thefiltration problem turns into a node selectionproblem on a graph. Incorporating conversion content and contextual information, links on video pages are converted toundirected weighted graph. With the huge increase of user numbers, user contexts, user profiles, and video contents, filtrationsystems require more and more computation capacity. To resolve the huge computation requirements, CF algorithms and context-aware algorithms have been implemented on cloud-computing platforms to improve performance and scalability of the recommender system. |
ARCHITECTURE WITH DIAGRAM
|
Algorithm:
|
Algorithm: Find relevant application(s) to a user’s context |
Input: user_id, location_id, device_profile,time |
Output: download url of relevant application |
1 Function |
FindApp(user_id,location_id,device_profile,time)
|
2 Initialize Apps=[] //App collector |
3 if location_id has application(s)(M) then |
4 foreach m ¡ô M do |
5 Initialize matchm=0 //application relevancyscore |
6 Initialize ratingm=0 //application rating score |
7 // retrieve application access constraints Am |
8 if m has no absolute time constraints then |
9 if m has open-access then |
10 // m gets max. score |
11 matchm =1 |
12 end |
13 else |
14 // retrieve user profile and credentials |
Ru |
15 Initialize matchm=0 |
16 foreachruinRu and am ¡ô Am do |
17 // check how much ru satisfy am |
18 matchm = matchm + F(ru, am) |
19 end |
20 end |
21 end |
22 m = 0.5 .matchm + 0.5 . ratingm |
23 // add m to relevant Apps |
24 Apps=Apps + m |
25 end |
26 end |
27 if Apps is not null then |
28 //choose the application with the highest score |
29 end |
30 return url //if null means no applicaitons |
CONCLUSION
|
In this review, we proposed context-aware commendation technique as a clarification to address the info overload problem that smart device users will challenge in the mobile cloud atmosphere. One distinctive piece of the proposed elucidation is its ability to syndicate dynamic context appreciationand recommendation procedures, integrated in a common background user profile facility. The context facility relies on using the context acknowledgment model to glean precise context information after smartphone built-in sensor proceedings. The proposed resolution takes advantage of the smartphone integral sensors to enhance unified and automatic recognition of the operator contex information in real-time deprived of using additional bound devices. |
In the future, we intend to carry out additional extensive usability challenging of the scheme, especially in live cloud atmosphere to improve its usability. Moreover, we intend to appraise other context-aware methods such as content and collaborative procedures. Finally, since the proposed explanation runs on smartphone, gathering data from its sensors, influence consumption converts a critical apprehension for the users. |
|
Figures at a glance
|
|
Figure 1 |
|
|
References
|
- C.-F. Lai, Y.-M.Huang, and H.-C. Chao, “DLNA-based multimedia sharing system for OSGI framework with extension to P2P network,”IEEESyst. J., vol. 4, no. 2, pp. 262–270, Jun. 2010.
- K.-D. Chang, C.-Y.Chen, J.-L.Chen, and H.-C. Chao, “Challenges to next generation services in IP multimedia subsystem,”J. Inf. Process.Syst.,vol. 6, no. 2, pp. 129–146, Jun. 2010.
- D. Li, Q. Lv, X. Xie, L. Shang, H. Xia, T. Lu, and N. Gu, “Interest-based real-time content recommendation in online socialcommunities,”Knowl.-Based Syst., vol. 28, pp. 1–12, Apr. 2012.
- X. Wu, Y. Zhang, J. Guo, and J. Li, “Web video recommendation and long tail discovering,” inProc. IEEE ICME, 2008, pp. 369–372.
- D. Poirier, F. Fessant, and I. Tellier, “Reducing the cold-start problem in content recommendation through opinion classification,” inProc.IEEE/WIC/ACM Int. Conf. WI-IAT, 2010, pp. 204–207.
- Q.H. Mahmoud,“Provisioning Context-Aware Advertisements to Wireless Mobile Users,” in Proc. of the IEEE Int.Conf.on Multimedia andExpo,2006, pp. 669-672.
|