DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Proceedings papers >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/100/2318

Title: Channel coding perspective of recommendation systems
Authors: ADITYA, ST
DABEER, O
DEY, BK
Issue Date: 2009
Publisher: IEEE
Citation: 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4,319-323
Abstract: Motivated by recommendation systems, we consider the problem of estimating block constant binary matrices (of size m x 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 C(1) such that if the cluster sizes are less than C(1) In(mn), then for any algorithm the probability of error approaches one as m,n -> 77 infinity. 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 C(2) In(mn) for a suitable constant C(2).
URI: http://dx.doi.org/10.1109/ISIT.2009.5205549
http://dspace.library.iitb.ac.in/xmlui/handle/10054/15548
http://hdl.handle.net/100/2318
ISBN: 978-1-4244-4312-3
Appears in Collections:Proceedings papers

Files in This Item:

File Description SizeFormat
Channel coding .pdf533.57 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback