Sciweavers

7053 search results - page 335 / 1411
» Data Mining
Sort
View
PODS
2004
ACM
130views Database» more  PODS 2004»
16 years 6 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
228
Voted
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 9 months ago
Sampling minimal frequent boolean (DNF) patterns
We tackle the challenging problem of mining the simplest Boolean patterns from categorical datasets. Instead of complete enumeration, which is typically infeasible for this class ...
Geng Li, Mohammed J. Zaki
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
15 years 10 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
KDD
2008
ACM
110views Data Mining» more  KDD 2008»
16 years 7 months ago
Mining preferences from superior and inferior examples
Mining user preferences plays a critical role in many important applications such as customer relationship management (CRM), product and service recommendation, and marketing camp...
Bin Jiang, Jian Pei, Xuemin Lin, David W. Cheung, ...
ICDE
2006
IEEE
176views Database» more  ICDE 2006»
16 years 25 days ago
Deriving Private Information from Perturbed Data Using IQR Based Approach
Several randomized techniques have been proposed for privacy preserving data mining of continuous data. These approaches generally attempt to hide the sensitive data by randomly m...
Songtao Guo, Xintao Wu, Yingjiu Li