Free Essay

Algorithm in Recommendation System

In:

Submitted By tracejoyrecato
Words 5413
Pages 22
Algorithms and Methods in Recommender Systems
Daniar Asanov
Berlin Institute of Technology Berlin, Germany

Abstract—Today, there is a big veriety of different approaches and algorithms of data filtering and recommendations giving. In this paper we describe traditional approaches and explane what kind of modern approaches have been developed lately. All the paper long we will try to explane approaches and their problems based on a movies recommendations. In the end we will show the main challanges recommender systems come across.

II. T RADITIONAL R ECOMMENDER A PPROACHES A. Content-based filtering Content-based recommender systems work with profiles of users that are created at the beginning. A profile has information about a user and his taste. Taste is based on how the user rated items. Generally, when creating a profile, recommender systems make a survey, to get initial information about a user in order to avoid the new-user problem. [2] In the recommendation process, the engine compares the items that were already positively rated by the user with the items he didnt rate and looks for similarities. Those items that are mostly similar to the positively rated ones, will be recommended to the user. Figure 1 shows an example of a user profile with the movies he/she has watched and the ratings the user made. Figure 2 shows the list of movies and their attribute-values. A contentbased recommender system would find out movies from the list (Figure 2) that the user has already watched and positively rated. Then, it would compare those movies with the rest of the movies from the list (Figure 2) and look for similarities. Similar movies would be recommended the user. In the curent example we can see that there is a movie ”Scary Movie” similar to the movie ”American Pie” that the user positively rated. The user hasn’t rated ”Scary Movie” so it will be recommended him/her.

I. I NTRODUCTION With the beginning of the Web 2.0 era, the internet began growing up and developing with tremendous speed. Many opportunities, such as sharing knowledge, information, opinion with other users, came out. This did favor the development of social networks like Facebook. Nowadays, authors can share their creations with millions of readers around the globe. Amateur-musicians can get famous faster than ever before just with uploading their tracks. Business world have found more customers and profit in the internet. The variety of online shops, auctions or flea markets opened up in the internet. Today, every user of the World Wide Web can purchase almost any item being in any country of the world. As opposed to real shops, in the internet there are no place-limitations. In fact, there is almost endless place. Nevertheless people came across a new problem in the WWW. The amount of information and items got extremely huge, leading to an information overload. It became a big problem to find what the user is actually looking for. Search engines partially solved that problem, however personalizationof information was not given. So developers found a solution in recommender systems. Recommender systems are tools for filtering and sorting items and information. They use opinions of a community of users to help individuals in that community to more effectively identify content of interest from a potentially overwhelming set of choices. [1] There is a huge diversity of algorithms and approaches that help creating personalized recommendations. Two of them became very popular: collaborative filtering and content-based filtering. They are used as a base of most modern recommender systems. Appearence of mobile devices with new technologies, such as GPS ans 3G standards, on markt issued new challanges. Recommender systems got involved in developing process of tourism, security and other areas. Modern recommender systems improving their recommendations accurancies by using context-aware, semantic and other approaches. Today, recommendations are more specific and personalized. Problems of combinig different technologies and recommending approaches for better results will always exist and will be the reason of new researches. I wish you the best of success.

Figure 1: The movies the user has watched

Figure 2: The movies list There are different algorithms of measuring similarities among items in data base and those in users profile. [3] One of such approaches is cosine similarity. Representing items as vectors on a cordinate space it measures angles between vectors and gives out their cosine value. Vectors wc and ws of two items with attributes are compared in cosine similarity function as follows: [4]

u(c, s) = cos(wc , ws ) =

wc · ws = ||wc || × ||ws ||

=

K i=1 K i=1

wic wis
K i=1 2 wis

2 wic

The more similar two items are, smaller the angle between their vectors. [5]

Figure 3: Collaborative recommender system example Collaborative filtering is widely used in e-commerce. Customers can rate books, songs, movies and then get recommendations regarding those issues in future. Moreover collaborative filtering is utilized in browsing of certain documents (e.g. documents among scientific works, articles, and magazines). [7] Going in details of methods of collaborative filtering we can distinguish most popular approaches: user-based, item-based and model-based approaches. 1) User-based approach: This approach was proposed in the end of 1990s by the professor of University of Minnesota Jonathan L.Herlocker.[8] In the user-based approach, the users perform the main role. If certain majority of the customers has the same taste then they join into one group. Recommendations are given to user based on evaluation of items by other users form the same group, with whom he/she shares common preferences. If the item was positively rated by the community, it will be recommended to the user. Thus in the user-based approach the items that were already rated by the user before play an important role in searching a group that shares appreciations with him. [9] [10] [11] (See Figure 5).

Figure 4: Cosine similarity on a cordinate plane Similarity search requires detailed information about the items. Better described items lead to more accurate recommendations.

B. Collaborative filtering Collaborative filtering became one of the most researched techniques of recommender systems since this approach was mentioned and described by Paul Resnick and Hal Varian in 1997. [1] The idea of collaborative filtering is in finding users in a community that share appreciations [6]. If two users have same or almost same rated items in common, then they have similar tastes. Such users build a group or a so called neighborhood. A user gets recommendations to those items that he/she hasnt rated before, but that were already positively rated by users in his/her neighborhood. Figure 4 shows that all three users rate the movies positively and with similar marks. That means that they have similar taste and build a neighborhood. The user A hasnt rated the movie ”TRON: Legacy”, which probably mean that he hasn’t watched it yet. As the movie was positively rated by the other users, he will get this item recommended. As opposed to simpler recommender systems where recommendations base on the most rated item and the most popular item methods, collaborative recommender systems care about the taste of user. The taste is considered to be constant or at least change slowly.

