Sciweavers

618 search results - page 61 / 124
» Aggregated Subset Mining
Sort
View
CINQ
2004
Springer
125views Database» more  CINQ 2004»
15 years 5 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
CIBCB
2009
IEEE
15 years 29 days ago
A framework for the application of decision trees to the analysis of SNPs data
Data mining is the analysis of experimental datasets to extract trends and relationships that can be meaningful for the user. In genetic studies these techniques have revealed inte...
Linda Fiaschi, Jonathan M. Garibaldi, Natalio Kras...
JIIS
2008
133views more  JIIS 2008»
14 years 12 months ago
Maintaining frequent closed itemsets over a sliding window
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
James Cheng, Yiping Ke, Wilfred Ng
SDM
2011
SIAM
230views Data Mining» more  SDM 2011»
14 years 2 months ago
Multidimensional Association Rules in Boolean Tensors
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, J...
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
16 years 8 days ago
Efficient anonymity-preserving data collection
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
Justin Brickell, Vitaly Shmatikov