Sciweavers

51 search results - page 7 / 11
» MAFIA: A Performance Study of Mining Maximal Frequent Itemse...
Sort
View
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 1 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
15 years 4 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street
IDEAS
2005
IEEE
99views Database» more  IDEAS 2005»
15 years 3 months ago
Distribution-Based Synthetic Database Generation Techniques for Itemset Mining
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...
Ganesh Ramesh, Mohammed Javeed Zaki, William Mania...
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
15 years 11 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...
IJFCS
2008
102views more  IJFCS 2008»
14 years 9 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...