Sciweavers

388 search results - page 29 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
14 years 2 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz
FLAIRS
2003
13 years 10 months ago
An Improved Algorithm for Mining Association Rules Using Multiple Support Values
Almost all the approaches in association rule mining suggested the use of a single minimum support, technique that either rules out all infrequent itemsets or suffers from the bot...
Ioannis N. Kouris, Christos Makris, Athanasios K. ...
IDEAS
2005
IEEE
99views Database» more  IDEAS 2005»
14 years 2 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...
PKDD
2005
Springer
105views Data Mining» more  PKDD 2005»
14 years 2 months ago
Protein Sequence Pattern Mining with Constraints
Considering the characteristics of biological sequence databases, which typically have a small alphabet, a very long length and a relative small size (several hundreds of sequences...
Pedro Gabriel Ferreira, Paulo J. Azevedo
ADMA
2006
Springer
220views Data Mining» more  ADMA 2006»
14 years 2 months ago
Mining and Validation of Localized Frequent Web Access Patterns with Dynamic Tolerance
Mining user profiles is a crucial task for Web usage mining, and can be accomplished by mining frequent patterns. However, in the Web usage domain, sessions tend to be very sparse,...
Olfa Nasraoui, Suchandra Goswami