SlideShare une entreprise Scribd logo
1  sur  7
Télécharger pour lire hors ligne
International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015
DOI:10.5121/ijfcst.2015.5402 13
A LOCATION-BASED MOVIE RECOMMENDER SYSTEM
USING COLLABORATIVE FILTERING
Kasra Madadipouya
Department of Computing and Science, Asia Pacific University of Technology &
Innovation
ABSTRACT
Available recommender systems mostly provide recommendations based on the users’ preferences by
utilizing traditional methods such as collaborative filtering which only relies on the similarities between
users and items. However, collaborative filtering might lead to provide poor recommendation because it
does not rely on other useful available data such as users’ locations and hence the accuracy of the
recommendations could be very low and inefficient. This could be very obvious in the systems that locations
would affect users’ preferences highly such as movie recommender systems. In this paper a new location-
based movie recommender system based on the collaborative filtering is introduced for enhancing the
accuracy and the quality of recommendations. In this approach, users’ locations have been utilized and
take in consideration in the entire processing of the recommendations and peer selections. The potential of
the proposed approach in providing novel and better quality recommendations have been discussed
through experiments in real datasets.
KEYWORDS
Recommender system, Movie recommender system, Location-based recommender, Collaborative filtering,
Pearson correlation, Context-aware
1. INTRODUCTION
In traditional recommender systems the recommendation procedure is done with considering
about users’ past rating history and items features (tagging) and basically no contextual
information is taken into account for generating recommendations [1]. However, there are usually
various factors influencing users’ decision on in reality. Besides, users’ demand might change
with context as well (e.g. time, location and weather etc) which cannot be accomplished through
tradition recommender systems.
As a result just having information about users, items and/or few contextual parameters are not
sufficient enough to give accurate real-time emotional-based recommendations, however, more
information is necessary in order to provide items to users under certain conditions [2]. For
instance, adding the temporal, day/night context, in recommender systems would provide more
accurate recommendations which also might reflect user's emotions as well. Additionally, in the
personalized content delivery for a recommender system, this fact is crucial to determine whether
particular content should be delivered to users or not and if it has to be recommended to users
when it should be recommended [2].
With the creation of the new generation recommender system, contextual information has become
one of the most valuable knowledge sources to improve recommendations and provide more user
specific recommendations under that similar circumstance (i.e., contexts) are related with similar
user preferences [1][3] [4].
International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015
14
A better Recommendation System (RS) is the one which delivers recommendations that best
match with users' preferences, needs and hopes at the right moment, in the right place and on the
right media. This can't be achieved without designing a RS that takes into account all information
and parameters that influence user's ratings. This information may concern demographic data [5]
preferences about user's domain of interest, quality and delivery requirements as well as the time
of the interaction, the location, the media, the cognitive status of the user and his availability.
Hence, giving precise recommendations to user is deepened on the relevant gathered information
about the user's preferences such as user's location and other parameters.
The rest of the paper is organized as follows; in the next section a review regarding different
movie recommender systems are provided. In section three the proposed algorithm is explained in
detail which is based on the collaborative filtering and Pearson Correlation Coefficient. Then in
the next segment, the results of the experiment is analyzed and presented. Finally, in the last
section, conclusions and future enhancement are discussed.
2. RELATED WORK
In recommender systems variety of research had been conducted to deliver the most relevant
content to user [6][7] [8] in different recommendation scopes for users, such as music
recommendation [9][10][11], location-based services [12][13] or even recommendation system
for tourism [14][15][16].
In movie recommender system some of the works focus on inputting rich and detailed meta-data
(genre and other features) to the system in order to enhance the quality of recommendations. In a
movie recommender system by [17], this facility was provided to allow user to even set new
keywords for movies which resulted in providing more accurate recommendations based on
features which set users. The big advantage of this solution is that it adapts to changes regarding
what the users find important, something which can change over time. However, manually
categorization of content can be expensive, time-consuming, error-prone and highly subjective.
Due to this, many systems aim to automate the procedure.
Another approach of providing high quality recommendation can be achieved by utilizing
contextual-information [18] such as time of the day, users’ mood, etc. According to [19] most of
the users who are located in the same geographical location have the similar taste to each other.
For instance, users who are located in Florida mostly like to watch “Fantasy”, “Animation” types
of the movie however, the user from Minnesota State are mostly interested to “War”, “Drama”
type of the movie. Therefore, in recommending items the location of the user is not considered in
any steps, as a result it is possible for a user who is looking for a resultant in Chicago get
recommendations about some restaurants that are located in other areas such as Seattle [19].
Various algorithms examine by researchers in order to enhance the traditional recommender
systems. For instance, in [20], authors presented a novel hybrid approach for movie recommender
systems whereby items are recommended based on the collaborative between users as well as
analysing contents. In another work by Bogers [21], an algorithm based on Markov random walk
proposed which applied on a movie dataset by considering regarding some contextual
information. In addition, Rendle et al. [22] applied matrix factorization in a movie dataset with
the aim of enhancing the quality and accuracy of the recommendation as well as reducing the
complexity of building their model. Simon Funk proposed Regularized singular value
decomposition (RSVD) to enhance the accuracy of the recommendation which reduces the
dimensionality of the original rating matrix [23].
International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015
15
3. THE PROPOSED ALGORITHM
The new method was made to reach to numbers of goals and objectives. Firstly, by contrast of the
baseline collaborative filtering that does not take into account users’ locations in providing
recommendations, in this framework current user location is considered in the system in which
user gets different recommendations based on the location. This reflects the fact that if the user
changes his/her location the received recommended items will be affected because of changing in
the location. Secondly, user preferences that lead him/her to select an item, and correspondingly
potentially generates better recommendations based on the user location which increases the
locality of the recommended items. Lastly, the main goal is to improve the locality of the
recommendations in both peers selection stage and item recommendations with gathering some
information about user location and considering about user location in all recommendation
processes.
The only recommendation method that is used in the framework contains the following steps as
demonstrated in below,
1- Keeping a copy of the user profile in the memory (memory-based approach).
2- Applying similarity index function for the user to find the peers (Pearson Correlation
Coefficient).
3- Adding α parameter for those peers who are in the same place with the active user.
4- Applying some filtrations on selected peers to reduce and remove non-related peers.
5- Selecting items for providing recommendations to the active user.
6- Showing the recommended items to the active user.
Figure_1 (Overview of collaborative filtering process)
Figure_2 (Pearson Correlation)
Since, the main algorithm (Figure_2) just relies on one parameter (similarity index) to select peers
to the active user and seems all the users with no difference, in this framework we introduced (α)
parameters refers to the priority index which directly affects the outcome of the similarity index
function that returns a value between (-1 to 1). In prioritize the users those users who are located
in the same geographical place with the active user get higher priority with add the constant value
(α) to the result of similarity index.
International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015
16
As it depicts in Figure_1 the framework is based on the collaborative filtering in which first the
users necessary information about the active user will be stored in different database from the
user profile in memory since some temporary analysis and changes might be applied in the user
profile which will not be overwritten on the user profile or change it. After copying it, the user
profile will pass through from peers selection stage, in that stage, firstly, similarity function is
applied for the active user against other users of the system to find which user has the similar
taste to the current user. Then peers are selected for the active user. In other word, users will be
classified in different groups which each group has the users with the same taste. After that, peers
location will be compared with the active user and those who are located in the same
geographical location with the active user, their similarity indexes will be increased by adding
constant value which is known as α. Then some filtrations will be applied to the peers who are
called threshold-based selection, according to which users whose similarity exceeds a certain
threshold value are considered as neighbors of the target user [24] and be selected as final peers to
give recommendations to the active user based on them. Hence, in this stage all peers who have
less than 0.5 similarity index (threshold) will be aborted and will not considered in further steps.
After applying filtration to the users in different peers groups, top peers of the active user will be
nominated for providing recommendations. Finally, top rated items of the peers who gained the
highest similarity indexes will be selected for recommendations. In the final stage, those
recommended and selected items are shown to the active users as recommendations.
4. EXPERIMENTAL RESULTS
For experimental test, LDOS-CoMoDa [25] dataset which is provided by Laboratorij za digitalno
in French is utilized for testing the framework against the baseline collaborative (user-based)
filtering approach and therefore, necessary elements from the dataset are extracted for
experiment. In the dataset, information about the users is available as part of the user profile and
in another section of the dataset list of the rated items, available items and many other parameters
are saved. All information in the dataset was gathered by crawling some agencies and was from
real user involvement in the system. Hence, there was no direct user involvement in the testing
system. However, for implementing the system in the real world all above elements are necessary
and should be available for completeness of the system.
Overall the dataset contains 2296 records (rows) which are recorded 120 users’ behaviors. The
total fields of dataset after modification is six fields, which are userID, itemID, Country (User
location), Rating, item description, Related to (Country of item). The rating range is from 1 to 5
which one expresses that the user is highly dislike the item and five represents that the user is
highly interested in the item. Number of ratings for each user is various and is not dependent to
any parameters such as user location or anything else. The reason for that, it to make the dataset
to what happens in reality which the number of ratings items for each user could be different and
it is not dependent to any obvious parameter. Therefore, this dataset is obtained by gathering data
from different agencies and hence, it is exactly recorded users’ behaviors. Table_1 demonstrates
all mentioned information about the dataset in summery.
Table_1 (Dataset information)
International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015
17
The users of the dataset are from five different countries (Denmark, France, Germany, UK, and
US). Each country contains different number of the users and this parameter is independent
parameter, but in average base on the number of total user each country has 24 users. Table_2
demonstrates, the exact number of each user for each mentioned country.
Table_2 (User distribution in countries-table)
The experiment has been applied for both baseline Pearson Correlation algorithm and the
proposed framework in the form of memory-based user-based filtering. In this experiment, the
framework is tested against various value of α (0.1, 0.2, 0.3) separately the results are
demonstrated in the following section.
By applying the baseline Pearson Correlation in the dataset, the average gained peers locality was
14.10% which means that only 14.10% of peers are located in the same location with the active
users whereas the rest of the peers locations are not the same with the active user. Applying the
proposed framework with α = 0.1, gives different result which is demonstrate shows 1.20 per cent
(15.33% peers locality rate) improvement in comparison with the baseline approach.
By increasing α to 0.2, the improvement in locality rate reached near to 1.73 per cent (15.33%
peers locality rate). Finally for the last experiment α value is set to 0.3 and the framework has
been tested against the dataset which shows 1.87 percent (15.97% peers locality rate)
enhancement in peers selection stage.
Changing α value on the other hand affects the recommendation results as well in terms of the
locations that movie produced. In baseline algorithm only 1.46% of items related to the same
location as active user, however, by applying α = 0.1, this amount reached to 1.7% and the
number increased to 1.88% and 1.99 by applying α = 0.2 and α = 0.3 respectively.
5. CONCLUSION AND FUTURE WORK
In this paper a novel framework to improve locality in user-based collaborative filtering for movie
recommender system is proposed and experimental results of the evolution of is presented which
gathered results from different tests on dataset analyzed and presented. In addition to that,
compare and comparison between the baseline algorithm and the proposed approach is provided
in details based on the experimental results.
As already mentioned earlier, the dataset which has been used for this work is part of LDOS-
CoMoDa dataset that gathered from various movies agencies. Hence, for future work in order to
reach to more accurate result and better analysis, the experiment should be performed on other
and bigger datasets which contains hundred thousand of records and have different level of
sparseness. In addition, the experimental performed under the lab condition and there was no
direct user involvement in experiment the framework and method for getting results. Hence, the
proposed method could be implemented in the real environment against the real user experiment.
International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015
18
Moreover, the proposed method in this work applied on one class of filtering method which is
Pearson correlation coefficient. Thus, various algorithms from both collaborative and content
based approaches could be tested against the dataset and the results compared with the proposed
framework in order to provide more accurate analysis.
REFERENCES
[1] Adomavicius, G., Tuzhilin, A. and Er. 2011. Context-aware recommender systems. Springer, pp. 217-
-253.
[2] Junmanee, S. and Hinze, A. (2006). Advanced recommendations in a mobile tourist information
system.
[3] Baltrunas, Linas et al. 'Context Relevance Assessment And Exploitation In Mobile Recommender
Systems'. Pers Ubiquit Comput 16.5 (2011): 507-526. Web. 7 May 2015.
[4] Gorgoglione, Michele, Umberto Panniello, and Alexander Tuzhilin. 'The Effect Of Context-Aware
Recommendations On Customer Purchasing Behavior And Trust'. Proceedings of the fifth ACM
conference on Recommender systems - RecSys ' 11 (2011): n. pag. Web. 7 May 2015.
[5] Krulwich, Bruce.: ‘Lifestyle finder: intelligent user profiling using large-scale demographic data’. AI
Magazine 18(2), 37–45 (1997).
[6] Adomavicius, G., Sankaranarayanan, R., Sen, S. and Tuzhilin, A. (2006). Incorporating contextual
information in recommender systems using a multidimensional approach. ACM Transactions on
Information Systems (TOIS), 23 (1), pp. 103-145.
[7] Wang, Yiwen et al. 'Recommendations Based On Semantically Enriched Museum Collections'. Web
Semantics: Science, Services and Agents on the World Wide Web 6.4 (2008): 283-290. Web.
[8] Bobillo, Fernando, Miguel Delgado, and Juan Gómez-Romero. 'Representation Of Context-
Dependant Knowledge In Ontologies: A Model And An Application'. Expert Systems with
Applications 35.4 (2008): 1899-1908. Web. 7 May 2015.
[9] Wang, Xinxi, Ye Wang, and David Rosenblum. "A daily, activity-aware, mobile music recommender
system." Proceedings of the 20th ACM international conference on Multimedia. ACM, 2012.
[10] Lampropoulou, P. S., A. S. Lampropoulos, and G. A. Tsihrintzis. 'A Mobile Music Recommender
System Based On A Two-Level Genre-Rating SVM Classifier Enhanced By Collaborative Filtering'.
New Directions in Intelligent Interactive Multimedia Systems and Services - 2 (2009): 361-368. Web.
7 May 2015.
[11] Lampropoulos, Aristomenis S., Paraskevi S. Lampropoulou, and George A. Tsihrintzis. 'A Cascade-
Hybrid Music Recommender System For Mobile Services Based On Musical Genre Classification
And Personality Diagnosis'. Multimedia Tools and Applications 59.1 (2011): 241-258. Web. 7 May
2015.
[12] Daly, Elizabeth M., and Werner Geyer. 'Effective Event Discovery'. Proceedings of the fifth ACM
conference on Recommender systems - RecSys '11 (2011): n. pag. Web. 7 May 2015.
[13] Barranco, Manuel J. et al. 'A Context-Aware Mobile Recommender System Based On Location And
Trajectory'. Advances in Intelligent Systems and Computing (2012): 153-162. Web. 7 May 2015.
[14] Noguera, José M. et al. 'A Mobile 3D-GIS Hybrid Recommender System For Tourism'. Information
Sciences 215 (2012): 37-52. Web. 7 May 2015.
[15] Kuo, Mu-Hsing, Liang-Chu Chen, and Chien-Wen Liang. 'Building And Evaluating A Location-
Based Service Recommendation System With A Preference Adjustment Mechanism'. Expert Systems
with Applications 36.2 (2009): 3543-3554. Web. 7 May 2015.
[16] Savage, Norma Saiph, et al. I’m feeling loco: A location based context aware recommendation
system. Springer Berlin Heidelberg, 2012.
[17] Garden, M. and Dudek, G. (2006) "Mixed collaborative and content-based filtering with user-
contributed semantic features", paper presented at AAAI'06 proceedings of the 21st national
conference on Artificial intelligence , AAAI Press, p.1307-1312.
[18] Wang, L. (2011). Understanding and using contextual information in recommender systems. pp.
1329--1330.
[19] Lev, Oski, J., Sarwat, M., Eldawy, A. and Mokbel, M. (2012). Lars: A location-aware recommender
system. pp. 450--461.
[20] Lekakos, G., & Caravelas, P. (2008). A hybrid approach for movie recommendation. Multimedia
tools and applications, 36(1-2), 55-70.
International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015
19
[21] Bogers, T. (2010, October). Movie recommendation using random walks over the contextual graph. In
Proc. of the 2nd Intl. Workshop on Context-Aware Recommender Systems.
[22] Rendle, S., Gantner, Z., Freudenthaler, C., & Schmidt-Thieme, L. (2011, July). Fast context-aware
recommendations with factorization machines. In Proceedings of the 34th international ACM SIGIR
conference on Research and development in Information Retrieval (pp. 635-644). ACM.
[23] Funk, S. (2006). Netflix update: Try this at home.
[24] Gong, S. (2010). A collaborative filtering recommendation algorithm based on user clustering and
item clustering. Journal of Software, 5 (7), pp. 745--752.
[25] http://recsyswiki.com/wiki/LDOS_Comoda

