loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First IEEE International Conference on Data Mining (ICDM'01)
San Jose, California
November 29-December 02
ISBN: 0-7695-1119-8
ASCII Text
x 
 
Viviane Crestana Jensen, Nandit Soparkar, "Heuristic Optimization for Decentralized Frequent Itemset Counting," Data Mining, IEEE International Conference on, pp. 613, First IEEE International Conference on Data Mining (ICDM'01), 2001.
 
 
BibTex
x
 
@article{ 10.1109/ICDM.2001.989579,
author = {Viviane Crestana Jensen and Nandit Soparkar},
title = {Heuristic Optimization for Decentralized Frequent Itemset Counting},
journal ={Data Mining, IEEE International Conference on},
volume = {0},
year = {2001},
isbn = {0-7695-1119-8},
pages = {613},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2001.989579},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Mining, IEEE International Conference on
TI - Heuristic Optimization for Decentralized Frequent Itemset Counting
SN - 0-7695-1119-8
SP
EP
A1 - Viviane Crestana Jensen,
A1 - Nandit Soparkar,
PY - 2001
VL - 0
JA - Data Mining, IEEE International Conference on
ER -
 
The choices for mining of decentralized data are numerous, and we have developed techniques to enumerate and optimize decentralized frequent itemset counting. In this paper, we introduce our heuristic approach to improve the performance of such techniques developed in ways similar to query processing in database systems. We also describe empirical results that validate our heuristic techniques.
Citation:
Viviane Crestana Jensen, Nandit Soparkar, "Heuristic Optimization for Decentralized Frequent Itemset Counting," icdm, pp.613, First IEEE International Conference on Data Mining (ICDM'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.