Changeset 966 for trunk/yat/statistics
- Timestamp:
- Oct 11, 2007, 7:01:01 PM (16 years ago)
- Location:
- trunk/yat/statistics
- Files:
-
- 8 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/yat/statistics/AUC.h
r865 r966 51 51 public: 52 52 /// 53 /// 54 /// 53 /// \brief Defaul Constructor 54 /// \param absolute if true max(AUC, 1-AUC) is used 55 /// 55 56 AUC(bool absolute=true); 56 57 -
trunk/yat/statistics/SAMScore.h
r865 r966 57 57 /// 58 58 /// @param s0 \f$ s_0 \f$ is a fudge factor 59 /// @param absolute if true max(score, -score) is used 59 60 /// 60 61 SAMScore(const double s0, bool absolute=true); -
trunk/yat/statistics/Score.h
r865 r966 118 118 /// is wanted. 119 119 /// 120 /// @a value and @weight are copied to utility::vector and the120 /// \a value and \a weight are copied to utility::vector and the 121 121 /// corresponding operator is called. If speed is important this 122 122 /// operator should be implemented in inherited class to avoid -
trunk/yat/statistics/VectorFunction.h
r865 r966 36 36 struct VectorFunction 37 37 { 38 /** 39 \brief Destructor 40 */ 38 41 virtual ~VectorFunction(); 42 43 /** 44 \brief abstract interface 45 */ 39 46 virtual double operator()(const std::vector<double>&) const=0; 40 47 }; … … 89 96 }; 90 97 91 98 /** 99 Functor that picks Nth smalles element in a vector. 100 */ 92 101 class Nth_Element : public VectorFunction 93 102 { -
trunk/yat/statistics/euclidean_vector_distance.h
r937 r966 23 23 : public vector_distance_tag 24 24 { 25 /// \brief tag for euclidean distance 25 26 typedef euclidean_vector_distance_tag distance; 26 27 }; -
trunk/yat/statistics/pearson_vector_distance.h
r937 r966 22 22 : public vector_distance_tag 23 23 { 24 /// \brief tag for pearson distance 24 25 typedef pearson_vector_distance_tag distance; 25 26 }; -
trunk/yat/statistics/tScore.h
r865 r966 80 80 2 } \f$ 81 81 82 \param target Target defining the two groups 83 \param value Vector with data points on which calculation is based 82 84 @param dof double pointer in which approximation of degrees of 83 85 freedom is returned: pos.n()+neg.n()-2. See AveragerWeighted. … … 100 102 } \f$. See AveragerWeighted for details. 101 103 104 \param target Target defining the two groups 105 \param value Vector with values/weights on which calculation is based 102 106 @param dof double pointer in which approximation of degrees of 103 107 freedom is returned: pos.n()+neg.n()-2. See AveragerWeighted. … … 154 158 + n_y - 2 } \f$. See AveragerWeighted for details. 155 159 160 \param target Target defining the two groups 161 \param value Vector with data values on which calculation is based 162 \param weight Vector with weight associated to \a value 156 163 @param dof double pointer in which approximation of degrees of 157 164 freedom is returned: pos.n()+neg.n()-2. See AveragerWeighted. -
trunk/yat/statistics/vector_distance.h
r958 r966 18 18 /// For each measure to calculate distances between containers 19 19 /// with random access iterators one should provide a struct 20 /// whichinherits from vector_distance_tag and provides a "label" for20 /// that inherits from vector_distance_tag and provides a "label" for 21 21 /// the distance measure. 22 22 /// 23 23 struct vector_distance_tag { 24 /// tag defining distance measure 24 25 typedef vector_distance_tag distance; 25 26 }; … … 36 37 template <class T> 37 38 struct vector_distance_traits { 39 /// \return distance type 38 40 typedef typename T::distance distance; 39 41 };
Note: See TracChangeset
for help on using the changeset viewer.