70 search results - page 11 / 14 » An axiomatization of partition entropy |
IJCAI
1993
14 years 11 months ago
1993
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
JUCS
2008
14 years 9 months ago
2008
: The reliability of a communications network is often evaluated without taking into account the economic consequence of failures. Here a new approach is proposed to assess the eco...
106
click to vote
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
VTS
2002
IEEE
15 years 2 months ago
2002
IEEE
Run-length codes and their variants have recently been shown to be very effective for compressing system-on-achip (SOC) test data. In this paper, we analyze the Golomb code, the c...