Contenu connexe

Similaire à A LOCATION-BASED MOVIE RECOMMENDER SYSTEM USING COLLABORATIVE FILTERING

IRJET- Analysis of Rating Difference and User Interest
IRJET- Analysis of Rating Difference and User InterestIRJET- Analysis of Rating Difference and User Interest
IRJET- Analysis of Rating Difference and User InterestIRJET Journal
 
Mixed Recommendation Algorithm Based on Content, Demographic and Collaborativ...
Mixed Recommendation Algorithm Based on Content, Demographic and Collaborativ...Mixed Recommendation Algorithm Based on Content, Demographic and Collaborativ...
Mixed Recommendation Algorithm Based on Content, Demographic and Collaborativ...IRJET Journal
 
A literature survey on recommendation
A literature survey on recommendationA literature survey on recommendation
A literature survey on recommendationaciijournal
 
A Literature Survey on Recommendation System Based on Sentimental Analysis
A Literature Survey on Recommendation System Based on Sentimental AnalysisA Literature Survey on Recommendation System Based on Sentimental Analysis
A Literature Survey on Recommendation System Based on Sentimental Analysisaciijournal
 
SIMILARITY MEASURES FOR RECOMMENDER SYSTEMS: A COMPARATIVE STUDY
SIMILARITY MEASURES FOR RECOMMENDER SYSTEMS: A COMPARATIVE STUDYSIMILARITY MEASURES FOR RECOMMENDER SYSTEMS: A COMPARATIVE STUDY
SIMILARITY MEASURES FOR RECOMMENDER SYSTEMS: A COMPARATIVE STUDYJournal For Research
 
