Sciweavers

86 search results - page 7 / 18
» Efficient Vertical Mining of Frequent Closures and Generator...
Sort
View
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 7 months ago
Weighted Association Rule Mining using weighted support and significance framework
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
Feng Tao, Fionn Murtagh, Mohsen Farid
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 7 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
ICDM
2006
IEEE
114views Data Mining» more  ICDM 2006»
14 years 1 months ago
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zha...
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
14 years 26 days 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
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
14 years 7 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...