224 search results - page 14 / 45 » Bounding Learning Time in XCS |
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
DMIN
2010
13 years 6 months ago
2010
Recently Vapnik et al. [11, 12, 13] introduced a new learning model, called Learning Using Privileged Information (LUPI). In this model, along with standard training data, the tea...
GOSLER
1995
13 years 12 months ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...