Sciweavers

2071 search results - page 239 / 415
» Behaviour Management in Database Applications
Sort
View
DAWAK
2000
Springer
14 years 3 months ago
Enhancing Preprocessing in Data-Intensive Domains using Online-Analytical Processing
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 ...
Alexander Maedche, Andreas Hotho, Markus Wiese
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
14 years 23 days ago
An efficient algorithm for a class of fused lasso problems
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...
Jun Liu, Lei Yuan, Jieping Ye
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 11 months ago
Topical query decomposition
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...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 11 months ago
Fast direction-aware proximity for graph mining
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...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
14 years 11 months ago
Ordering patterns by combining opinions from multiple sources
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...
Pang-Ning Tan, Rong Jin