732 search results - page 25 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
SBACPAD
2003
IEEE
14 years 28 days ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...