source: trunk/yat/classifier/PolynomialKernelFunction.h @ 1615

Last change on this file since 1615 was 1487, checked in by Jari Häkkinen, 13 years ago

Addresses #436. GPL license copy reference should also be updated.

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date ID
File size: 2.5 KB
Line 
1#ifndef _theplu_yat_classifier_polynomial_kernel_function_
2#define _theplu_yat_classifier_polynomial_kernel_function_
3
4// $Id$
5
6/*
7  Copyright (C) 2003 Peter Johansson
8  Copyright (C) 2004, 2005, 2006, 2007 Jari Häkkinen, Peter Johansson
9
10  This file is part of the yat library, http://dev.thep.lu.se/yat
11
12  The yat library is free software; you can redistribute it and/or
13  modify it under the terms of the GNU General Public License as
14  published by the Free Software Foundation; either version 3 of the
15  License, or (at your option) any later version.
16
17  The yat library is distributed in the hope that it will be useful,
18  but WITHOUT ANY WARRANTY; without even the implied warranty of
19  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20  General Public License for more details.
21
22  You should have received a copy of the GNU General Public License
23  along with yat. If not, see <http://www.gnu.org/licenses/>.
24*/
25
26#include "KernelFunction.h"
27
28#include <cmath>
29
30namespace theplu {
31namespace yat {
32namespace classifier {
33
34  class DataLookup1D;
35
36  ///
37  /// @brief Class for polynomial kernel calculations
38  ///
39
40 
41  class PolynomialKernelFunction : public KernelFunction
42  {
43   
44  public:
45    ///
46    ///Constructor taking the order of the polynomial as input. Default is
47    ///order=1 yielding the linear kernel function.
48    ///
49    PolynomialKernelFunction(int = 1);
50   
51    ///
52    ///Destructor
53    ///
54    virtual ~PolynomialKernelFunction(void) {};
55   
56    ///
57    /// returning the scalar product of two vectors in feature space using the
58    /// polynomial kernel. @return If order is larger than one: \f$ (1+x \cdot
59    /// y)^{order} \f$ \n If order is one (linear): \f$ x \cdot y \f$
60    ///   
61    double operator()(const DataLookup1D& a1, const DataLookup1D& a2) const;
62
63    ///
64    /// @return If order is larger than one: \f$ (1+x \cdot y)^{order}
65    /// \f$ \n If order is one (linear): \f$ \sum w_yxy \f$
66    ///
67    ///
68    double operator()(const DataLookup1D& x, 
69                      const DataLookupWeighted1D& y) const;
70    ///
71    /// returning the scalar product of two vectors in feature space
72    /// using the polynomial kernel with weights. Having all weights
73    /// equal to unity yields the same as non-weighted version.
74    ///
75    /// @return If order is larger than one: \f$ (1+x \cdot y)^{order}
76    /// \f$ \n If order is one (linear): \f$ \sum w_xw_yxy \f$
77    ///
78    double operator()(const DataLookupWeighted1D& x, 
79                      const DataLookupWeighted1D& y) const;
80
81
82  private:
83    int order_;
84
85  }; // class PolynomialKernelFunction
86
87}}} // of namespace classifier, yat, and theplu
88
89#endif
Note: See TracBrowser for help on using the repository browser.