16404 search results - page 2663 / 3281 » A set coverage problem |
183
click to vote
KDD
1998
ACM
15 years 11 months ago
1998
ACM
Several pattern discovery methods proposed in the data mining literature have the drawbacks that they discover too many obvious or irrelevant patterns and that they do not leverag...
178
click to vote
KR
1998
Springer
15 years 11 months ago
1998
Springer
This work is motivated by the existence of two useful but quite different knowledge representation formalisms, the situation calculus due to McCarthy, and the logic OL of only kno...
214
click to vote
LCPC
1998
Springer
15 years 11 months ago
1998
Springer
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
205
click to vote
PAKDD
1998
ACM
15 years 11 months ago
1998
ACM
Abstract. Approaches to data mining proposed so far are mainly symbolic decision trees and numerical feedforward neural networks methods. While decision trees give, in many cases, ...
212
click to vote
PKDD
1998
Springer
15 years 11 months ago
1998
Springer
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...