Figure 5: User-based collaboratie recommender system 2) Item-based approach: This approach was proposed by the researchers of University of Minnesota in 2001 [12]. Referring to the fact that the taste of users remains constant or change very slightly similar items build neighborhoods based on appreciations of users. Afterwards the system generates recommendations with items in the neighborhood that a user would prefer [12] [8] (See Figure 6).

Figure 6: Item-based collaboratie recommender system C. Hybrid recommendation approaches For better results some recommender systems combine different techniques of collaborative approaches and contentbased approaches. Using hybrid approaches we can avoid some limitations and problems of pure recommender systems, like the cold-start problem. The combination of approaches can proceed in different ways [13]: 1) Seperate implementation of algorithms and joining the results. 2) Utilize some rules of content-based filtering in collaborative approach. 3) Utilize some rules of collaborative filtering in contentbased approach. 4) Create a unified recommender system, that brings together both approaches. Robin Burke worked out a taxonomy of hybrid recommender systems categorizing them. [14] CinemScreen is an example of a a recommendation agent that gives its users recommendations based on hybrid filtering about the movies that are shown in cinemas. On the website a user can create an account and evaluate all movies he/she has seen in cinemas. At first the system uses collaborative filtering. On the outcome of collaborative filtering it applies contentbased filtering. The combination of two approaches gives CinemaScreen opportunity to make more recommendations [15] (See Figure 7).

Figure 7: User-based collaboratie recommender system III. M ODERN RECOMMENDATION APPROACHES A. Context-aware approaches Context is the information about the environment of a user and the details of situation he/she is in. Such details may play much more significant role in recommendations than ratings of items, as the ratings alone dont have detailed information

about under which circumstances they were given by users. Some recommendations can be more suitable to a user in evening and doesnt match his preferences in the morning at all and he/she would like to do one thing when its cold and completely another when its hot outside. The recommender systems that pay attention and utilize such information in giving recommendations are called context-aware recommender systems. Nowadays, when the mobile devices are getting popular and taking part in our lives, this kind of recommender systems are especially urgent. Using GPS, 3G access to internet and other technologies recommender systems can rapidly get any information about location of a user and the user himself. [16], [17] As opposed to content information that is saved in profiles, context changes dynamically and often saved just permanently, as it is more likely to lose its currency after a certain period of time. For example most of the people would prefer to go to swimming pool, rather than to go to beach when its raining. So in such recommendations the weather would play a leading role. Thats why it is very important to periodically refresh the information. Context-aware recommender systems became much attention, as they noticeably increased the quality of recommendations and the approaches became more specific to use in certain areas. Gediminas Adomavicius and Alexander Tuzhilin introduced three different algorithmic paradigms of using the contextual information in recommendation process: contextual prefiltering, post-filtering and modeling. In contextual pre-filtering contextual information is used at selecting data at the beginning, like ratings, to be used for a further predictions, utilizing any approach. In the case of contextual post-filtering contextual information is used for filtering after predictions of ratings. In the last paradigm contextual information is used in prediction approach itself. [18] Baltrunas and Ricci have purposed contextual item rating pre-filtering approach that is based on item splitting. At first their approach searches the items that have significant differences in their ratings. Each of such items is discovered for a contextual feature, up to which the ratings significantly change. If there is one, it creates two new items instead of the old one with definite contextual information. The main idea of algorithm is to find a contextual feature to split the item. For example, the movies about Santa Claus and his adventures might be higher rated in winter, at Christmas time. Adult movies might be more watched in the night than in the morning or afternoon. In the last example the future of item splitting is the daytime. The approach would split the adult movie ”Wild Orchid” into two: the one with high ratings and contextual information ”night” for the feature ”daytime” and the other one with lower ratings and the contextual information ”day”. A recommender system that uses this approach would then use the contextual information about time to make recommendations about movies. This approach is an extension of collaborative filtering.[19] The same principle is used in micro-profiling technique

of Baltrunas and Amatriain. This time-dependant approach splits user profiles based on change of preferences at different periods of time.[20] There are many ways of representation of contextual information and its relationship with items and users. One of such representations is a contextual graph. Other than representation, utilizing graph algorithms, it can also help to improve predictions. In a contextual graph items, users and contextual objects are represented as nodes of the graph and the edges would be ratings of items and similarity indicators between users. Toine Bogers used contextual graphs in his movie recommendation algorithm ContextWalk that is based on Markovs random walks.[21] Context-aware recommender systems became a part of tourism domain. One of the biggest problems of context-aware recommender systems is obtaining context information. The information can be obtained explicitly by directly interacting with user asking him/her to fill out a form and making a survey. Although it is mostly desirable to obtain context information without making the whole rating and reviewing process complicated. Another way is gathering information implicitly using the sources like GPS, to get location, or a timestamp on transaction.[18] The last way of information extraction is analyzing users observing their behavior or using data mining techniques. For example: obtaining information from reviews. People usually like to write their reviews in free text form. The problem is to get important contextual information from such reviews. There are many text mining algorithms including artificial intelligence techniques.[22] Context-aware recommender systems that work with positioning systems became a part of tourism domain. Such systems are called location-based recommender systems.[23] One of them is COMPASS - an application for mobile devices that utilizes GPS. Based on the location of a tourist and his/her interests the system gives recommendations. If the tourist is interested in antique buildings, the software will show up such building around him on the map. In connection with mobile internet technologies the system can give more detailed recommendations like opening times of museums or special offers of restaurants. Knowing the location the application can also require a taxi to that place [17] (See Figure 8).

