A polynomial modeling based algorithm in top-N recommendation.
Özge Yücel KasapM. Alper TungaPublished in: Expert Syst. Appl. (2017)
Keyphrases
- learning algorithm
- times faster
- computationally efficient
- dynamic programming
- theoretical analysis
- computational complexity
- worst case
- probabilistic model
- computational cost
- experimental evaluation
- cost function
- detection algorithm
- search space
- classification algorithm
- optimization algorithm
- recognition algorithm
- polynomially bounded
- np hard
- preprocessing
- objective function
- collaborative filtering
- simulated annealing
- expectation maximization
- scheduling problem
- significant improvement
- k means
- mathematical model
- tree structure
- matching algorithm
- bayesian networks
- improved algorithm
- single pass
- similarity measure