Real-world data often involves objects that exhibit multiple relationships; for example, 'papers' and 'authors' exhibit both paper-author interactions and paper-paper citation relationships. A typical learning problem requires one to make inferences about a subclass of objects (e.g. 'papers'), while using the remaining objects and relations to provide relevant information. We present a simple, unified mechanism for incorporating information from multiple object types and relations when learning on a targeted subset. In this scheme, all sources of relevant information are marginalized onto the target subclass via random walks. We show that marginalized random walks can be used as a general technique for combining multiple sources of information in relational data. With this approach, we formulate new algorithms for transduction and ranking in relational data, and quantify the performance of new schemes on real world data - achieving good results in many problems. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Huang, J., Tingshao, Z., Greiner, R., Zhou, D., & Schuurmans, D. (2006). Information marginalization on subgraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4213 LNAI, pp. 199–210). Springer Verlag. https://doi.org/10.1007/11871637_22
Mendeley helps you to discover research relevant for your work.