B. Semantic based approaches Most of the descriptions of items, users in recommender systems and the rest of the web are presented in the web in a textual form. Using tags and keywords without any semantic meanings doesnt improve the accuracy of recommendations in all cases, as some keywords may be homonyms. Thats why understanding and structuring of text is a very significant part recommendation. Traditional text mining approaches that base on lexical and syntactical analysis show descriptions that can be understood by a user but not a computer or a recommender system. That was a reason of creating new text mining techniques that were based on semantic analysis. Recommender systems with such techniques are called semanticbased recommender systems.[24] The performance of semantic recommender systems are based on knowledge base usually defined as a concept diagram (like taxonomy) or ontology.[25] On Wikipedia Taxonomy is defined as a practice and science of classification.[26] Taxonomy plays an important role in semantic analysis. Classification of items and users concerning their domains and groups brings much efficiency in recommendation system. In movies recommending, for example, the classification of movies up to their genre and building a tree would lead to a better understanding of users tastes by a system (See Figure 9).

Figure 9: Taxonomy example derived from the IMDB taxonomy However, in some cases taxonomies are not the best way of sorting and classifying items, as implementation of taxonomies may be very complicated and expensive, or even not possible. Web services for photo sharing are good example of difficult taxonomy creation. One of the best solutions of this problem would be folksonomies (folks + taxonomy). Folksonomy is items sorting approach, whereby users add tags to items and the most frequent and popular tags would build categories of items. [27] [28] [29] Tags in folksonomies and taxonomies are related with each other using different ontologies. Swartout defined Ontology as a hierarchically structured set of terms for describing a domain that can be used as a skeletal foundation for a knowledge base.[30] Gruber said that an ontology defines the basic terms and relations comprising the vocabulary of a topic area, as well as the rules for combining terms and relations to define extensions to the vocabulary.[30] So with the help of ontology recommender systems can understand how some terms (items, users, tags, etc) are related to each other (See Figure 10).

Figure 8: COMPASS, Screenshot examples

Figure 10: An example of a movie ontology

As an ontology description language, developers use Web Ontology Language (OWL).[31]

Figure 11: Sample of tourism recommendation in TripFromTV C. Cross-domain based approaches

Despite an existence of commonly used ontologies, like WordNet, OpenCyc and Gene Ontology, there are still some challenges[24]. One of them is their currency. Relations between items may change and that would bring us to not up to date ontologies.

Ahmed Elgohary purposed an approach that uses Wikipedia as an ontology for the semantic analysis of text. Articles in Wikipedia are constantly updated and some of them are given in many languages. They are also connected with each other via hyper-links. Using a Wikipedia-based annotator the recommender system creates an annotations repository, which is further used for semantic descriptions of terms (items).[24]

Finding similar users and building an accurate neighborhood is an important part of recommending process of collaborative recommender systems. Similarities of two users are discovered based on their appreciations of items. But similar appreciations in one domain dont surely mean that in another domain valuations are similar as well. Users sharing preferences in comedies are not by all means like the same type of horrors (See Figure 12).

Semantic analysis can be used in different type of recommender systems for a better understanding relation between items and users, like creating a semantic neighborhood among ontological profiles. Taxonomy of items is one of successful solutions for ”New Item” problem.[31][32]

Figure 12: An example of different valuations of movies in different domains Standard recommender systems based on collaborative filtering compare users without splitting items in different domains. In cross-domain systems similarities of users computed domain-dependent. An engine creates local neighborhoods for each user according to domains. Then, computed similarity values and finite set of nearest-neighbors are sent for overall similarities computation. Recommender system determines the overall similarity, creates overall neighborhoods and makes predictions and recommendations.[34] D. Peer-to-Peer approaches The recommender systems with P2P approaches are decentralized. Each peer can relate itself to a group of other peers with same interests and get recommendations from the users of that group. Recommendations can also be given based on the history of a peer. Decentralization of recommender system can solve the scalability problem. [35] [36]

TripFromTV is an example of a recommender agent that works with Digital Television based on a semantic information. Application collects the information about what kind of channels, programs and films are favorite ones while the user watches TV and creates their classification. Using this information the agent creates a profile of the user. Based on his history and profile the agent can give a recommendation about the places he can go, travel or just spend time (See Figure 11). If the user watches programs about Japan or sushi the system can recommend him a restaurant he would like near his place. With the help of internet the application can also show the opening times and special offers of that restaurant. [33]

E. Cross-lingual approaches The recommender system based on cross-lingual approach lets the users receive recommendations to the items that have descriptions in languages they dont speak and understand. Yang, Chen and Wu purposed an approach for a crosslingual news group recommendations. The main idea is to map both text and keywords in different languages into a single feature space, that is to say a probability distribution over latent topics. From the descriptions of items the system parses keywords than translates them in one defined language using dictionaries. After that, using collaborative or other filtering, the system gives recommendations to users.[37] With the help of semantic analysis it’s possible to make a language-independent representation of text. Pascal Lops purposed an approach with a recommender system called MARS. Based on Word Sense Disambiguation algorithm that exploits online multilingual lexical database as sense repository the engine assigns right meaning to the words avoiding synonyme problems.[38] Similar approach was purposed by Murad Magableh and Antonio Cau. They utilize online WordNet lexical ontology with EuroWordNet multilingual lexical resource to avoid synonyms problem and build more accurate relations between tags in folksonomies. Every time a user adds a tag to an item synonyms of the tag-word are discovered by the collaborative tagging system and added to the tag using the WordNet ontology. EuroWordNet builds relations between tags in different European languages, which let recommender systems compare and classify items with tags in different languages. [27] Cross-lingual recommender systems break the language barrier and gives opportunities to look for items, information, papers or books in other languages. IV. C HALLENGES AND I SSUES A. Cold-start Its difficult to give recommendations to new users as his profile is almost empty and he hasnt rated any items yet so his taste is unknown to the system. This is called the coldstart problem. In some recommender systems this problem is solved with survey when creating a profile. Items can also have a cold-start when they are new in the system and havent been rated before. Both of these problems can be also solved with hybrid approaches. B. Trust The voices of people with a short history may not be that relevant as the voices of those who have rich history in their profiles. The issue of trust arises towards evaluations of a certain customer. The problem could be solved by distribution of priorities to the users. C. Scalability With the growth of numbers of users and items, the system needs more resources for processing information and forming recommendations. Majority of resources is consumed with

