1651 search results - page 175 / 331 » Measuring the Complexity of Classification Problems |
COLT
1999
Springer
14 years 11 days ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
If Kolmogorov complexity [25] measures information in one object and Information Distance [4, 23, 24, 42] measures information shared by two objects, how do we measure information...
CHI
2009
ACM
14 years 23 days ago
2009
ACM
We build on our prior work with computer-supported teams performing a complex decision-making task on maps, where the distinction between content and process common ground is prop...
ICDM
2007
IEEE
13 years 12 months ago
2007
IEEE
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
FINTAL
2006
13 years 11 months ago
2006
In this article, we are studying the differences between the European languages using statistical and unsupervised methods. The analysis is conducted in different levels of languag...