Classification by voting feature intervals

  • Demiröz G
  • Güvenir H
  • 28


    Mendeley users who have this article in their library.
  • 68


    Citations of this article.


A new classification algorithm called VFI (for Voting Feature Intervals) is proposed. A concept is represented by a set of feature intervals on each feature dimension separately. Each feature participates in the classification by distributing real-valued votes among classes. The class receiving the highest vote is declared to be the predicted class. VFI is compared with the Naive Bayesian Classifier, which also considers each feature separately. Experiments on real-world datasets show that VFI achieves comparably and even better than NBC in terms of classification accuracy. Moreover, VFI is faster than NBC on all datasets.

Author-supplied keywords

  • VFI

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • G Demiröz

  • H Güvenir

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free