the purpose of determining users with similar tastes, and goods with similar descriptions. This problem is also solved by the combination of various types of filters and physical improvement of systems. Parts of numerous computations may also be implemented offline in order to accelerate issuance of recommendations online. D. Sparsity In online shops that have a huge amount of users and items there are almost always users that have rated just a few items. Using collaborative and other approaches recommender systems generally create neighborhoods of users using their profiles. If a user has evaluated just few items then its pretty difficult to determine his taste and he/she could be related to the wrong neighborhood. Sparsity is the problem of lack of information. [12] E. Privacy Privacy has been the most important problem. In order to receive the most accurate and correct recommendation, the system must acquire the most amount of information possible about the user, including demographic data, and data about the location of a particular user. Naturally, the question of reliability, security and confidentiality of the given information arises. Many online shops offer effective protection of privacy of the users by utilizing specialized algorithms and programs. V. C ONCLUSION Recommendation systems have definitely opened new options of searching and filtering information. Internet stores have accelerated profits, music lovers have discovered new artists unknown to them before, and tourists might take a look to new interesting places. Having all these options available, the customers save their time in multiple numbers. And this is the minor part of the beneficial influence of recommendation system on the clients. At the same time, there are some shortcomings, limits, and defects. Some of them were discussed above. Numerous improvements are required in the sphere of development of user’s model, of dapper semantic analysis of information, and of acceleration and polishing of recommendations. Recommendation systems are not limited by only computers and mobile devices, but they can also open new security capabilities while embedded into automobile industry, and overall, into devices of everyday use. This, in turn, would require development of more specified recommendation systems. All these facts make us sure that these systems will be promising and topical for long time. And we are just in the initial stage of their development. R EFERENCES
[1] P. Resnick and H. R. Varian, “Recommender systems,” Commun. ACM, vol. 40, pp. 56–58, March 1997. [Online]. Available: http://doi.acm.org/10.1145/245108.245121 [2] L. Candillier, F. Meyer, F. Fessant, and K. Jack, “State-of-the-art recommender systems,” 2009.

[3] H. Tan and H. Ye, “A collaborative filtering recommendation algorithm based on item classification,” in Proceedings of the 2009 Pacific-Asia Conference on Circuits, Communications and Systems. Washington, DC, USA: IEEE Computer Society, 2009, pp. 694–697. [Online]. Available: http://portal.acm.org/citation.cfm?id=1636711.1637609 [4] A. Kuepper, “Recommender systems,” eCommerce, vol. Chapter 08, p. 13, 2011. [5] A scalable collaborative filtering algorithm based on localized preference, vol. 1, 2008. [Online]. Available: http://dx.doi.org/10.1109/ICMLC.2008.4620397 [6] G. Linden, B. Smith, and J. York, “Amazon.com recommendations: Item-to-item collaborative filtering,” IEEE Internet Computing, vol. 7, pp. 76–80, January 2003. [Online]. Available: http://portal.acm.org/citation.cfm?id=642462.642471 [7] S. Jung, J. Kim, and J. L. Herlocker, “Applying collaborative filtering for efficient document search,” in Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence, ser. WI ’04. Washington, DC, USA: IEEE Computer Society, 2004, pp. 640–643. [Online]. Available: http://dx.doi.org/10.1109/WI.2004.33 [8] Z. Sun and N. Luo, “A new user-based collaborative filtering algorithm combining data-distribution,” in Proceedings of the 2010 International Conference of Information Science and Management Engineering - Volume 02, ser. ISME ’10. Washington, DC, USA: IEEE Computer Society, 2010, pp. 19–23. [Online]. Available: http://dx.doi.org/10.1109/ISME.2010.48 [9] S. Vucetic and Z. Obradovic, “A regression-based approach for scalingup personalized recommender systems in e-commerce,” in In: ACM WebKDD 2000 Web, 2000. [10] Z.-D. Zhao and M.-s. Shang, “User-based collaborative-filtering recommendation algorithms on hadoop,” in Proceedings of the 2010 Third International Conference on Knowledge Discovery and Data Mining, ser. WKDD ’10. Washington, DC, USA: IEEE Computer Society, 2010, pp. 478–481. [Online]. Available: http://dx.doi.org/10.1109/WKDD.2010.54 [11] X. Zhu, H.-W. Ye, and S. Gong, “A personalized recommendation system combining case-based reasoning and user-based collaborative filtering,” in Control and Decision Conference, 2009. CCDC ’09. Chinese, 2009, pp. 4026 –4028. [12] B. Sarwar, G. Karypis, J. Konstan, and J. Reidl, “Item-based collaborative filtering recommendation algorithms,” in Proceedings of the 10th international conference on World Wide Web, ser. WWW ’01. New York, NY, USA: ACM, 2001, pp. 285–295. [Online]. Available: http://doi.acm.org/10.1145/371920.372071 [13] G. Adomavicius and A. Tuzhilin, “Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions,” IEEE Trans. on Knowl. and Data Eng., vol. 17, pp. 734–749, June 2005. [Online]. Available: http://dx.doi.org/10.1109/TKDE.2005.99 [14] R. Burke, “The adaptive web,” P. Brusilovsky, A. Kobsa, and W. Nejdl, Eds. Berlin, Heidelberg: Springer-Verlag, 2007, ch. Hybrid web recommender systems, pp. 377–408. [Online]. Available: http://portal.acm.org/citation.cfm?id=1768197.1768211 [15] J. Salter and N. Antonopoulos, “Cinemascreen recommender agent: Combining collaborative and content-based filtering,” IEEE Intelligent Systems, vol. 21, pp. 35–41, January 2006. [Online]. Available: http://portal.acm.org/citation.cfm?id=1137235.1137342 [16] W. Woerndl and J. Schlichter, “Introducing context into recommender systems.” Muenchen, Germany: Technische Universitaet Muenchen, pp. 138–140. [17] M. van Setten, S. Pokraev, and J. Koolwaaij, “Context-aware recommendations in the mobile tourist application compass,” in Adaptive Hypermedia and Adaptive Web-Based Systems, ser. Lecture Notes in Computer Science, P. De Bra and W. Nejdl, Eds. Springer Berlin / Heidelberg, 2004, vol. 3137, pp. 515–548, 10.1007/978 − 3 − 540 − 27780 − 42 7. [Online]. Available: http : //dx.doi.org/10.1007/978 − 3 − 540 − 27780 − 42 7 [18] G. Adomavicius and A. Tuzhilin, “Context-aware recommender systems,” in Recommender Systems Handbook: A Complete Guide for Research Scientists and Practitioners. Springer, 2010. [19] L. Baltrunas and F. Ricci, “Context-dependent items generation in collaborative filtering,” 2009. [20] L. Baltrunas and X. Amatriain, “Towards time-dependant recommendation based on implicit feedback,” 2009.

