By Topic

A channel coding perspective of recommendation systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. T. Aditya ; Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India ; Onkar Dabeer ; Bikash Kumar Dey

Motivated by recommendation systems, we consider the problem of estimating block constant binary matrices (of size m × n) from sparse and noisy observations. The observations are obtained from the underlying block constant matrix after unknown row and column permutations, erasures, and errors. We derive upper and lower bounds on the achievable probability of error. For fixed erasure and error probability, we show that there exists a constant C1 such that if the cluster sizes are less than C1 ln(mn), then for any algorithm the probability of error approaches one as m, n ¿ ¿. On the other hand, we show that a simple polynomial time algorithm gives probability of error diminishing to zero provided the cluster sizes are greater than C2 ln(mn) for a suitable constant C2.

Published in:

2009 IEEE International Symposium on Information Theory

Date of Conference:

June 28 2009-July 3 2009