Changeset 10266:288baf397204 in orange


Ignore:
Timestamp:
02/16/12 22:03:05 (2 years ago)
Author:
janezd <janez.demsar@…>
Branch:
default
Message:

Polished documentation for Orange.classification (3)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • docs/reference/rst/Orange.classification.knn.rst

    r10246 r10266  
    99***************************** 
    1010 
    11 The `nearest neighbors 
    12 algorithm <http://en.wikipedia.org/wiki/K-nearest_neighbor_algorithm>`_ is one of the most basic, 
    13 `lazy <http://en.wikipedia.org/wiki/Lazy_learning>`_ machine learning algorithms. 
    14 The learner only needs to store the instances of training data, while the classifier 
    15 does all the work by searching this list for the instances most similar to 
     11The `nearest neighbors algorithm 
     12<http://en.wikipedia.org/wiki/K-nearest_neighbor_algorithm>`_ is one 
     13of the most basic, `lazy 
     14<http://en.wikipedia.org/wiki/Lazy_learning>`_ machine learning 
     15algorithms.  The learner only stores the training data, and the 
     16classifier makes predictions based on the instances most similar to 
    1617the data instance being classified: 
    1718 
     
    2526    .. attribute:: k 
    2627 
    27         number of nearest neighbors used in classification. If set to 0 
    28         (default), the square root of the numbers of instances is used. 
     28        Number of nearest neighbors used in classification. If 0 
     29        (default), the square root of the numbers of instances is 
     30        used. 
    2931 
    3032    .. attribute:: distance_constructor 
Note: See TracChangeset for help on using the changeset viewer.