[21] T. Bogers, “Movie recommendation using random walks over the contextual graph,” 2010. [22] S. Aciar, “Mining context information from consumers reviews,” 2010. [23] T. hun Kima, J. woo Song, and S. bong Yang, “L-prs: A location-based personalized recommender system.” Seoul, South Korea: Department of Computer Science, Yonsei Univerisity. [24] A. Elgohary, H. Nomir, I. Sabek, M. Samir, M. Badawy, and N. A. Yousri, “Wiki-rec: A semantic-based recommendation system using wikipedia as an ontology,” in Intelligent Systems Design and Applications (ISDA), 2010 10th International Conference on, 29 2010. [25] E. Peis, J. M. Morales-del Castillo, and J. A. Delgado-Lpez, “Semantic recommender systems. analysis of the state of the topic.” Seoul, South Korea: Department of Computer Science, Yonsei Univerisity, 2008. [26] Wikipedia, “Taxonomy — wikipedia, the free encyclopedia,” 2011, [Online; accessed 31-January-2011]. [Online]. Available: http : //en.wikipedia.org/w/index.php?title = T axonomyoldid = 410262106 [27] M. Magableh, A. Cau, H. Zedan, and M. Ward, “Towards a multilingual semantic folksonomy,” in Proceedings of the IADIS International Conferences Collaborative Technologies 2010 and Web Based Communities 2010, July 2010, pp. 178–182. [28] J. Porter, “Folksonomies: A User-Driven Approach to Organizing Content,” Apr. 2005. [Online]. Available: http://www.uie.com/articles/folksonomies/ [29] T. Gruber. (2005) Ontology of Folksonomy: A Mash-up of Apples and Oranges. First on-Line conference on Metadata and Semantics Research (MTSR’05). [Online]. Available: http://tomgruber.org/writing/mtsr05ontology-of-folksonomy.htm [30] A. Gomez-Perez, O. Corcho-Garcia, and M. Fernandez-Lopez, Ontological Engineering. Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2003. [31] H. K. Farsani and M. Nematbakhsh, “A semantic recommendation procedure for electronic product catalog,” 2006. [32] A. Sieg, B. Mobasher, and R. Burke, “Improving the effectiveness of collaborative recommendation with ontology-based user profiles,” in Proceedings of the 1st International Workshop on Information Heterogeneity and Fusion in Recommender Systems, ser. HetRec ’10. New York, NY, USA: ACM, 2010, pp. 39–46. [Online]. Available: http://doi.acm.org/10.1145/1869446.1869452 [33] Y. Blanco-Fernandez, M. Lopez-Nores, J. Pazos-Arias, A. Gil-Solla, and M. Ramos-Cabrer, “Exploiting digital tv users’ preferences in a tourism recommender system based on semantic reasoning,” in Consumer Electronics (ICCE), 2010 Digest of Technical Papers International Conference on, 2010, pp. 139 –140. [34] S. Berkovsky, T. Kuflik, and F. Ricci, “Cross-domain mediation in collaborative filtering,” in Proceedings of the 11th international conference on User Modeling, ser. UM ’07. Berlin, Heidelberg: Springer-Verlag, 2007, pp. 355–359. [Online]. Available: http : //dx.doi.org/10.1007/978 − 3 − 540 − 73078 − 14 4 [35] R. Kanawati and H. Karoui, “A p2p collaborative bibliography recommender system,” in Proceedings of the 2009 Fourth International Conference on Internet and Web Applications and Services. Washington, DC, USA: IEEE Computer Society, 2009, pp. 90–96. [Online]. Available: http://portal.acm.org/citation.cfm?id=1585689.1586218 [36] R. Baraglia, M. Mordacchini, P. Dazzi, and L. Ricci, “A p2p recommender system based on gossip overlays (prego),” in Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on, 2010, pp. 83 –90. [37] C.-Z. Yang, I.-X. Chen, and P.-J. Wu, “Cross-lingual news group recommendation using cluster-based cross-training.” Taiwan: Computational Linguistics and Chinese Language Processing, 2008, pp. 41–60. [38] P. Lops, C. Musto, F. Narducci, M. De Gemmis, P. Basile, and G. Semeraro, “Mars: a multilanguage recommender system,” in Proceedings of the 1st International Workshop on Information Heterogeneity and Fusion in Recommender Systems, ser. HetRec ’10. New York, NY, USA: ACM, 2010, pp. 24–31. [Online]. Available: http://doi.acm.org/10.1145/1869446.1869450

