
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Eray Özkural, Bora Uçar, Cevdet Aykanat, "Parallel Frequent Item Set Mining with Selective Item Replication," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 10, pp. 16321640, Oct., 2011.  
BibTex  x  
@article{ 10.1109/TPDS.2011.32, author = {Eray Özkural and Bora Uçar and Cevdet Aykanat}, title = {Parallel Frequent Item Set Mining with Selective Item Replication}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {22}, number = {10}, issn = {10459219}, year = {2011}, pages = {16321640}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.32}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Parallel Frequent Item Set Mining with Selective Item Replication IS  10 SN  10459219 SP1632 EP1640 EPD  16321640 A1  Eray Özkural, A1  Bora Uçar, A1  Cevdet Aykanat, PY  2011 KW  Parallel data mining KW  frequent item set mining KW  mining methods and algorithms KW  selective data replication KW  graph partitioning by vertex separator. VL  22 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules in Large Databases," Proc. 20th Int'l Conf. Very Large Data Bases (VLDB '94), pp. 487499, 1994.
[2] M.J. Zaki, "Generating NonRedundant Association Rules," Proc. Knowledge Discovery and Data Mining Conf., pp. 3443, 2000.
[3] D.I. Lin and Z.M. Kedem, "Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set," Proc. Sixth Int'l Conf. Extending Database Technology, pp. 105119, 1998.
[4] R. Agrawal and J.C. Shafer, "Parallel Mining of Association Rules," IEEE Trans. Knowledge and Data Eng., vol. 8, no. 6, pp. 962969, Dec. 1996.
[5] M.J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, "Parallel Algorithms for Discovery of Association Rules," Data Mining and Knowledge Discovery, vol. 1, no. 4, pp. 343373, 1997.
[6] D.W. Cheung, V.T. Ng, A.W. Fu, and Y.J. Fu, "Efficient Mining of Association Rules in Distributed Databases," IEEE Trans. Knowledge And Data Eng., vol. 8, no. 6, pp. 911922, Dec. 1996.
[7] O. Zaïane, M. ElHajj, and P. Lu, "Fast Parallel Association Rule Mining without Candidacy Generation," Proc. IEEE Int'l Conf. Data Mining (ICDM '01), Nov.Dec. 2001.
[8] A. Rudra, R.P. Gopalan, and Y.G. Sucahyo, "Scalable Parallel Mining for Frequent Patterns from Dense Data Sets Using a Cluster of PCs," Proc. Sixth Int'l Conf. Information Technology, Dec. 2003.
[9] E.H. Han, G. Karypis, and V. Kumar, "Scalable Parallel Data Mining for Association Rules," IEEE Trans. Knowledge and Data Eng., vol. 12, no. 3, pp. 337352, May 2000.
[10] S. Orlando, P. Palmerini, R. Perego, and F. Silvestri, "An Efficient Parallel and Distributed Algorithm for Counting Frequent Sets," Proc. Fifth Int'l Conf. High Performance Computing for Computational Science (VECPAR '02), 2003.
[11] C. Lucchese, S. Orlando, and R. Perego, "Fast and Memory Efficient Mining of Frequent Closed Itemsets," IEEE Trans. Knowledge and Data Eng., vol. 18, no. 1, pp. 2136, Jan. 2006.
[12] H. Li, Y. Wang, D. Zhang, M. Zhang, and E.Y. Chang, "Pfp: Parallel fpGrowth for Query Recommendation," Proc. ACM Conf. Recommender Systems (RecSys), P. Pu, D.G. Bridge, B. Mobasher, and F. Ricci, eds., pp. 107114, 2008.
[13] A. Savasere, E. Omiecinski, and S.B. Navathe, "An Efficient Algorithm for Mining Association Rules in Large Databases," Proc. 21st Int'l Conf. Very Large Data Bases (VLDB '95), pp. 432444, Sept. 1995.
[14] J.W.H. Liu, "A Graph Partitioning Algorithm by Node Separators," ACM Trans. Math. Software, vol. 15, no. 3, pp. 198219, Sept. 1989.
[15] G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. MarchettiSpaccamela, and M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Jan. 1999.
[16] A. Grama, V. Kumar, A. Gupta, and G. Karypis, An Introduction to Parallel Computing: Design and Analysis of Algorithms, second ed., AddisonWesley, 2003.
[17] R.J. BayardoJr., "Efficiently Mining Long Patterns from Databases," ACM SIGMOD Record, vol. 27, no. 2, pp. 8593, 1998.
[18] S. Orlando, C. Lucchese, P. Palmerini, R. Perego, and F. Silvestri, "kDCI: A MultiStrategy Algorithm for Mining Frequent Sets," Proc. Second IEEE Int'l Conf. Data Mining (ICDM) Workshop Frequent Itemset Mining Implementations (FIMI '04), 2004.
[19] S. Orlando, P. Palmerini, R. Perego, and F. Silvestri, "Adaptive and ResourceAware Mining of Frequent Sets," Proc. IEEE Int'l Conf. Data Mining (ICDM '02), pp. 338345, Dec. 2002.
[20] T. Uno, M. Kiyomi, and H. Arimura, "LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets," Proc. Second IEEE Int'l Conf. Data Mining (ICDM) Workshop Frequent Itemset Mining Implementations (FIMI '04), 2004.
[21] A. Fiat and S. Shporer, "AIM2: Another Itemset Miner," Proc. Second IEEE Int'l Conf. Data Mining (ICDM) Workshop Frequent Itemset Mining Implementations (FIMI '04), 2004.
[22] E. Özkural and C. Aykanat, "A Space Optimization for FPGrowth," Proc. Second IEEE Int'l Conf. Data Mining (ICDM) Workshop Frequent Itemset Mining Implementations (FIMI '04), 2004.
[23] Ü.V. Çatalyürek and C. Aykanat, "HypergraphPartitioningBased Sparse Matrix Ordering," Proc. Second Int'l Workshop Combinatorial Scientific Computing (CSC '05), June 2005.
[24] U. Catalyurek, C. Aykanat, and E. Kayaaslan, "Hypergraph PartitioningBased FillReducing Ordering," Technical Report BUCE0904, Bilkent Univ. Inst. of Science and Eng., 2009.
[25] Ü.V. Çatalyürek and C. Aykanat, "PaToH: A Multilevel Hypergraph Partitioning Tool, Version 3.0," technical report, Bilkent Univ., Computer Eng. Dept., 1999.
[26] Ü.V. Çatalyürek and C. Aykanat, "HypergraphPartitioningBased Decomposition for Parallel SparseMatrix Vector Multiplication," IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 7, pp. 673693, July 1999.