An enhanced users' similarity computation utilising one-class collaborative filtering Online publication date: Mon, 24-Oct-2016
by Saman Izadpanah; S. Kami Makki
International Journal of Big Data Intelligence (IJBDI), Vol. 3, No. 4, 2016
Abstract: The growth of social networking generates a huge amount of user data. The interested cooperation or businesses search through this data to make real-time business decisions or generate meaningful business patterns from users' behaviour. They also build new recommender systems to predict intelligently future social trends. These tools are becoming the basis for efficient operations of e-commerce and improvement of companies' productions. For example, the recommendation systems used by many commercial companies utilise collaborative filtering techniques such as k-nearest neighbour to enhance their service delivery and determine what their users most like. Using k-nearest neighbour allows the system to compare a primary user with all others and determines how similar their interests are to primary user. This creates a neighbourhood list, consisting of every user's similarity to the primary user. From this list, it is easy to select the primary user's most similar, or nearest neighbour. This nearest neighbour will then provide the basis for the primary user's recommendations. In this paper, we present a realistic method to process large volumes of data in various formats collected from different sources for recommending bookmarks by utilising one-class collaborative filtering approach.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Big Data Intelligence (IJBDI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com