TY - RPRT T1 - Link-based Classification Y1 - 2007 A1 - Sen,Prithviraj A1 - Getoor, Lise KW - Technical Report AB - Over the past few years, a number of approximate inference algorithms fornetworked data have been put forth. We empirically compare the performance of three of the popular algorithms: loopy belief propagation, mean field relaxation labeling and iterative classification. We rate each algorithm in terms of its robustness to noise, both in attribute values and correlations across links. We also compare them across varying types of correlations across links. PB - Instititue for Advanced Computer Studies, Univ of Maryland, College Park VL - UMIACS-TR-2007-11 UR - http://drum.lib.umd.edu/handle/1903/4298 ER -