Sciweavers

978 search results - page 114 / 196
» Synthesizing Database Transactions
Sort
View
FIMI
2003
123views Data Mining» more  FIMI 2003»
13 years 11 months ago
Apriori, A Depth First Implementation
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
Walter A. Kosters, Wim Pijls
DKE
2008
113views more  DKE 2008»
13 years 10 months ago
An efficient algorithm for mining closed inter-transaction itemsets
In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm co...
Anthony J. T. Lee, Chun-sheng Wang, Wan-Yu Weng, Y...
SIGMOD
2005
ACM
123views Database» more  SIGMOD 2005»
14 years 10 months ago
Middleware based Data Replication providing Snapshot Isolation
Many cluster based replication solutions have been proposed providing scalability and fault-tolerance. Many of these solutions perform replica control in a middleware on top of th...
Yi Lin, Bettina Kemme, Marta Patiño-Mart&ia...
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
14 years 4 months ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
ICCS
2001
Springer
14 years 2 months ago
Reverse Pivoting in Conceptual Information Systems
Abstract. In database marketing, the behavior of customers is analyzed by studying the transactions they have performed. In order to get a global picture of the behavior of a custo...
Joachim Hereth Correia, Gerd Stumme