Sciweavers

851 search results - page 129 / 171
» On the Complexity of Mining Association Rules
Sort
View
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
14 years 28 days 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...
DIS
2008
Springer
13 years 10 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
SEDE
2007
13 years 10 months ago
Self-organizing map based web pages clustering using web logs
A Web-based business always wants to have the ability to track users’ browsing behavior history. This ability can be achieved by using Web log mining technologies. In this paper...
Dehu Qi, Chung-Chih Li
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 8 months ago
Document stream clustering: experimenting an incremental algorithm and AR-based tools for highlighting dynamic trends
We address here two major challenges presented by dynamic data mining: 1) the stability challenge: we have implemented a rigorous incremental density-based clustering algorithm, i...
Alain Lelu, Martine Cadot, Pascal Cuxac
IJAIT
2007
180views more  IJAIT 2007»
13 years 8 months ago
Detection and Prediction of Rare Events in Transaction Databases
Rare events analysis is an area that includes methods for the detection and prediction of events, e.g. a network intrusion or an engine failure, that occur infrequently and have s...
Christos Berberidis, Ioannis P. Vlahavas