Local soft belief updating for relational classification
We introduce local soft belief updating, a new heuristic for taking into account relations that exist between entities in a database. Our idea applies Pearl's belief updating, but only in the first-order neighborhood of each node, thus avoiding any problems with loops. We apply our method to a classification problem using a subset of the Cora database of computer science articles, with Cora's citation graph giving the relations between entities. © 2008 Springer-Verlag Berlin Heidelberg.
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Ding, G., Lax, R., Chen, J., Chen, P., & Marx, B. (2008). Local soft belief updating for relational classification. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4994 LNAI, 525-534. https://doi.org/10.1007/978-3-540-68123-6_57