FIND MY VENUE: Content & Review Based Location Recommendation System
FIND MY VENUE: Content & Review Based Location Recommendation SystemFIND MY VENUE: Content & Review Based Location Recommendation System
FIND MY VENUE: Content & Review Based Location Recommendation SystemIJTET Journal
 
Analysing the performance of Recommendation System using different similarity...
Analysing the performance of Recommendation System using different similarity...Analysing the performance of Recommendation System using different similarity...
Analysing the performance of Recommendation System using different similarity...IRJET Journal
 
IRJET- A Survey on Recommender Systems used for User Service Rating in Social...
IRJET- A Survey on Recommender Systems used for User Service Rating in Social...IRJET- A Survey on Recommender Systems used for User Service Rating in Social...
IRJET- A Survey on Recommender Systems used for User Service Rating in Social...IRJET Journal
 
Recommender Systems
Recommender SystemsRecommender Systems
Recommender Systemsvivatechijri
 
FHCC: A SOFT HIERARCHICAL CLUSTERING APPROACH FOR COLLABORATIVE FILTERING REC...
FHCC: A SOFT HIERARCHICAL CLUSTERING APPROACH FOR COLLABORATIVE FILTERING REC...FHCC: A SOFT HIERARCHICAL CLUSTERING APPROACH FOR COLLABORATIVE FILTERING REC...
FHCC: A SOFT HIERARCHICAL CLUSTERING APPROACH FOR COLLABORATIVE FILTERING REC...IJDKP
 
ENTERTAINMENT CONTENT RECOMMENDATION SYSTEM USING MACHINE LEARNING
ENTERTAINMENT CONTENT RECOMMENDATION SYSTEM USING MACHINE LEARNINGENTERTAINMENT CONTENT RECOMMENDATION SYSTEM USING MACHINE LEARNING
ENTERTAINMENT CONTENT RECOMMENDATION SYSTEM USING MACHINE LEARNINGIRJET Journal
 
Tourism Based Hybrid Recommendation System
Tourism Based Hybrid Recommendation SystemTourism Based Hybrid Recommendation System
Tourism Based Hybrid Recommendation SystemIRJET Journal
 
IRJET- An Intuitive Sky-High View of Recommendation Systems
IRJET- An Intuitive Sky-High View of Recommendation SystemsIRJET- An Intuitive Sky-High View of Recommendation Systems
IRJET- An Intuitive Sky-High View of Recommendation SystemsIRJET Journal
 
Recommendation System Using Social Networking
Recommendation System Using Social Networking Recommendation System Using Social Networking
Recommendation System Using Social Networking ijcseit
 
A survey on recommendation system
A survey on recommendation systemA survey on recommendation system
A survey on recommendation systemiosrjce
 
A Hybrid Approach for Personalized Recommender System Using Weighted TFIDF on...
A Hybrid Approach for Personalized Recommender System Using Weighted TFIDF on...A Hybrid Approach for Personalized Recommender System Using Weighted TFIDF on...
A Hybrid Approach for Personalized Recommender System Using Weighted TFIDF on...Editor IJCATR
 
Detailed structure applicable to hybrid recommendation technique
Detailed structure applicable to hybrid recommendation techniqueDetailed structure applicable to hybrid recommendation technique
Detailed structure applicable to hybrid recommendation techniqueIAEME Publication
 
Ontological and clustering approach for content based recommendation systems
Ontological and clustering approach for content based recommendation systemsOntological and clustering approach for content based recommendation systems
Ontological and clustering approach for content based recommendation systemsvikramadityajakkula
 
Hybrid Personalized Recommender System Using Modified Fuzzy C-Means Clusterin...
Hybrid Personalized Recommender System Using Modified Fuzzy C-Means Clusterin...Hybrid Personalized Recommender System Using Modified Fuzzy C-Means Clusterin...
Hybrid Personalized Recommender System Using Modified Fuzzy C-Means Clusterin...Waqas Tariq
 

Similaire à A LOCATION-BASED MOVIE RECOMMENDER SYSTEM USING COLLABORATIVE FILTERING (20)

IRJET- Analysis of Rating Difference and User Interest
IRJET- Analysis of Rating Difference and User InterestIRJET- Analysis of Rating Difference and User Interest
IRJET- Analysis of Rating Difference and User Interest
 
