Sciweavers

3146 search results - page 58 / 630
» Efficient Consequence Finding
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 10 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 7 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
ICDM
2009
IEEE
150views Data Mining» more  ICDM 2009»
13 years 7 months ago
Filtering and Refinement: A Two-Stage Approach for Efficient and Effective Anomaly Detection
Anomaly detection is an important data mining task. Most existing methods treat anomalies as inconsistencies and spend the majority amount of time on modeling normal instances. A r...
Xiao Yu, Lu An Tang, Jiawei Han
EGH
2004
Springer
14 years 1 months ago
Understanding the efficiency of GPU algorithms for matrix-matrix multiplication
Utilizing graphics hardware for general purpose numerical computations has become a topic of considerable interest. The implementation of streaming algorithms, typified by highly ...
Kayvon Fatahalian, Jeremy Sugerman, Pat Hanrahan
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 12 months 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