Sciweavers

388 search results - page 18 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
14 years 8 months ago
Scrutinizing Frequent Pattern Discovery Performance
Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been ...
Mohammad El-Hajj, Osmar R. Zaïane, Stella Luk...
IDEAS
2003
IEEE
106views Database» more  IDEAS 2003»
14 years 24 days ago
Frequent Itemsets Mining for Database Auto-Administration
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The a...
Kamel Aouiche, Jérôme Darmont, Le Gru...
CAEPIA
2003
Springer
14 years 22 days ago
Text Mining Using the Hierarchical Syntactical Structure of Documents
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
Roxana Dánger, José Ruiz-Shulcloper,...
CIDM
2007
IEEE
14 years 1 months ago
Measuring the Validity of Document Relations Discovered from Frequent Itemset Mining
— The extension approach of frequent itemset mining can be applied to discover the relations among documents. Several schemes, i.e., n-gram, stemming, stopword removal and term w...
Kritsada Sriphaew, Thanaruk Theeramunkong
HIPC
2003
Springer
14 years 21 days ago
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
Adriano Veloso, Matthew Eric Otey, Srinivasan Part...