Mixed Recommendation Algorithm Based on Content, Demographic and Collaborativ...
Mixed Recommendation Algorithm Based on Content, Demographic and Collaborativ...Mixed Recommendation Algorithm Based on Content, Demographic and Collaborativ...
Mixed Recommendation Algorithm Based on Content, Demographic and Collaborativ...
 
A literature survey on recommendation
A literature survey on recommendationA literature survey on recommendation
A literature survey on recommendation
 
A Literature Survey on Recommendation System Based on Sentimental Analysis
A Literature Survey on Recommendation System Based on Sentimental AnalysisA Literature Survey on Recommendation System Based on Sentimental Analysis
A Literature Survey on Recommendation System Based on Sentimental Analysis
 
SIMILARITY MEASURES FOR RECOMMENDER SYSTEMS: A COMPARATIVE STUDY
SIMILARITY MEASURES FOR RECOMMENDER SYSTEMS: A COMPARATIVE STUDYSIMILARITY MEASURES FOR RECOMMENDER SYSTEMS: A COMPARATIVE STUDY
SIMILARITY MEASURES FOR RECOMMENDER SYSTEMS: A COMPARATIVE STUDY
 
FIND MY VENUE: Content & Review Based Location Recommendation System
FIND MY VENUE: Content & Review Based Location Recommendation SystemFIND MY VENUE: Content & Review Based Location Recommendation System
FIND MY VENUE: Content & Review Based Location Recommendation System
 
Analysing the performance of Recommendation System using different similarity...
Analysing the performance of Recommendation System using different similarity...Analysing the performance of Recommendation System using different similarity...
Analysing the performance of Recommendation System using different similarity...
 
IRJET- A Survey on Recommender Systems used for User Service Rating in Social...
IRJET- A Survey on Recommender Systems used for User Service Rating in Social...IRJET- A Survey on Recommender Systems used for User Service Rating in Social...
IRJET- A Survey on Recommender Systems used for User Service Rating in Social...
 
Recommender Systems
Recommender SystemsRecommender Systems
Recommender Systems
 
FHCC: A SOFT HIERARCHICAL CLUSTERING APPROACH FOR COLLABORATIVE FILTERING REC...
FHCC: A SOFT HIERARCHICAL CLUSTERING APPROACH FOR COLLABORATIVE FILTERING REC...FHCC: A SOFT HIERARCHICAL CLUSTERING APPROACH FOR COLLABORATIVE FILTERING REC...
FHCC: A SOFT HIERARCHICAL CLUSTERING APPROACH FOR COLLABORATIVE FILTERING REC...
 
ENTERTAINMENT CONTENT RECOMMENDATION SYSTEM USING MACHINE LEARNING
ENTERTAINMENT CONTENT RECOMMENDATION SYSTEM USING MACHINE LEARNINGENTERTAINMENT CONTENT RECOMMENDATION SYSTEM USING MACHINE LEARNING
ENTERTAINMENT CONTENT RECOMMENDATION SYSTEM USING MACHINE LEARNING
 
Tourism Based Hybrid Recommendation System
Tourism Based Hybrid Recommendation SystemTourism Based Hybrid Recommendation System
Tourism Based Hybrid Recommendation System
 
IRJET- An Intuitive Sky-High View of Recommendation Systems
IRJET- An Intuitive Sky-High View of Recommendation SystemsIRJET- An Intuitive Sky-High View of Recommendation Systems
IRJET- An Intuitive Sky-High View of Recommendation Systems
 
Recommendation System Using Social Networking
Recommendation System Using Social Networking Recommendation System Using Social Networking
Recommendation System Using Social Networking
 
A survey on recommendation system
A survey on recommendation systemA survey on recommendation system
A survey on recommendation system
 
I017654651
I017654651I017654651
I017654651
 
A Hybrid Approach for Personalized Recommender System Using Weighted TFIDF on...
A Hybrid Approach for Personalized Recommender System Using Weighted TFIDF on...A Hybrid Approach for Personalized Recommender System Using Weighted TFIDF on...
A Hybrid Approach for Personalized Recommender System Using Weighted TFIDF on...
 
Detailed structure applicable to hybrid recommendation technique
Detailed structure applicable to hybrid recommendation techniqueDetailed structure applicable to hybrid recommendation technique
Detailed structure applicable to hybrid recommendation technique
 
Ontological and clustering approach for content based recommendation systems
Ontological and clustering approach for content based recommendation systemsOntological and clustering approach for content based recommendation systems
Ontological and clustering approach for content based recommendation systems
 
Hybrid Personalized Recommender System Using Modified Fuzzy C-Means Clusterin...
Hybrid Personalized Recommender System Using Modified Fuzzy C-Means Clusterin...Hybrid Personalized Recommender System Using Modified Fuzzy C-Means Clusterin...
Hybrid Personalized Recommender System Using Modified Fuzzy C-Means Clusterin...
 

Plus de ijfcstjournal

ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...ijfcstjournal
 
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLING
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGA SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLING
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGijfcstjournal
 
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLES
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLESA COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLES
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLESijfcstjournal
 
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...ijfcstjournal
 
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...ijfcstjournal
 
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...ijfcstjournal
 
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...ijfcstjournal
 
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDING
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDINGAN OPTIMIZED HYBRID APPROACH FOR PATH FINDING
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDINGijfcstjournal
 
EAGRO CROP MARKETING FOR FARMING COMMUNITY
EAGRO CROP MARKETING FOR FARMING COMMUNITYEAGRO CROP MARKETING FOR FARMING COMMUNITY
EAGRO CROP MARKETING FOR FARMING COMMUNITYijfcstjournal
 
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHS
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHSEDGE-TENACITY IN CYCLES AND COMPLETE GRAPHS
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHSijfcstjournal
 
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEM
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEMCOMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEM
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEMijfcstjournal
 
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMS
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMSPSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMS
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMSijfcstjournal
 
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...ijfcstjournal
 
A MUTATION TESTING ANALYSIS AND REGRESSION TESTING
A MUTATION TESTING ANALYSIS AND REGRESSION TESTINGA MUTATION TESTING ANALYSIS AND REGRESSION TESTING
A MUTATION TESTING ANALYSIS AND REGRESSION TESTINGijfcstjournal
 
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...ijfcstjournal
 
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCH
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCHA NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCH
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCHijfcstjournal
 
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKS
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKSAGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKS
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKSijfcstjournal
 
International Journal on Foundations of Computer Science & Technology (IJFCST)
International Journal on Foundations of Computer Science & Technology (IJFCST)International Journal on Foundations of Computer Science & Technology (IJFCST)
International Journal on Foundations of Computer Science & Technology (IJFCST)ijfcstjournal
 
AN INTRODUCTION TO DIGITAL CRIMES
AN INTRODUCTION TO DIGITAL CRIMESAN INTRODUCTION TO DIGITAL CRIMES
AN INTRODUCTION TO DIGITAL CRIMESijfcstjournal
 
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...ijfcstjournal
 