Similar Documents

Free Essay

Tv Recommendation

...A GRAPH BASED COLLABORATIVE AND CONTEXT AWARE RECOMMENDATION SYSTEM FOR TV PROGRAMS A THESIS SUBMITTED TO THE GRADUATE SCHOOL OF NATURAL AND APPLIED SCIENCES OF MIDDLE EAST TECHNICAL UNIVERSITY BY EMRAH ŞAMDAN IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER ENGINEERING SEPTEMBER 2014 Approval of the thesis: A GRAPH BASED COLLABORATIVE AND CONTEXT AWARE RECOMMENDATION SYSTEM FOR TV PROGRAMS submitted by EMRAH ŞAMDAN in partial fulfillment of the requirements for the degree of Master of Science in Computer Engineering Department, Middle East Technical University by, Prof. Dr. Canan Özgen Dean, Graduate School of Natural and Applied Sciences _____________ Prof. Dr. Adnan Yazıcı Head of Department, Computer Engineering _____________ Prof. Dr. Nihan Kesim Çiçekli Supervisor, Computer Engineering Dept, METU _____________ Examining Committee Members: Prof. Dr. Ferda Nur Alpaslan Computer Engineering Dept., METU _____________ Prof. Dr. Nihan Kesim Çiçekli Computer Engineering Dept., METU _____________ Prof. Dr. Ali Doğru Computer Engineering Dept., METU _____________ Prof. Dr. Ahmet Coşar Computer Engineering Dept., METU _____________ M.Sc. Deniz Kaya Arçelik A.Ş. _____________ Date: 05.09.2014 I hereby declare that all information in this document has been obtained and presented in accordance with academic rules and ethical conduct. I also declare ...

Words: 13697 - Pages: 55

Free Essay

Personalized Recommendation Based on Overlapping Communities Using Time-Weighted Association Rules

...Personalized recommendation based on overlapping communities using time-weighted association rules Haoyuan Feng1, Jin Tian1, Harry Jiannan Wang2, Minqiang Li1, Fuzan Chen1, Nan Feng1 1 2 Tianjin University, Tianjin, 300072, P.R. China University of Delaware, Newark, DE, 19716, USA jtian@tju.edu.cn Abstract Modeling users’ ever-changing interests has been a critical topic in recommender system research. In this paper, we propose a new personalized recommendation framework by leveraging and enhancing overlapping community concepts from complex network analysis literature and developing a time-weighted association rule mining method. Experiment results show that our proposed approach outperforms several existing methods in recommendation precision and diversity. Keywords: personalized recommendation; overlapping community; time-weighted association rules; user interests 1. Introduction Recommender systems have been implemented by many commercial websites, such as Amazon and eBay, to help users discover products of their interests. High-quality recommender algorithms and strategies can greatly increase profits and improve user loyalty. One of the most important aspects in personalized recommendation is the user interest modeling. Most of the conventional user interest models are static models, such as the user-based collaborative filter model, assuming that the users’ interests do not change over time. However, users’ interests are rather dynamic, e.g., users may prefer different...

Words: 3244 - Pages: 13

Free Essay

Personal Recommender System

...RECOMMENDER SYSTEMS MAN562 February 18, 2015 Abstract.               In the recent years, the web searches have witnessed a dramatic change where the people have had so much on the internet such that the searches have become extremely difficult. The users of the internet on a regular basis have found it difficult to use and find the required information. There has been also the claim that some of the data sources are unpopular which makes the finding of the information very difficult. The personal recommender system is responsible for building the gap between the objects and the users. The system recommends to the users the areas they might be interested in during browsing. The system is responsible for solving the problem that is being experienced today of information overload (Hang, Hsiao, 2013).               There are different algorithms, and they are responsible for producing the different systems. There is the system that collaborates and filters, the system that is based on content, the hybrid system, and the structure based system. All the four systems are determined by the different algorithms operating in each (Pu, Chen, & Hu, 2012).            Introduction               This recommender system is a subclass of the information filtering system that is responsible for predicting and rating the weight of an item as per the user requirements. In the recent years, the systems have become extremely...

Words: 2587 - Pages: 11

Premium Essay

Web 3.0

