Sciweavers

65 search results - page 13 / 13
» Mining Fuzzy Association Rules from Composite Items
Sort
View
RCIS
2010
13 years 9 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
SDM
2003
SIAM
134views Data Mining» more  SDM 2003»
14 years 6 days ago
Hierarchical Document Clustering using Frequent Itemsets
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
Benjamin C. M. Fung, Ke Wang, Martin Ester
IJFCS
2008
102views more  IJFCS 2008»
13 years 11 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 10 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
14 years 4 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