Sciweavers

822 search results - page 8 / 165
» Case Mining from Large Databases
Sort
View
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
SIGMOD
1993
ACM
134views Database» more  SIGMOD 1993»
14 years 8 days ago
Mining Association Rules between Sets of Items in Large Databases
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an e cient algorithm that generates all s...
Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami
KDD
2012
ACM
178views Data Mining» more  KDD 2012»
11 years 10 months ago
Differentially private transit data publication: a case study on the montreal transportation system
With the wide deployment of smart card automated fare collection (SCAFC) systems, public transit agencies have been benefiting from huge volume of transit data, a kind of sequent...
Rui Chen, Benjamin C. M. Fung, Bipin C. Desai, N&e...
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
14 years 12 days ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
CORR
2004
Springer
146views Education» more  CORR 2004»
13 years 8 months ago
Mining Frequent Itemsets from Secondary Memory
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
Gösta Grahne, Jianfei Zhu