...WEB 3.0 FOR MASTERS IN APPLIED SCIENCE Information Communication and Technology MONIKA NEKKANTI UNIVERSITY OF DENVER UNIVERSITY COLLEGE FACULTY: STEVE STARLIPER DIRECTOR: TOM TIERNEY ICT 4005 Technical Foundations. October28, 2014 ABSTRACT Web systems are the fast growing and more demanded ones these days. Everyone rely upon it daily for any of their work that might be study, business, personal or entertainment purpose. Whatever the purpose is user expects a well organized, fast and intelligent communication with the system he/she uses. That is where web 3.0 comes into picture. This paper gives a clear idea about web 3.0 which can be easily understood by a newbie too. How intelligent web systems work and what all components and methods, how they work and make the web system intelligent. It even covers about some fallacies people make while choosing an algorithm for their web system and also discusses how it benefits the user and makes his/her work easy. This gives a quick idea about the internal functioning of the web system and limitations. TABLE OF CONTENT 1. INTRODUCTION 1 2. EVOLUTION OF WEB 2 a. WEB 1.0 2 b. WEB 2...

Words: 3973 - Pages: 16

Premium Essay

Social Network and Mobile Computing

...Location Recommendation for Location-based Social Networks Mao Ye Peifeng Yin Wang-Chien Lee Department of Computer Science and Engineering The Pennsylvania State University University Park, PA 16802, USA {mxy177,pzy102,wlee}@cse.psu.edu ABSTRACT In this paper, we study the research issues in realizing location recommendation services for large-scale location-based social networks, by exploiting the social and geographical characteristics of users and locations/places. Through our analysis on a dataset collected from Foursquare, a popular location-based social networking system, we observe that there exists strong social and geospatial ties among users and their favorite locations/places in the system. Accordingly, we develop a friend-based collaborative filtering (FCF) approach for location recommendation based on collaborative ratings of places made by social friends. Moreover, we propose a variant of FCF technique, namely Geo-Measured FCF (GM-FCF), based on heuristics derived from observed geospatial characteristics in the Foursquare dataset. Finally, the evaluation results show that the proposed family of FCF techniques holds comparable recommendation effectiveness against the state-of-the-art recommendation algorithms, while incurring significantly lower computational overhead. Meanwhile, the GM-FCF provides additional flexibility in tradeoff between recommendation effectiveness and computational overhead. networking services allow users to connect with friends, explore places...

Words: 3973 - Pages: 16

Free Essay

Key Manage, Emt

...working on different applications and ensure that each application's cryptographic capability meets minimum requirements and best practices. Identify the cryptographic and key management requirements for your application and map all components that process or store cryptographic key material. Use only reputable crypto libraries that are well maintained and updated, as well as tested and validated by 3rd party organizations (e.g., NIST/FIPS) Key Selection Selection of the cryptographic and key management algorithms to use within a given application should begin with an understanding of the objectives of the application. For example, if the application is required to store data securely, then the developer should select an algorithm suite that supports the objective of Data-At-Rest (DAR) security. Applications that are required to transmit and receive data would select an algorithm suite that supports the objective of Data-in-Transit security. We have provided recommendations on the selection of crypto suites within an application based on application and security objectives. Application developers oftentimes begin the development of crypto and key management capabilities by examining what is available in a library. However, an analysis of the real needs of the application should be...

Words: 1040 - Pages: 5

Free Essay

Genetic Algorithms

...Genetic Algorithm Approach to Solve the Shortest Path Problem for Road Maps Sachith Abeysundara*, Baladasan Giritharan+, Saluka Kodithuwakku◊ *Department of Statistics and Computer Science, Faculty of Science, University of Peradeniya, Sri Lanka Email: sachith@email.com Telephone: (+94) 81 2374652 + Department of Statistics and Computer Science, Faculty of Science, University of Peradeniya, Sri Lanka Email: bgiri@pdn.ac.lk ◊ Department of Statistics and Computer Science, Faculty of Science, University of Peradeniya, Sri Lanka Email: salukak@pdn.ac.lk Telephone: (+94) 81 2394260 Abstract—This paper presents a new genetic algorithm approach to solve the shortest path problem for road maps. This is based on the analogy of finding the shortest possible distance between two towns or cities in a graph or a map with potential connection, which means that the path distances are always positive. Typically this is represented by a graph with each node representing a city and each edge being a path between two cities and there exist some traditional algorithms that produce solutions for the problem. A new method is found to solve the shortest path problem using GAs. The algorithm has been tested for a road map containing more than 125 cities and the experimental results guarantee to provide acceptably good solutions for the given search space. HE shortest path problem is typical in the world of combinatorial systems. This research will attempt to apply a Genetic algorithm to solve...

Words: 2513 - Pages: 11

Premium Essay

Hp Case Study

...more configurations to meet consumer interests. However the supply chain managers wanted less complexity and were interested in more predictable order cycle times. HP needed to implement a fact-based, data-driven tool to improve decision making. HP developed a team of individuals internally and externally from consultancies and universities to help with the challenges the company faced. This team developed a process for evaluating new products for introduction, created a tool for prioritizing existing products in a portfolio, and developed an algorithm that solved problems faster than previous technologies (Turban, Sharda, Delen. (2011)). The team developed a pre-launch and post-launch plan to assess whether product ideas were great enough investments to bring forth returns and maximize profits. The team also developed a Revenue Coverage Optimization (RCO) tool to manage product portfolios as sales data became available. The RCO algorithm...

Words: 1705 - Pages: 7

Premium Essay

Netflix Research Paper

...I choose Netflix for my final project because the Netflix brand itself has continued to rise and become a household name for all ages and I am and continue to be impressed with the dynamics of Netflix as they have developed their own series and movies that are specific to only their brand. In this project, I will address Netflix’s history timeline and some aspects of the business and technology. First of all, my project will be based on Netflix’s history timeline. Netflix has done what most technology companies have not. It went beyond its original capabilities and business developed skills to win in online streaming. I would describe Netflix’s unique selling proposition as simply “the future and convenience at your fingertips.” The tweet...