Plus de ijfcstjournal (20)

ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...
ENHANCING ENGLISH WRITING SKILLS THROUGH INTERNET-PLUS TOOLS IN THE PERSPECTI...
 
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLING
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLINGA SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLING
A SURVEY TO REAL-TIME MESSAGE-ROUTING NETWORK SYSTEM WITH KLA MODELLING
 
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLES
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLESA COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLES
A COMPARATIVE ANALYSIS ON SOFTWARE ARCHITECTURE STYLES
 
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...
SYSTEM ANALYSIS AND DESIGN FOR A BUSINESS DEVELOPMENT MANAGEMENT SYSTEM BASED...
 
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...
AN ALGORITHM FOR SOLVING LINEAR OPTIMIZATION PROBLEMS SUBJECTED TO THE INTERS...
 
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...
LBRP: A RESILIENT ENERGY HARVESTING NOISE AWARE ROUTING PROTOCOL FOR UNDER WA...
 
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...
STRUCTURAL DYNAMICS AND EVOLUTION OF CAPSULE ENDOSCOPY (PILL CAMERA) TECHNOLO...
 
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDING
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDINGAN OPTIMIZED HYBRID APPROACH FOR PATH FINDING
AN OPTIMIZED HYBRID APPROACH FOR PATH FINDING
 
EAGRO CROP MARKETING FOR FARMING COMMUNITY
EAGRO CROP MARKETING FOR FARMING COMMUNITYEAGRO CROP MARKETING FOR FARMING COMMUNITY
EAGRO CROP MARKETING FOR FARMING COMMUNITY
 
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHS
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHSEDGE-TENACITY IN CYCLES AND COMPLETE GRAPHS
EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHS
 
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEM
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEMCOMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEM
COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEM
 
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMS
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMSPSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMS
PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMS
 
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...
CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...
 
A MUTATION TESTING ANALYSIS AND REGRESSION TESTING
A MUTATION TESTING ANALYSIS AND REGRESSION TESTINGA MUTATION TESTING ANALYSIS AND REGRESSION TESTING
A MUTATION TESTING ANALYSIS AND REGRESSION TESTING
 
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...
GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...
 
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCH
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCHA NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCH
A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCH
 
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKS
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKSAGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKS
AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKS
 
International Journal on Foundations of Computer Science & Technology (IJFCST)
International Journal on Foundations of Computer Science & Technology (IJFCST)International Journal on Foundations of Computer Science & Technology (IJFCST)
International Journal on Foundations of Computer Science & Technology (IJFCST)
 
AN INTRODUCTION TO DIGITAL CRIMES
AN INTRODUCTION TO DIGITAL CRIMESAN INTRODUCTION TO DIGITAL CRIMES
AN INTRODUCTION TO DIGITAL CRIMES
 
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...
 

Dernier

Delhi Call Girls CP 9711199171 ☎✔👌✔ Whatsapp Hard And Sexy Vip Call
Delhi Call Girls CP 9711199171 ☎✔👌✔ Whatsapp Hard And Sexy Vip CallDelhi Call Girls CP 9711199171 ☎✔👌✔ Whatsapp Hard And Sexy Vip Call
Delhi Call Girls CP 9711199171 ☎✔👌✔ Whatsapp Hard And Sexy Vip Callshivangimorya083
 
Mature dropshipping via API with DroFx.pptx
Mature dropshipping via API with DroFx.pptxMature dropshipping via API with DroFx.pptx
Mature dropshipping via API with DroFx.pptxolyaivanovalion
 
Digital Advertising Lecture for Advanced Digital & Social Media Strategy at U...
Digital Advertising Lecture for Advanced Digital & Social Media Strategy at U...Digital Advertising Lecture for Advanced Digital & Social Media Strategy at U...
Digital Advertising Lecture for Advanced Digital & Social Media Strategy at U...Valters Lauzums
 
Al Barsha Escorts $#$ O565212860 $#$ Escort Service In Al Barsha
Al Barsha Escorts $#$ O565212860 $#$ Escort Service In Al BarshaAl Barsha Escorts $#$ O565212860 $#$ Escort Service In Al Barsha
Al Barsha Escorts $#$ O565212860 $#$ Escort Service In Al BarshaAroojKhan71
 
Call Girls Hsr Layout Just Call 👗 7737669865 👗 Top Class Call Girl Service Ba...
Call Girls Hsr Layout Just Call 👗 7737669865 👗 Top Class Call Girl Service Ba...Call Girls Hsr Layout Just Call 👗 7737669865 👗 Top Class Call Girl Service Ba...
Call Girls Hsr Layout Just Call 👗 7737669865 👗 Top Class Call Girl Service Ba...amitlee9823
 
April 2024 - Crypto Market Report's Analysis
April 2024 - Crypto Market Report's AnalysisApril 2024 - Crypto Market Report's Analysis
April 2024 - Crypto Market Report's Analysismanisha194592
 
Introduction-to-Machine-Learning (1).pptx
Introduction-to-Machine-Learning (1).pptxIntroduction-to-Machine-Learning (1).pptx
Introduction-to-Machine-Learning (1).pptxfirstjob4
 
Discover Why Less is More in B2B Research
Discover Why Less is More in B2B ResearchDiscover Why Less is More in B2B Research
Discover Why Less is More in B2B Researchmichael115558
 
Halmar dropshipping via API with DroFx
Halmar  dropshipping  via API with DroFxHalmar  dropshipping  via API with DroFx
Halmar dropshipping via API with DroFxolyaivanovalion
 
Week-01-2.ppt BBB human Computer interaction
Week-01-2.ppt BBB human Computer interactionWeek-01-2.ppt BBB human Computer interaction
Week-01-2.ppt BBB human Computer interactionfulawalesam
 
BDSM⚡Call Girls in Mandawali Delhi >༒8448380779 Escort Service
BDSM⚡Call Girls in Mandawali Delhi >༒8448380779 Escort ServiceBDSM⚡Call Girls in Mandawali Delhi >༒8448380779 Escort Service
BDSM⚡Call Girls in Mandawali Delhi >༒8448380779 Escort ServiceDelhi Call girls
 
Generative AI on Enterprise Cloud with NiFi and Milvus
Generative AI on Enterprise Cloud with NiFi and MilvusGenerative AI on Enterprise Cloud with NiFi and Milvus
Generative AI on Enterprise Cloud with NiFi and MilvusTimothy Spann
 
BigBuy dropshipping via API with DroFx.pptx
BigBuy dropshipping via API with DroFx.pptxBigBuy dropshipping via API with DroFx.pptx
BigBuy dropshipping via API with DroFx.pptxolyaivanovalion
 
Call Girls in Sarai Kale Khan Delhi 💯 Call Us 🔝9205541914 🔝( Delhi) Escorts S...
Call Girls in Sarai Kale Khan Delhi 💯 Call Us 🔝9205541914 🔝( Delhi) Escorts S...Call Girls in Sarai Kale Khan Delhi 💯 Call Us 🔝9205541914 🔝( Delhi) Escorts S...
Call Girls in Sarai Kale Khan Delhi 💯 Call Us 🔝9205541914 🔝( Delhi) Escorts S...Delhi Call girls
 
100-Concepts-of-AI by Anupama Kate .pptx
100-Concepts-of-AI by Anupama Kate .pptx100-Concepts-of-AI by Anupama Kate .pptx
100-Concepts-of-AI by Anupama Kate .pptxAnupama Kate
 
Call me @ 9892124323 Cheap Rate Call Girls in Vashi with Real Photo 100% Secure
Call me @ 9892124323  Cheap Rate Call Girls in Vashi with Real Photo 100% SecureCall me @ 9892124323  Cheap Rate Call Girls in Vashi with Real Photo 100% Secure
Call me @ 9892124323 Cheap Rate Call Girls in Vashi with Real Photo 100% SecurePooja Nehwal
 
Zuja dropshipping via API with DroFx.pptx
Zuja dropshipping via API with DroFx.pptxZuja dropshipping via API with DroFx.pptx
Zuja dropshipping via API with DroFx.pptxolyaivanovalion
 
