/
svm_kernel_construct.hpp
130 lines (83 loc) · 3.28 KB
/
svm_kernel_construct.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
/*
Copyright (C) 2012 Andrew Cotter
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/**
\file svm_kernel_construct.hpp
\brief SVM::Kernel::Construct function
*/
#ifndef __SVM_KERNEL_CONSTRUCT_HPP__
#define __SVM_KERNEL_CONSTRUCT_HPP__
#ifdef __cplusplus
#include "svm_kernel_base.hpp"
#include "vector.hpp"
#include <boost/shared_ptr.hpp>
#include <vector>
namespace SVM {
namespace Kernel {
//============================================================================
// Construct function
//============================================================================
template< typename t_Type, template< typename, typename > class t_KernelType, typename t_Traits, typename t_OriginalVectorType >
inline boost::shared_ptr< Base > Construct(
std::vector< t_OriginalVectorType >& vectors,
std::vector< double >& labels,
unsigned int const trainingSize,
std::vector< std::string > const& kernelParameters,
unsigned int const cacheSize = 0
)
{
uint64_t sparseSize = 0;
if ( t_Traits::SPARSE_ALLOWED ) {
typename std::vector< SparseVector< t_Type > >::const_iterator ii = vectors.begin();
typename std::vector< SparseVector< t_Type > >::const_iterator iiEnd = vectors.end();
for ( ; ii != iiEnd; ++ii )
sparseSize += ii->Size();
}
uint64_t spanSize = 0;
if ( t_Traits::SPAN_ALLOWED ) {
typename std::vector< SparseVector< t_Type > >::const_iterator ii = vectors.begin();
typename std::vector< SparseVector< t_Type > >::const_iterator iiEnd = vectors.end();
for ( ; ii != iiEnd; ++ii )
spanSize += SpanVector< t_Type >( *ii ).Size();
}
uint64_t denseSize = 0;
{ typename std::vector< SparseVector< t_Type > >::const_iterator ii = vectors.begin();
typename std::vector< SparseVector< t_Type > >::const_iterator iiEnd = vectors.end();
for ( ; ii != iiEnd; ++ii )
denseSize += DenseVector< t_Type >( *ii ).Size();
}
boost::shared_ptr< Base > result;
if (
t_Traits::SPARSE_ALLOWED &&
( ( ! t_Traits::SPAN_ALLOWED ) || ( sparseSize <= spanSize ) ) &&
( sparseSize <= denseSize )
)
{
result = boost::shared_ptr< Base >( new t_KernelType< SparseVector< t_Type >, t_Traits >( vectors, labels, trainingSize, kernelParameters, cacheSize ) );
}
else if (
t_Traits::SPAN_ALLOWED &&
( spanSize <= denseSize )
)
{
result = boost::shared_ptr< Base >( new t_KernelType< SpanVector< t_Type >, t_Traits >( vectors, labels, trainingSize, kernelParameters, cacheSize ) );
}
else {
result = boost::shared_ptr< Base >( new t_KernelType< DenseVector< t_Type >, t_Traits >( vectors, labels, trainingSize, kernelParameters, cacheSize ) );
}
return result;
}
} // namespace Kernel
} // namespace SVM
#endif /* __cplusplus */
#endif /* __SVM_KERNEL_CONSTRUCT_HPP__ */