ALCOMFT-TR-03-186
|

|
Devdatt Dubashi, Luigi Laura and Alessandro Panconesi
Analysis and Experimental Evaluation of a simple Algorithm for Collaborative Filtering
Rome.
Work package 1.
December 2003.
Abstract: We introduce a random planted model of bi-categorical data to
model the problem of collaborative filtering or categorical
clustering. We adapt the ideas of an algorithm due to Condon and
Karp [CK00] to develop a simple linear time algorithm to
discover the underlying hidden structure of a graph generated
according to the planted model with high probability. We also give
applications to the probabilistic analysis of Latent Semantic
Indexing (LSI) in the probabilistic corpus models introduced by
Papadimitriou et al [PRTV00]. We carry out an experimental analysis
that shows that the algorithm might work quite well in practice.
Postscript file: ALCOMFT-TR-03-186.ps.gz (289 kb).
System maintainer Gerth Stølting Brodal <gerth@cs.au.dk>