Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1007/978-3-540-68123-6_57 | ISMIS |
Keywords | DocType | Volume |
citation graph,relational classification,new heuristic,account relation,local soft belief,classification problem,computer science article,cora database,first-order neighborhood,first order | Conference | 4994 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-68122-1 | 2 |
PageRank | References | Authors |
0.44 | 6 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Guoli Ding | 1 | 444 | 51.58 |
R. F. Lax | 2 | 45 | 4.05 |
Jianhua Chen | 3 | 2 | 0.44 |
Peter P. Chen | 4 | 1027 | 1122.69 |
Brian D. Marx | 5 | 40 | 13.38 |