2071 search results - page 239 / 415 » Behaviour Management in Database Applications |
106
click to vote
DAWAK
2000
Springer
15 years 6 months ago
2000
Springer
Abstract The application of data mining algorithms needs a goal-oriented preprocessing of the data. In practical applications the preprocessing task is very time consuming and has ...
KDD
2010
ACM
15 years 4 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
110
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
104
Voted
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
129
Voted
KDD
2004
ACM
16 years 2 months ago
2004
ACM
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...