/
LaplacianEigenmaps.h
executable file
·132 lines (108 loc) · 3 KB
/
LaplacianEigenmaps.h
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
131
132
/*
* 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.
*
* Written (W) 2011 Sergey Lisitsyn
* Copyright (C) 2011 Berlin Institute of Technology and Max-Planck-Society
*/
#ifndef LAPLACIANEIGENMAPS_H_
#define LAPLCAIANEIGENMAPS_H_
#ifdef HAVE_LAPACK
#include <shogun/preprocessor/DimensionReductionPreprocessor.h>
#include <shogun/features/Features.h>
#include <shogun/distance/Distance.h>
namespace shogun
{
class CFeatures;
class CDistance;
/** @brief the class LaplacianEigenmaps used to preprocess
* data using Laplacian Eigenmaps algorithm described in
*
* Belkin, M., & Niyogi, P. (2002).
* Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering.
* Science, 14, 585-591. MIT Press.
* Retrieved from http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.9400&rep=rep1&type=pdf
*
* Note that algorithm is very sensitive to heat distribution coefficient and number
* of neighbors for nearest neighbor graph. With no connectivity check is provided
* preprocessor can produce not really reasonable embeddings if K value makes graph
* not connected.
*
* This implementation is not parallel due to performance issues. Generalized
* eigenproblem is the bottleneck of this algorithm.
*
* Solving of generalized eigenproblem involves LAPACK DSYGVX routine
* and requires extra memory for right-hand side matrix storage.
* If ARPACK is available DSAUPD/DSEUPD is used with no extra
* memory usage.
*
*/
class CLaplacianEigenmaps: public CDimensionReductionPreprocessor
{
public:
/** constructor */
CLaplacianEigenmaps();
/** destructor */
virtual ~CLaplacianEigenmaps();
/** init
* @param data feature vectors for preproc
*/
virtual bool init(CFeatures* features);
/** cleanup
*
*/
virtual void cleanup();
/** apply preproc to feature matrix
*
*/
virtual SGMatrix<float64_t> apply_to_feature_matrix(CFeatures* features);
/** apply preproc to feature vector
*
*/
virtual SGVector<float64_t> apply_to_feature_vector(SGVector<float64_t> vector);
/** setter for K parameter
* @param k k
*/
void inline set_k(int32_t k)
{
m_k = k;
}
/** getter for K parameter
* @return k value
*/
int32_t inline get_k()
{
return m_k;
}
/** setter for TAU parameter
* @param tau tau
*/
void inline set_tau(float64_t tau)
{
m_tau = tau;
}
/** getter for TAU parameter
* @return tau value
*/
float64_t inline get_tau()
{
return m_tau;
}
/** get name */
virtual inline const char* get_name() const { return "LaplacianEigenmaps"; };
/** get type */
virtual inline EPreprocessorType get_type() const { return P_LAPLACIANEIGENMAPS; };
protected:
/** init */
void init();
protected:
/** number of neighbors */
int32_t m_k;
/** tau parameter of heat distribution */
float64_t m_tau;
};
}
#endif /* HAVE_LAPACK */
#endif /* LOCALLYLINEAREMBEDDING_H_ */