Sciweavers

739 search results - page 89 / 148
» Approximate Association Rule Mining
Sort
View
ICDM
2010
IEEE
217views Data Mining» more  ICDM 2010»
13 years 8 months ago
Discovering Temporal Features and Relations of Activity Patterns
An important problem that arises during the data mining process in many new emerging application domains is mining data with temporal dependencies. One such application domain is a...
Ehsan Nazerfard, Parisa Rashidi, Diane J. Cook
IISWC
2006
IEEE
14 years 4 months ago
MineBench: A Benchmark Suite for Data Mining Workloads
Abstract— Data mining constitutes an important class of scientific and commercial applications. Recent advances in data extraction techniques have created vast data sets, which ...
Ramanathan Narayanan, Berkin Özisikyilmaz, Jo...
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 10 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
CLIMA
2004
13 years 11 months ago
The Apriori Stochastic Dependency Detection (ASDD) Algorithm for Learning Stochastic Logic Rules
Apriori Stochastic Dependency Detection (ASDD) is an algorithm for fast induction of stochastic logic rules from a database of observations made by an agent situated in an environm...
Christopher Child, Kostas Stathis
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 10 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald