Name
Abstract | ||
|---|---|---|
Gaussian process classifiers (GPCs) have recently attracted more and more attention from the machine learning community. However, because the posterior needs to be approximated by using a tractable Gaussian distribution, they usually suffer from high computational cost which is prohibitive for practical applications. In this paper, we present a new Gaussian process model termed as twin Gaussian processes for binary classification. The basic idea is to make predictions based on two latent functions with Gaussian process prior, each of which is close to one of the two classes and is as far as possible from the other. Being compared with the published GPCs, the proposed algorithm allows for an explicit inference based on analytical methods, thereby avoiding the high computational cost caused by approximating the posterior with Gaussian distribution. Experimental results on several benchmark data sets show that the proposed algorithm is valid and can achieve superior performance to the published algorithms. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ICDM.2011.149 | ICDM |
Keywords | Field | DocType |
binary classification,tractable gaussian distribution,new gaussian process model,published gpcs,high computational,gaussian process,twin gaussian,high computational cost,gaussian process classifier,gaussian distribution,twin gaussian processes,proposed algorithm,bayesian method,kernel machine,bayesian methods,gaussian processes,machine learning,learning artificial intelligence | Data set,Binary classification,Pattern recognition,Computer science,Inference,Gaussian,Artificial intelligence,Gaussian process,Kernel method,Machine learning,Bayesian probability | Conference |
Citations | PageRank | References |
3 | 0.39 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianjun He | 1 | 10 | 5.59 |
| Hong Gu | 2 | 5 | 2.16 |
| Shaorui Jiang | 3 | 3 | 0.39 |