Words: 589 - Pages: 3

Premium Essay

Bscs Final Project Proposal-Template

...appropriate difficulty level for the number of students named above. Note:Advisor can’t be changed without prior permission of the Manager Projects and the duration for completion of the Project is 2 regular semesters (approx.) from the date of Registration of Research Project. | Signatures and Date | Advisor | EVALUATOR/REFEREE 1 I have carefully read the project proposal and feel that the proposed project is a useful one and of a sufficient difficulty level to justify 2 regular semesters workload for above mentioned students. I have made recommendations in the evaluation form to improve the scope and quality of the project. | | Signatures and Date | | | | | | | | | | EVALUATOR/REFEREE 2 I have carefully read the project proposal and feel that the proposed project is a useful one and of a sufficient difficulty level to justify 2 regular semesters workload for above mentioned students. I have made recommendations in...

Words: 1146 - Pages: 5

Premium Essay

Google Analysis

...(Name) (Tutor) (Course) (Date) Google 2012 Overview An overview of Gamble’s work demonstrates an in-depth understanding of the history of Google, which started from Stanford and ended up with the creation of a company. The company is no longer a simple search engine, but it supports other services such as cloud computing web services, social media such as Google +, and web browser. This venture was made possible by the creation of the company’s principles, which guide its activities at all time. For instance, they believe the client must be first and every other matter will follow. Ever since the company announced its first IPO in 2004, the institute has experienced continuous success in the stock market. Indeed. Even when the market crushed in 2008, many people thought the crush would affect all sectors, but Google continued to increase its annual revenue, stock holder’s equity, and net assets. The analysis, nevertheless, demonstrates that some readers find Google’s growth rather alarming. It would be difficult for the company to continue in the same way without contracting some “evil” deals and breaking law number 6. Analysis A clearer analysis of the company shows that as Google grew, most of its services extended from simply being a search engine to providing other services to its users. Initially, Google focused on a market niche of people that were looking for information. Consequently, they created a search engine, which would act superior to all other competition. Indeed...

Words: 1168 - Pages: 5

Free Essay

Pdf of Telecom

...Optimization Manual Key words: MOS, interference, BER, C/I, power control, DTX, frequency hopping, PESQ, PSQM /PSQM+, PAMS Abstract: With the development of the radio network, mobile operators become more focused on end users’ experience instead of key performance indicators (KPIs). The improvement of the end users’ experience and the improvement of the network capacity are regarded as KPIs. Therefore, Huawei must pay close attention to the improvement of the soft capability of the network quality as well as the fulfillment of KPIs. At present, there are three methods of evaluating the speech quality: subjective evaluation, objective evaluation, and estimation. Among the three methods, objective evaluation is the most accurate. The PESQ algorithm defined by the ITU can objectively evaluate the speech quality of the communication network. This document uses the mean opinion score (MOS) to label the speech quality after objective evaluation. This...

Words: 9686 - Pages: 39

Premium Essay

Transit Time Analysis

...I. Goal The aim of this project is to analyze the output of the Transit Time System and recommend changes to improve the reliability of its estimates. II. Background By the current definition, Transit Time (TT) is the number of hours it takes for a package to get delivered to the customer from the moment it was tendered at the FC. It excludes the non-processing time (e.g. weekends) of the carriers. (Refer Appendix IIA for an example of UPS transit times from LEX1) Transit Times are used to predict whether a given ship method can meet a given promise to the customer. Also, inconsistencies in measured/estimated transit times may expose issues or opportunities in the shipping processes. Transit Time is a function of a 3-tuple: (source, ship method,...

Words: 3556 - Pages: 15

Free Essay

Ramp Metering

...................................................................................................... 3 2- History .............................................................................................................................. 4 3- Ramp Metering Algorithms .......................................................................................... 5 3-1- S ystem Architecture .............................................................................................. 5 3-2- Release Algorithm .................................................................................................. 6 3-3- A rbitration Algorithm .............................................................................................. 7 3-4- S witch On- Off Algorithm ....................................................................................... 8 3-5- Q ueue Override Algorithm .................................................................................... 9 3-6- Q ueue Management Algorithm ........................................................................... 9 3-7- Ramp Metering Algorithm ...................................................................................10 3-8- Data Filtering Algorithm: .....................................................................................10 4- Types of Ramp Metering ............................................................................................11 4-1- Local Ramp Metering ..........................

Words: 2688 - Pages: 11

Premium Essay

Network Security

...solve the issue of cloud computing service security; including SmartCryptor, Trend Micro SecureCloud, and CloudPassage Halo. These three products were selected because they contain the similar features to protect the hacker or data lose on the cloud network. The features of their products are compared and contrasted to identify the most benefits to the users. I set the selection criteria including cost, features, how to use, security level, and company-fit. The CloudPassage Halo products shows the most powerful products, however, I found many features are duplicated to the network security features that may implemented together with the servers. The cost is considered high. I recommended the Trend Micro SecureCloud with powerful encryption algorithm (AES –standard) and be controlled by policy –driven KEY that can self-adjust to any organisation. The price is reasonable with their features. Moreover, in small company who uses the third-party cloud service, SmartCryptor is chosen as very budget (just $6/months), the use can add another level of security in file encryption and do not worry that others will access your file. To sum up, every products has their own advantage and disadvantage, the way of product selection should consider what we really need, the product feature is solve the problem, and the price should be reasonable. 2. Introduction Cloud Computing services are provided by the third party company who developed the infrastructure. The main advantage of using Cloud Computing...

Words: 2036 - Pages: 9