Name
Abstract | ||
|---|---|---|
In a computational context, classification refers to assigning objects to different classes with respect to their features, which can be mapped to qualitative or quantitative variables. Several techniques have been developed recently to map the available information into a set of features (feature space) that improve the classification performance. Kernel functions provide a nonlinear mapping that implicitly transforms the input space to a new feature space where data can be separated, clustered and classified more easily. In this paper a kernel revised version of the Total Recognition by Adaptive Classification Experiments (T.R.A.C.E) algorithm, an iterative k-means like classification algorithm is presented. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.cor.2005.11.023 | Computers & OR |
Keywords | DocType | Volume |
kernel k-means procedure,input space,assigning object,available information,new feature space,classification algorithm,kernel function,Total Recognition,Adaptive Classification Experiments,feature space,classification performance | Journal | 34 |
Issue | ISSN | Citations |
10 | Computers and Operations Research | 6 |
PageRank | References | Authors |
0.61 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Cifarelli | 1 | 46 | 3.43 |
| Luciano Nieddu | 2 | 45 | 4.92 |
| O. Seref | 3 | 44 | 2.70 |
| Panos M. Pardalos | 4 | 698 | 98.99 |