Best VIP Call Girls Noida Sector 22 Call Me: 8448380779
Best VIP Call Girls Noida Sector 22 Call Me: 8448380779Best VIP Call Girls Noida Sector 22 Call Me: 8448380779
Best VIP Call Girls Noida Sector 22 Call Me: 8448380779Delhi Call girls
 

Dernier (20)

Call Girls In Shalimar Bagh ( Delhi) 9953330565 Escorts Service
Call Girls In Shalimar Bagh ( Delhi) 9953330565 Escorts ServiceCall Girls In Shalimar Bagh ( Delhi) 9953330565 Escorts Service
Call Girls In Shalimar Bagh ( Delhi) 9953330565 Escorts Service
 
Delhi Call Girls CP 9711199171 ☎✔👌✔ Whatsapp Hard And Sexy Vip Call
Delhi Call Girls CP 9711199171 ☎✔👌✔ Whatsapp Hard And Sexy Vip CallDelhi Call Girls CP 9711199171 ☎✔👌✔ Whatsapp Hard And Sexy Vip Call
Delhi Call Girls CP 9711199171 ☎✔👌✔ Whatsapp Hard And Sexy Vip Call
 
Mature dropshipping via API with DroFx.pptx
Mature dropshipping via API with DroFx.pptxMature dropshipping via API with DroFx.pptx
Mature dropshipping via API with DroFx.pptx
 
Digital Advertising Lecture for Advanced Digital & Social Media Strategy at U...
Digital Advertising Lecture for Advanced Digital & Social Media Strategy at U...Digital Advertising Lecture for Advanced Digital & Social Media Strategy at U...
Digital Advertising Lecture for Advanced Digital & Social Media Strategy at U...
 
Abortion pills in Doha Qatar (+966572737505 ! Get Cytotec
Abortion pills in Doha Qatar (+966572737505 ! Get CytotecAbortion pills in Doha Qatar (+966572737505 ! Get Cytotec
Abortion pills in Doha Qatar (+966572737505 ! Get Cytotec
 
Al Barsha Escorts $#$ O565212860 $#$ Escort Service In Al Barsha
Al Barsha Escorts $#$ O565212860 $#$ Escort Service In Al BarshaAl Barsha Escorts $#$ O565212860 $#$ Escort Service In Al Barsha
Al Barsha Escorts $#$ O565212860 $#$ Escort Service In Al Barsha
 
Call Girls Hsr Layout Just Call 👗 7737669865 👗 Top Class Call Girl Service Ba...
Call Girls Hsr Layout Just Call 👗 7737669865 👗 Top Class Call Girl Service Ba...Call Girls Hsr Layout Just Call 👗 7737669865 👗 Top Class Call Girl Service Ba...
Call Girls Hsr Layout Just Call 👗 7737669865 👗 Top Class Call Girl Service Ba...
 
April 2024 - Crypto Market Report's Analysis
April 2024 - Crypto Market Report's AnalysisApril 2024 - Crypto Market Report's Analysis
April 2024 - Crypto Market Report's Analysis
 
Introduction-to-Machine-Learning (1).pptx
Introduction-to-Machine-Learning (1).pptxIntroduction-to-Machine-Learning (1).pptx
Introduction-to-Machine-Learning (1).pptx
 
Discover Why Less is More in B2B Research
Discover Why Less is More in B2B ResearchDiscover Why Less is More in B2B Research
Discover Why Less is More in B2B Research
 
Halmar dropshipping via API with DroFx
Halmar  dropshipping  via API with DroFxHalmar  dropshipping  via API with DroFx
Halmar dropshipping via API with DroFx
 
Week-01-2.ppt BBB human Computer interaction
Week-01-2.ppt BBB human Computer interactionWeek-01-2.ppt BBB human Computer interaction
Week-01-2.ppt BBB human Computer interaction
 
BDSM⚡Call Girls in Mandawali Delhi >༒8448380779 Escort Service
BDSM⚡Call Girls in Mandawali Delhi >༒8448380779 Escort ServiceBDSM⚡Call Girls in Mandawali Delhi >༒8448380779 Escort Service
BDSM⚡Call Girls in Mandawali Delhi >༒8448380779 Escort Service
 
Generative AI on Enterprise Cloud with NiFi and Milvus
Generative AI on Enterprise Cloud with NiFi and MilvusGenerative AI on Enterprise Cloud with NiFi and Milvus
Generative AI on Enterprise Cloud with NiFi and Milvus
 
BigBuy dropshipping via API with DroFx.pptx
BigBuy dropshipping via API with DroFx.pptxBigBuy dropshipping via API with DroFx.pptx
BigBuy dropshipping via API with DroFx.pptx
 
Call Girls in Sarai Kale Khan Delhi 💯 Call Us 🔝9205541914 🔝( Delhi) Escorts S...
Call Girls in Sarai Kale Khan Delhi 💯 Call Us 🔝9205541914 🔝( Delhi) Escorts S...Call Girls in Sarai Kale Khan Delhi 💯 Call Us 🔝9205541914 🔝( Delhi) Escorts S...
Call Girls in Sarai Kale Khan Delhi 💯 Call Us 🔝9205541914 🔝( Delhi) Escorts S...
 
100-Concepts-of-AI by Anupama Kate .pptx
100-Concepts-of-AI by Anupama Kate .pptx100-Concepts-of-AI by Anupama Kate .pptx
100-Concepts-of-AI by Anupama Kate .pptx
 
Call me @ 9892124323 Cheap Rate Call Girls in Vashi with Real Photo 100% Secure
Call me @ 9892124323  Cheap Rate Call Girls in Vashi with Real Photo 100% SecureCall me @ 9892124323  Cheap Rate Call Girls in Vashi with Real Photo 100% Secure
Call me @ 9892124323 Cheap Rate Call Girls in Vashi with Real Photo 100% Secure
 
Zuja dropshipping via API with DroFx.pptx
Zuja dropshipping via API with DroFx.pptxZuja dropshipping via API with DroFx.pptx
Zuja dropshipping via API with DroFx.pptx
 
Best VIP Call Girls Noida Sector 22 Call Me: 8448380779
Best VIP Call Girls Noida Sector 22 Call Me: 8448380779Best VIP Call Girls Noida Sector 22 Call Me: 8448380779
Best VIP Call Girls Noida Sector 22 Call Me: 8448380779
 

A LOCATION-BASED MOVIE RECOMMENDER SYSTEM USING COLLABORATIVE FILTERING

  • 1. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015 DOI:10.5121/ijfcst.2015.5402 13 A LOCATION-BASED MOVIE RECOMMENDER SYSTEM USING COLLABORATIVE FILTERING Kasra Madadipouya Department of Computing and Science, Asia Pacific University of Technology & Innovation ABSTRACT Available recommender systems mostly provide recommendations based on the users’ preferences by utilizing traditional methods such as collaborative filtering which only relies on the similarities between users and items. However, collaborative filtering might lead to provide poor recommendation because it does not rely on other useful available data such as users’ locations and hence the accuracy of the recommendations could be very low and inefficient. This could be very obvious in the systems that locations would affect users’ preferences highly such as movie recommender systems. In this paper a new location- based movie recommender system based on the collaborative filtering is introduced for enhancing the accuracy and the quality of recommendations. In this approach, users’ locations have been utilized and take in consideration in the entire processing of the recommendations and peer selections. The potential of the proposed approach in providing novel and better quality recommendations have been discussed through experiments in real datasets. KEYWORDS Recommender system, Movie recommender system, Location-based recommender, Collaborative filtering, Pearson correlation, Context-aware 1. INTRODUCTION In traditional recommender systems the recommendation procedure is done with considering about users’ past rating history and items features (tagging) and basically no contextual information is taken into account for generating recommendations [1]. However, there are usually various factors influencing users’ decision on in reality. Besides, users’ demand might change with context as well (e.g. time, location and weather etc) which cannot be accomplished through tradition recommender systems. As a result just having information about users, items and/or few contextual parameters are not sufficient enough to give accurate real-time emotional-based recommendations, however, more information is necessary in order to provide items to users under certain conditions [2]. For instance, adding the temporal, day/night context, in recommender systems would provide more accurate recommendations which also might reflect user's emotions as well. Additionally, in the personalized content delivery for a recommender system, this fact is crucial to determine whether particular content should be delivered to users or not and if it has to be recommended to users when it should be recommended [2]. With the creation of the new generation recommender system, contextual information has become one of the most valuable knowledge sources to improve recommendations and provide more user specific recommendations under that similar circumstance (i.e., contexts) are related with similar user preferences [1][3] [4].
  • 2. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015 14 A better Recommendation System (RS) is the one which delivers recommendations that best match with users' preferences, needs and hopes at the right moment, in the right place and on the right media. This can't be achieved without designing a RS that takes into account all information and parameters that influence user's ratings. This information may concern demographic data [5] preferences about user's domain of interest, quality and delivery requirements as well as the time of the interaction, the location, the media, the cognitive status of the user and his availability. Hence, giving precise recommendations to user is deepened on the relevant gathered information about the user's preferences such as user's location and other parameters. The rest of the paper is organized as follows; in the next section a review regarding different movie recommender systems are provided. In section three the proposed algorithm is explained in detail which is based on the collaborative filtering and Pearson Correlation Coefficient. Then in the next segment, the results of the experiment is analyzed and presented. Finally, in the last section, conclusions and future enhancement are discussed. 2. RELATED WORK In recommender systems variety of research had been conducted to deliver the most relevant content to user [6][7] [8] in different recommendation scopes for users, such as music recommendation [9][10][11], location-based services [12][13] or even recommendation system for tourism [14][15][16]. In movie recommender system some of the works focus on inputting rich and detailed meta-data (genre and other features) to the system in order to enhance the quality of recommendations. In a movie recommender system by [17], this facility was provided to allow user to even set new keywords for movies which resulted in providing more accurate recommendations based on features which set users. The big advantage of this solution is that it adapts to changes regarding what the users find important, something which can change over time. However, manually categorization of content can be expensive, time-consuming, error-prone and highly subjective. Due to this, many systems aim to automate the procedure. Another approach of providing high quality recommendation can be achieved by utilizing contextual-information [18] such as time of the day, users’ mood, etc. According to [19] most of the users who are located in the same geographical location have the similar taste to each other. For instance, users who are located in Florida mostly like to watch “Fantasy”, “Animation” types of the movie however, the user from Minnesota State are mostly interested to “War”, “Drama” type of the movie. Therefore, in recommending items the location of the user is not considered in any steps, as a result it is possible for a user who is looking for a resultant in Chicago get recommendations about some restaurants that are located in other areas such as Seattle [19]. Various algorithms examine by researchers in order to enhance the traditional recommender systems. For instance, in [20], authors presented a novel hybrid approach for movie recommender systems whereby items are recommended based on the collaborative between users as well as analysing contents. In another work by Bogers [21], an algorithm based on Markov random walk proposed which applied on a movie dataset by considering regarding some contextual information. In addition, Rendle et al. [22] applied matrix factorization in a movie dataset with the aim of enhancing the quality and accuracy of the recommendation as well as reducing the complexity of building their model. Simon Funk proposed Regularized singular value decomposition (RSVD) to enhance the accuracy of the recommendation which reduces the dimensionality of the original rating matrix [23].
  • 3. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015 15 3. THE PROPOSED ALGORITHM The new method was made to reach to numbers of goals and objectives. Firstly, by contrast of the baseline collaborative filtering that does not take into account users’ locations in providing recommendations, in this framework current user location is considered in the system in which user gets different recommendations based on the location. This reflects the fact that if the user changes his/her location the received recommended items will be affected because of changing in the location. Secondly, user preferences that lead him/her to select an item, and correspondingly potentially generates better recommendations based on the user location which increases the locality of the recommended items. Lastly, the main goal is to improve the locality of the recommendations in both peers selection stage and item recommendations with gathering some information about user location and considering about user location in all recommendation processes. The only recommendation method that is used in the framework contains the following steps as demonstrated in below, 1- Keeping a copy of the user profile in the memory (memory-based approach). 2- Applying similarity index function for the user to find the peers (Pearson Correlation Coefficient). 3- Adding α parameter for those peers who are in the same place with the active user. 4- Applying some filtrations on selected peers to reduce and remove non-related peers. 5- Selecting items for providing recommendations to the active user. 6- Showing the recommended items to the active user. Figure_1 (Overview of collaborative filtering process) Figure_2 (Pearson Correlation) Since, the main algorithm (Figure_2) just relies on one parameter (similarity index) to select peers to the active user and seems all the users with no difference, in this framework we introduced (α) parameters refers to the priority index which directly affects the outcome of the similarity index function that returns a value between (-1 to 1). In prioritize the users those users who are located in the same geographical place with the active user get higher priority with add the constant value (α) to the result of similarity index.
  • 4. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015 16 As it depicts in Figure_1 the framework is based on the collaborative filtering in which first the users necessary information about the active user will be stored in different database from the user profile in memory since some temporary analysis and changes might be applied in the user profile which will not be overwritten on the user profile or change it. After copying it, the user profile will pass through from peers selection stage, in that stage, firstly, similarity function is applied for the active user against other users of the system to find which user has the similar taste to the current user. Then peers are selected for the active user. In other word, users will be classified in different groups which each group has the users with the same taste. After that, peers location will be compared with the active user and those who are located in the same geographical location with the active user, their similarity indexes will be increased by adding constant value which is known as α. Then some filtrations will be applied to the peers who are called threshold-based selection, according to which users whose similarity exceeds a certain threshold value are considered as neighbors of the target user [24] and be selected as final peers to give recommendations to the active user based on them. Hence, in this stage all peers who have less than 0.5 similarity index (threshold) will be aborted and will not considered in further steps. After applying filtration to the users in different peers groups, top peers of the active user will be nominated for providing recommendations. Finally, top rated items of the peers who gained the highest similarity indexes will be selected for recommendations. In the final stage, those recommended and selected items are shown to the active users as recommendations. 4. EXPERIMENTAL RESULTS For experimental test, LDOS-CoMoDa [25] dataset which is provided by Laboratorij za digitalno in French is utilized for testing the framework against the baseline collaborative (user-based) filtering approach and therefore, necessary elements from the dataset are extracted for experiment. In the dataset, information about the users is available as part of the user profile and in another section of the dataset list of the rated items, available items and many other parameters are saved. All information in the dataset was gathered by crawling some agencies and was from real user involvement in the system. Hence, there was no direct user involvement in the testing system. However, for implementing the system in the real world all above elements are necessary and should be available for completeness of the system. Overall the dataset contains 2296 records (rows) which are recorded 120 users’ behaviors. The total fields of dataset after modification is six fields, which are userID, itemID, Country (User location), Rating, item description, Related to (Country of item). The rating range is from 1 to 5 which one expresses that the user is highly dislike the item and five represents that the user is highly interested in the item. Number of ratings for each user is various and is not dependent to any parameters such as user location or anything else. The reason for that, it to make the dataset to what happens in reality which the number of ratings items for each user could be different and it is not dependent to any obvious parameter. Therefore, this dataset is obtained by gathering data from different agencies and hence, it is exactly recorded users’ behaviors. Table_1 demonstrates all mentioned information about the dataset in summery. Table_1 (Dataset information)
  • 5. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015 17 The users of the dataset are from five different countries (Denmark, France, Germany, UK, and US). Each country contains different number of the users and this parameter is independent parameter, but in average base on the number of total user each country has 24 users. Table_2 demonstrates, the exact number of each user for each mentioned country. Table_2 (User distribution in countries-table) The experiment has been applied for both baseline Pearson Correlation algorithm and the proposed framework in the form of memory-based user-based filtering. In this experiment, the framework is tested against various value of α (0.1, 0.2, 0.3) separately the results are demonstrated in the following section. By applying the baseline Pearson Correlation in the dataset, the average gained peers locality was 14.10% which means that only 14.10% of peers are located in the same location with the active users whereas the rest of the peers locations are not the same with the active user. Applying the proposed framework with α = 0.1, gives different result which is demonstrate shows 1.20 per cent (15.33% peers locality rate) improvement in comparison with the baseline approach. By increasing α to 0.2, the improvement in locality rate reached near to 1.73 per cent (15.33% peers locality rate). Finally for the last experiment α value is set to 0.3 and the framework has been tested against the dataset which shows 1.87 percent (15.97% peers locality rate) enhancement in peers selection stage. Changing α value on the other hand affects the recommendation results as well in terms of the locations that movie produced. In baseline algorithm only 1.46% of items related to the same location as active user, however, by applying α = 0.1, this amount reached to 1.7% and the number increased to 1.88% and 1.99 by applying α = 0.2 and α = 0.3 respectively. 5. CONCLUSION AND FUTURE WORK In this paper a novel framework to improve locality in user-based collaborative filtering for movie recommender system is proposed and experimental results of the evolution of is presented which gathered results from different tests on dataset analyzed and presented. In addition to that, compare and comparison between the baseline algorithm and the proposed approach is provided in details based on the experimental results. As already mentioned earlier, the dataset which has been used for this work is part of LDOS- CoMoDa dataset that gathered from various movies agencies. Hence, for future work in order to reach to more accurate result and better analysis, the experiment should be performed on other and bigger datasets which contains hundred thousand of records and have different level of sparseness. In addition, the experimental performed under the lab condition and there was no direct user involvement in experiment the framework and method for getting results. Hence, the proposed method could be implemented in the real environment against the real user experiment.
  • 6. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015 18 Moreover, the proposed method in this work applied on one class of filtering method which is Pearson correlation coefficient. Thus, various algorithms from both collaborative and content based approaches could be tested against the dataset and the results compared with the proposed framework in order to provide more accurate analysis. REFERENCES [1] Adomavicius, G., Tuzhilin, A. and Er. 2011. Context-aware recommender systems. Springer, pp. 217- -253. [2] Junmanee, S. and Hinze, A. (2006). Advanced recommendations in a mobile tourist information system. [3] Baltrunas, Linas et al. 'Context Relevance Assessment And Exploitation In Mobile Recommender Systems'. Pers Ubiquit Comput 16.5 (2011): 507-526. Web. 7 May 2015. [4] Gorgoglione, Michele, Umberto Panniello, and Alexander Tuzhilin. 'The Effect Of Context-Aware Recommendations On Customer Purchasing Behavior And Trust'. Proceedings of the fifth ACM conference on Recommender systems - RecSys ' 11 (2011): n. pag. Web. 7 May 2015. [5] Krulwich, Bruce.: ‘Lifestyle finder: intelligent user profiling using large-scale demographic data’. AI Magazine 18(2), 37–45 (1997). [6] Adomavicius, G., Sankaranarayanan, R., Sen, S. and Tuzhilin, A. (2006). Incorporating contextual information in recommender systems using a multidimensional approach. ACM Transactions on Information Systems (TOIS), 23 (1), pp. 103-145. [7] Wang, Yiwen et al. 'Recommendations Based On Semantically Enriched Museum Collections'. Web Semantics: Science, Services and Agents on the World Wide Web 6.4 (2008): 283-290. Web. [8] Bobillo, Fernando, Miguel Delgado, and Juan Gómez-Romero. 'Representation Of Context- Dependant Knowledge In Ontologies: A Model And An Application'. Expert Systems with Applications 35.4 (2008): 1899-1908. Web. 7 May 2015. [9] Wang, Xinxi, Ye Wang, and David Rosenblum. "A daily, activity-aware, mobile music recommender system." Proceedings of the 20th ACM international conference on Multimedia. ACM, 2012. [10] Lampropoulou, P. S., A. S. Lampropoulos, and G. A. Tsihrintzis. 'A Mobile Music Recommender System Based On A Two-Level Genre-Rating SVM Classifier Enhanced By Collaborative Filtering'. New Directions in Intelligent Interactive Multimedia Systems and Services - 2 (2009): 361-368. Web. 7 May 2015. [11] Lampropoulos, Aristomenis S., Paraskevi S. Lampropoulou, and George A. Tsihrintzis. 'A Cascade- Hybrid Music Recommender System For Mobile Services Based On Musical Genre Classification And Personality Diagnosis'. Multimedia Tools and Applications 59.1 (2011): 241-258. Web. 7 May 2015. [12] Daly, Elizabeth M., and Werner Geyer. 'Effective Event Discovery'. Proceedings of the fifth ACM conference on Recommender systems - RecSys '11 (2011): n. pag. Web. 7 May 2015. [13] Barranco, Manuel J. et al. 'A Context-Aware Mobile Recommender System Based On Location And Trajectory'. Advances in Intelligent Systems and Computing (2012): 153-162. Web. 7 May 2015. [14] Noguera, José M. et al. 'A Mobile 3D-GIS Hybrid Recommender System For Tourism'. Information Sciences 215 (2012): 37-52. Web. 7 May 2015. [15] Kuo, Mu-Hsing, Liang-Chu Chen, and Chien-Wen Liang. 'Building And Evaluating A Location- Based Service Recommendation System With A Preference Adjustment Mechanism'. Expert Systems with Applications 36.2 (2009): 3543-3554. Web. 7 May 2015. [16] Savage, Norma Saiph, et al. I’m feeling loco: A location based context aware recommendation system. Springer Berlin Heidelberg, 2012. [17] Garden, M. and Dudek, G. (2006) "Mixed collaborative and content-based filtering with user- contributed semantic features", paper presented at AAAI'06 proceedings of the 21st national conference on Artificial intelligence , AAAI Press, p.1307-1312. [18] Wang, L. (2011). Understanding and using contextual information in recommender systems. pp. 1329--1330. [19] Lev, Oski, J., Sarwat, M., Eldawy, A. and Mokbel, M. (2012). Lars: A location-aware recommender system. pp. 450--461. [20] Lekakos, G., & Caravelas, P. (2008). A hybrid approach for movie recommendation. Multimedia tools and applications, 36(1-2), 55-70.
  • 7. International Journal in Foundations of Computer Science & Technology (IJFCST), Vol.5, No.4, July 2015 19 [21] Bogers, T. (2010, October). Movie recommendation using random walks over the contextual graph. In Proc. of the 2nd Intl. Workshop on Context-Aware Recommender Systems. [22] Rendle, S., Gantner, Z., Freudenthaler, C., & Schmidt-Thieme, L. (2011, July). Fast context-aware recommendations with factorization machines. In Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval (pp. 635-644). ACM. [23] Funk, S. (2006). Netflix update: Try this at home. [24] Gong, S. (2010). A collaborative filtering recommendation algorithm based on user clustering and item clustering. Journal of Software, 5 (7), pp. 745--752. [25] http://recsyswiki.com/wiki/LDOS_Comoda