LNBC: A link-based naive bayes classifier

Bina, Bahareh, Schulte, Oliver and Khosravi, Hassan (2009). LNBC: A link-based naive bayes classifier. In: ICDM Workshops 2009 - IEEE International Conference on Data Mining. 2009 IEEE International Conference on Data Mining Workshops, ICDMW 2009, Miami, FL, (489-494). December 6, 2009-December 6, 2009. doi:10.1109/ICDMW.2009.116


Author Bina, Bahareh
Schulte, Oliver
Khosravi, Hassan
Title of paper LNBC: A link-based naive bayes classifier
Conference name 2009 IEEE International Conference on Data Mining Workshops, ICDMW 2009
Conference location Miami, FL
Conference dates December 6, 2009-December 6, 2009
Proceedings title ICDM Workshops 2009 - IEEE International Conference on Data Mining
Journal name 2009 Ieee International Conference On Data Mining Workshops (Icdmw 2009)
Series ICDM Workshops 2009 - IEEE International Conference on Data Mining
Publication Year 2009
Sub-type Fully published paper
DOI 10.1109/ICDMW.2009.116
ISBN 9780769539027
Start page 489
End page 494
Total pages 6
Language eng
Abstract/Summary Many databases store data in relational format, with different types of entities and information about links between the entities. Link-based classification is the problem of predicting the class label of a target entity given information about features of the entity and about features of the related entities. A natural approach to link-based classification is to upgrade standard classification methods from the propositional, single-table testing. In this paper we propose a new classification rule for upgrading naive Bayes classifiers (NBC). Previous work on relational NBC has achieved the best results with link independency assumption which says that the probability of each link to an object is independent from the other links to the object. We formalize our method by breaking it into two parts: (1) the independent influence assumption: that the influence of one path from the target object to a related entity is independent of another. We consider object-path independency and (2) the independent feature assumption of NBC: that features of the target entity and a related entity are probabilistically independent given a target class label. We derive a new relational NBC rule that places more weight on the target entity features than formulations of the link independency assumption. The new NBC rule yields higher accuracies on three benchmark datasets-Mutagenesis, MovieLens, and Cora-with average improvements ranging from 2% to 10%.
Subjects 1703 Computational Theory and Mathematics
1707 Computer Vision and Pattern Recognition
1712 Software
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status Unknown

Document type: Conference Paper
Collection: Scopus Import - Archived
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Fri, 07 Oct 2016, 21:56:28 EST by Hassan Khosravi