206 search results - page 15 / 42 » Experiences from a Socio-economic Application of Induction T... |
101
click to vote
KDD
2004
ACM
15 years 10 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
113
click to vote
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
74
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We present an intuitive scheme for lossy color-image compression: Use the color information from a few representative pixels to learn a model which predicts color on the rest of t...
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
Getting the right software requirements under the right environment assumptions is a critical precondition for developing the right software. This task is intrinsically difficult....
PKDD
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. In many applications of data mining a - sometimes considerable - part of the data values is missing. This may occur because the data values were simply never entered into...