Name
Abstract | ||
|---|---|---|
The Optimal Pairwise Coupling (O-PWC) classifier was proposed and used for data classification because of its excellent classification performance [1]. A key step in the O-PWC algorithm is to calculate a number of posterior probabilities, which was achieved using an iterative procedure in [1],[2]. In this paper, we will present an analytical solution to the problem of finding the posterior probabilities. As a result, the computational efficiency of the O-PWC algorithm will be significantly improved, which will be shown by one numerical example. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11427445_6 | ISNN (2) |
Keywords | Field | DocType |
data classification,optimal pairwise coupling,analytical solution,key step,o-pwc algorithm,computational efficiency,iterative procedure,numerical example,posterior probability,improved optimal pairwise coupling,excellent classification performance,analytic solution | Cross entropy,Pairwise comparison,Coupling,Binary classification,Iterative method,Computer science,Posterior probability,Artificial intelligence,Data classification,Classifier (linguistics),Machine learning | Conference |
Volume | ISSN | ISBN |
3497 | 0302-9743 | 3-540-25913-9 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roger Xu | 1 | 111 | 14.71 |
| Tao Qian | 2 | 5 | 1.66 |
| Chiman Kwan | 3 | 440 | 71.64 |