Improved Personalized Recommendation based on Causal Association Rule and Collaborative Filtering

Improved Personalized Recommendation based on Causal Association Rule and Collaborative Filtering

Wu Lei (Time Publishing and Media Co., Ltd., Hefei, China and School of Information Management, Wuhan University, Wuhan, China), Fang Qing (School of Information Management, Wuhan University, Wuhan, China) and Jin Zhou (Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, China)
Copyright: © 2016 |Pages: 13
DOI: 10.4018/IJDET.2016070102
OnDemand PDF Download:
No Current Special Offers


There are usually limited user evaluation of resources on a recommender system, which caused an extremely sparse user rating matrix, and this greatly reduce the accuracy of personalized recommendation, especially for new users or new items. This paper presents a recommendation method based on rating prediction using causal association rules. First, users and items are mapped into two feature vectors, which would be minded later to get the causal association rules from the perspective of data mining; then based on the casual association rules, the authors create a preference matrix which would predict the rating of the items that users have not rated; finally a nearest neighbor similarity measure method is designed for personalized recommendation. Experiment shows that the algorithm efficiently improves the recommendation comparing to traditional methods.
Article Preview


With the development of internet technology, there are vast amounts of information resources presented on the web. For example, there are hundreds of millions of goods in Taobao, an e-commerce site, and the number of global web sites reaches more than 100 million. Information overload is the major characteristic and challenge of internet. Traditional search engines provide same result for different users, which reduce the utilization of information service platform with the rapid growth of information (Liu & Zhou, 2009). For online education, normal users can hardly get learning material that they really need from the large quantity of resource with the growth of the learning materials. Recommender system provides a proven and effective way to solve the problem of information overload, where recommendations can help users to evaluate unknown items. The recommending processes can provide people with resource according to their interest by predicting users' personal preference, which liberates people from searching vast amounts of information resource. At present, various kinds of recommender systems and algorithms have played an important role on the Internet, such as recommending products at, and, recommending videos at and, recommending books and movies at

Propelled by application requirement, there are some popular methods have been proposed, such as collaborative filtering recommendations, content-based recommendations, hybrid recommendations (Liu & Zhou, 2009) and graph-based recommendations. Recommending based on collaborative filtering is the earliest and most popular recommender system. The collaborative filtering method predicts the preference of users according to their similar neighbors which could be discovered by historical evaluation data. The collaborative filtering method has the advantages of adaptability and extensive applicability. However they also show obvious shortage in recommending on the condition of cold start and sparse data for depending on the historical evaluation data. Content-based recommendation structures profiles for users and items, the method does not needs users' personal behaviors to generate nearest neighbors. As a result, content-based recommendation works well in the conditions of new users and new items, and achieves recommendation on sparse data. However the profiles in Content-based method are usually generated by machine learning, and require frequently updating which need high computational cost.

Recommendation systems play a great role in the development of distance learning technology (Sikka & Dhankhar, 2012). Distance learning can be understood as a learning process when the learners are separated by time and distance, which require online courses and examinations for interaction. In order to improve the quality of this kind of education, the most important consideration is how to discover the students' learning behavior patterns based on timely assessment of learning outcomes. Various data mining techniques have been used for assisting tutors in distance learning to analyze the information available in the form of data generated by users (Jain, 2012; Wang, 2011), however the value of the data is far more than that. The developed recommendation systems focus on predicting learners’ behavior and their final performance and supporting the realization of efficient personalized learning. After collecting the learning characteristics of the learners, the preference model of these leaners will be built to predict the best learning path in the distance learning system. In this case, the recommendation system provide an excellent mean for interaction between learners and tutors. With the assisting of the recommendation systems, people will prevent repetitiveness from working or repeated mistake in online learning, rapidly understand and master the knowledge.

Complete Article List

Search this Journal:
Volume 20: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 19: 4 Issues (2021)
Volume 18: 4 Issues (2020)
Volume 17: 4 Issues (2019)
Volume 16: 4 Issues (2018)
Volume 15: 4 Issues (2017)
Volume 14: 4 Issues (2016)
Volume 13: 4 Issues (2015)
Volume 12: 4 Issues (2014)
Volume 11: 4 Issues (2013)
Volume 10: 4 Issues (2012)
Volume 9: 4 Issues (2011)
Volume 8: 4 Issues (2010)
Volume 7: 4 Issues (2009)
Volume 6: 4 Issues (2008)
Volume 5: 4 Issues (2007)
Volume 4: 4 Issues (2006)
Volume 3: 4 Issues (2005)
Volume 2: 4 Issues (2004)
Volume 1: 4 Issues (2003)
View Complete Journal Contents Listing