Ignore:
Timestamp:
Aug 24, 2006, 1:18:28 PM (15 years ago)
Author:
Peter
Message:

added random_shuffle function in Target class

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/c++_tools/classifier/ConsensusInputRanker.h

    r522 r592  
    1212  class CrossSplitter;
    1313
    14   ///
    15   /// Class for ranking rows in a data matrix versus a target vector.
    16   /// The rows are sorted with respect
    17   /// to median of their ranks.
    18   ///   
     14  ///
     15  /// @brief Robust algorithm to rank rows in a data matrix versus a
     16  /// target vector.
     17  ///
     18  /// The idea is to create several (different) ranked lists. The list
     19  /// could be different because they are based upon different
     20  /// sub-sets of the data, or the different lists could be different
     21  /// because they have are generated using different criteria. Having
     22  /// \f$N\f$ lists means each row in the data matrix has \f$N\f$
     23  /// ranks (each corresponding to one list) and a consensus ranked
     24  /// list is created by sorting the data rows with respect to their
     25  /// median rank.
     26  ///
     27  /// For the time being there are two ways to build a
     28  /// ConsensusInputRanker. 1) Sending a CrossSplitter to the
     29  /// constructor will create one ranked list for each of the
     30  /// partitions defined in the CrossSplitter. 2) You can generate
     31  /// your ranked list outside, using your favourite method, and
     32  /// adding it into the ConsensusInputRanker object. This allows
     33  /// combining different scores and different sub-sets in a more
     34  /// general way.
     35  ///
    1936  class ConsensusInputRanker
    2037  {
     
    2441    /// @brief Default constructor
    2542    ///
     43    /// Truly does nothing but creates a few empty member vectors.
     44    ///
    2645    ConsensusInputRanker(void);
    2746   
    2847    ///
    29     /// Constructor
    30     /// @todo doc
    31     ConsensusInputRanker(CrossSplitter&, statistics::Score&);
     48    /// For each sub-set in CrossSplitter @a sc an InputRanker object
     49    /// is created using the Score @s. After creation the data rows
     50    /// are sorted with respect to the median rank (i.e. update() is
     51    /// called).
     52    ///
     53    ConsensusInputRanker(CrossSplitter& sc, statistics::Score& s);
    3254   
    3355    ///
Note: See TracChangeset for help on using the changeset viewer.