Sciweavers

28 search results - page 1 / 6
» Learning k-Nearest Neighbor Naive Bayes for Ranking
Sort
View
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
13 years 10 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
JCIT
2010
148views more  JCIT 2010»
12 years 11 months ago
Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers
Probability theory is the framework for making decision under uncertainty. In classification, Bayes' rule is used to calculate the probabilities of the classes and it is a bi...
Mohammed J. Islam, Q. M. Jonathan Wu, Majid Ahmadi...
ICPR
2008
IEEE
13 years 11 months ago
Spam filtering with several novel bayesian classifiers
In this paper, we report our work on spam filtering with three novel bayesian classification methods: Aggregating One-Dependence Estimators (AODE), Hidden Naïve Bayes (HNB), Loca...
Chuanliang Chen, Yingjie Tian, Chunhua Zhang
AI
2005
Springer
13 years 10 months ago
Instance Cloning Local Naive Bayes
The instance-based k-nearest neighbor algorithm (KNN)[1] is an effective classification model. Its classification is simply based on a vote within the neighborhood, consisting o...
Liangxiao Jiang, Harry Zhang, Jiang Su
ICML
2005
IEEE
14 years 5 months ago
Augmenting naive Bayes for ranking
Naive Bayes is an effective and efficient learning algorithm in classification. In many applications, however, an accurate ranking of instances based on the class probability is m...
Harry Zhang, Liangxiao Jiang, Jiang Su