See this document in CiteSeerX!

Weighted Probability Distribution Voting, an introduction (1999)  (Make Corrections)  
Hans van Halteren



  Home/Search   Context   Related

 
View or download:
uilots.let.uu.nl/publicat...halteren.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  uilots.let.uu.nl/publica...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper introduces a new machine learning technique, Weighted Probability Distribution Voting (WPDV). During learning, WPDV determines the output class probability distribution for each input feature, both atomic and complex. During classification, WPDV takes all input features that occur in the new input and adds the corresponding probability distributions, each multiplied by a weight factor which depends on the feature or feature type. The output class with the highest sum is then... (Update)

Active bibliography (related documents):   More   All
0.3:   Machine Learning and Natural Language Processing - Marquez (2000)   (Correct)
0.2:   Using Induced Rules as Complex Features in Memory-Based.. - van den Bosch (2000)   (Correct)
0.2:   The Role of Algorithm Bias vs Information Source in.. - De Pauw, Daelemans (2000)   (Correct)

Similar documents based on text:   More   All
1.0:   A Default First Order Family Weight Determination Procedure.. - van Halteren (2000)   (Correct)
0.7:   Chunking with WPDV Models - van Halteren (2000)   (Correct)
0.4:   Improving Accuracy in Wordclass Tagging through.. - van Halteren.. (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ halteren-weighted,
  author = "Hans van Halteren",
  title = "Weighted Probability Distribution Voting, an introduction",
  url = "citeseer.ist.psu.edu/432149.html" }
Citations (may not include all citations):
2177   Programs for Machine Learning (context) - Quinlan - 1993
1359   Induction of Decision Trees (context) - Quinlan - 1986
431   A tutorial on support vector machines for pattern recognitio.. - Burges - 1998
213   Maximum entropy approach to natural language processing - Berger, Pietra et al. - 1996
94   A method for disambiguating word senses in a large corpus (context) - Gale, Church et al. - 1993
66   TiMBL: Tilburg Memory Based Learner (context) - Daelemans, Zavrel et al.
26   Part of speech tagging using a network of linear separators - Roth, Zelenko - 1998
19   Improving data-driven wordclass tagging by system combinatio.. - van Halteren, Zavrel et al. - 1998
12   The CELEX lexical data base on CDROM (context) - Baayen, Piepenbrock et al. - 1993
9   igtree: using trees for compression and classification in la.. (context) - Daelemans, Van den Bosch et al. - 1997
6   Forgetting exceptions is harmful in language learning (context) - Daelemans, Van den Bosch et al.
6   the applicability of neural network and machine learning met.. - Lawrence, Giles et al. - 1995
1   Feature lattices for maximum entropy models (context) - Mikheev - 1998

Documents on the same site (http://www-uilots.let.uu.nl/publications/clin1999/papers.html):   More
Classifying Modal Interaction in Discourse - Vermeulen (1999)   (Correct)
The Semantics of Temporal Adjuncts - Schelkens, Van Eynde, Verdoolaege (2000)   (Correct)
Mining Subcategorization Information by Using Multiple.. - Marques, Lopes, Coelho (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC