Sciweavers

374 search results - page 47 / 75
» New Algorithms for Fast Discovery of Association Rules
Sort
View
IPPS
2003
IEEE
15 years 3 months ago
A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
Pedro Morillo, Marcos Fernández
ADAPTIVE
2007
Springer
15 years 4 months ago
Data Mining for Web Personalization
Abstract. In this chapter we present an overview of Web personalization process viewed as an application of data mining requiring support for all the phases of a typical data minin...
Bamshad Mobasher
FIMI
2003
210views Data Mining» more  FIMI 2003»
14 years 11 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
15 years 2 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
FIMI
2004
134views Data Mining» more  FIMI 2004»
14 years 11 months ago
Recursion Pruning for the Apriori Algorithm
Implementations of the well-known Apriori algorithm for finding frequent item sets and associations rules usually rely on a doubly recursive scheme to count the subsets of a given...
Christian Borgelt