Sciweavers

628 search results - page 70 / 126
» Selective association rule generation
Sort
View
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 8 days 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
VLDB
2005
ACM
146views Database» more  VLDB 2005»
16 years 2 days ago
Adaptive website recommendations with AWESOME
Recommendations are crucial for the success of large websites. While there are many ways to determine recommendations, the relative quality of these recommenders depends on many fa...
Andreas Thor, Nick Golovin, Erhard Rahm
IDEAS
2007
IEEE
71views Database» more  IDEAS 2007»
15 years 6 months ago
Feature Space Enrichment by Incorporation of Implicit Features for Effective Classification
Feature Space Conversion for classifiers is the process by which the data that is to be fed into the classifier is transformed from one form to another. The motivation behind doin...
Abhishek Srivastava, Osmar R. Zaïane, Maria-L...
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
15 years 5 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
CONCUR
2003
Springer
15 years 5 months ago
Priority Rewrite Systems for OSOS Process Languages
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
Irek Ulidowski