An entropy-based neighbor selection approach for collaborative filtering
Author:
- Cihan KaleliCKCihan Kaleli
- 1 January 2014
- journal article
- Published by Elsevier in Knowledge-Based Systems
- Vol. 56, 273-280
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- A comparison of clustering-based privacy-preserving collaborative filtering schemesApplied Soft Computing, 2013
- A collaborative filtering similarity measure based on singularitiesInformation Processing & Management, 2012
- Solving 0–1 knapsack problem by a novel global harmony search algorithmApplied Soft Computing, 2011
- Factor in the neighborsACM Transactions on Knowledge Discovery From Data, 2010
- Proposing an ESL recommender teaching and learning systemExpert Systems with Applications, 2008
- A new similarity measure for collaborative filtering to alleviate the new user cold-starting problemInformation Sciences, 2008
- An efficient parallel algorithm for solving the Knapsack problem on hypercubesJournal of Parallel and Distributed Computing, 2004
- Collaborative Filtering with Maximum EntropyIEEE Intelligent Systems, 2004
- The collaborative filtering recommendation based on SOM cluster-indexing CBRExpert Systems with Applications, 2003
- Dynamic Programming Revisited: Improving Knapsack AlgorithmsComputing, 1999