Sciweavers

4 search results - page 1 / 1
» OPAM-An Efficient One Pass Association Mining Technique with...
Sort
View
JCIT
2008
128views more  JCIT 2008»
13 years 4 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
13 years 10 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
CIKM
2001
Springer
13 years 8 months ago
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...
Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen
CIKM
2006
Springer
13 years 8 months ago
Multi-evidence, multi-criteria, lazy associative document classification
We present a novel approach for classifying documents that combines different pieces of evidence (e.g., textual features of documents, links, and citations) transparently, through...
Adriano Veloso, Wagner Meira Jr., Marco Cristo, Ma...