1651 search results - page 118 / 331 » Measuring the Complexity of Classification Problems |
DATAMINE
2002
13 years 7 months ago
2002
The basic nearest neighbour classifier suffers from the indiscriminate storage of all presented training instances. With a large database of instances classification response time ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
EMNLP
2008
13 years 9 months ago
2008
In recent years there has been substantial work on the important problem of coreference resolution, most of which has concentrated on the development of new models and algorithmic...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
IJCAI
1989
13 years 9 months ago
1989
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...