Abstract
Mining high utility itemsets (HUIs) has been developing in recent years. However, the methods of mining from distributed databases have not mentioned yet. In this paper, we present a parallel method for mining HUIs in vertically partitioned distributed databases. We use WIT-tree structure to store local database on each site for parallel mining HUIs. The item ith in each SlaverSite is only sent to MasterSite if its Transaction-Weighted Utilization (TWU) satisfies minutility (minutil), and MasterSite only mines HUIs which exist at least on 2 sites. Besides, the parallel performance is also interesting because it reduces the waiting time of attended sites. Thus, the mining time is reduced more significant than that in mining from centralized database.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487–499 (1994)
Agrawal, R., Shafer, J.: Parallel Mining of Association Rules. IEEE Trans. Knowledge and Data Eng. 8(6), 962–969 (1996)
Erwin, A., Gopalan, R.P., Achuthan, N.R.: CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach. In: IEEE 7th International Conferences on Computer and Information Technology, Aizu Wakamatsu, Japan, pp. 71–76 (2007)
Erwin, A., Gopalan, R.P., Achuthan, N.R.: A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets. In: The 2nd International Workshop on Integrating Artificial Intelligence and Data Mining, Gold Coast, Australia, vol. 84, pp. 3–11 (2007)
Khan, M.S., Muyeba, M., Coenen, F.: A Weighted Utility Framework for Mining Association Rule. In: Proc. IEEE European Modelling Symposium (EMS 2008), pp. 87–92 (2008)
Le, B., Nguyen, H., Cao, T.A., Vo, B.: A Novel Algorithm for Mining High Utility Itemsets. In: IEEE 1st Asian Conference on Intelligent Information and Database Systems, Quang Binh, Vietnam, April 1-3, pp. 13–17 (2009)
Liu, Y., Liao, W., Choudhary, A.: A Fast High Utility Itemsets Mining Algorithm. In: UBDM 2005, Chicago, Illinois, USA, August 21, pp. 90–99 (2005)
Luo, P., Xuong, H., Lu, K., Shi, Z.: Distributed Classification in Peer-to-Peer Networks. In: KDD 2007, San Jose, California, USA, August 12–15 (2007)
Miller, D.J., Zhang, Y., Kesidis, G.: Decision Aggregation in Distributed Classification by a Transductive Extension of Maximum Entropy/Improved Iterative Scaling. EURASIP Journal on Advances in Signal Processing 2008 (2008)
Schuster, A., Wolff, R.: Communication-efficient distributed mining of association rules. In: Proc. of the 2001 ACM SIGMOD Int’l. Conference on Management of Data, Santa Barbara, California, pp. 473–484 (2001)
Serazi, M., Perera, A., Abidin, T., Hamer, G., Perrizo, W.: An API for Transparent Distributed Vertical Data Mining. In: Proceedings of the ISCA 14th International Conference on Intelligent and Adaptive Systems and Software Engineering, Novotel Toronto Centre, Toronto, Canada, July 20-22, pp. 151–156 (2005)
Sucahyo, Y.G., Gopalan, R.P.: CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure. In: IEEE ICDM Workshop on Frequent Itemset Mining Implementation (FIMI), Brighton UK (2004)
Wolff, R., Schuster, A.: Association Rule Mining in Peer-to-Peer Systems. IEEE Trans. Systems, Man and Cybernetics, Part B 34(6), 2426–2438 (2004)
Yao, H., Hamilton, H.J., Butz, C.J.: A Foundational Approach to Mining Itemset Utilities from Databases. In: Proceedings of 2004 SIAM International Conference on Data Mining, pp. 482–486 (2004)
Yao, H., Hamilton, H.J.: Mining Itemset Utilities from Transaction Databases. Data and Knowledge Engineering 59, 603–626 (2005)
Yao, H., Hamilton, H.J., Geng, L.: A Unified Framework for Utility Based Measures for Mining Itemsets. In: UBDM 2006, Philadelphia, Pennsylvania, USA, pp. 28–37 (2006)
Yu, G., Shao, S., Sun, D., Luo, B.: Mining Long High Utility Itemsets in Transaction Databases. WSEAS Transactions on Information Science & Applications 5(2), 326–331 (2008)
Zaki, M.J., Hsiao, C.J.: Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure. IEEE Transactions on Knowledge and Data Engineering 17(4), 462–478 (2005)
Zaki, M.J.: Parallel and Distributed Association Mining: A Survey. IEEE Concurrency, Special Issue on Parallel Mechanisms for Data Mining, 14–25 (December 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vo, B., Nguyen, H., Ho, T.B., Le, B. (2009). Parallel Method for Mining High Utility Itemsets from Vertically Partitioned Distributed Databases. In: Velásquez, J.D., RÃos, S.A., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2009. Lecture Notes in Computer Science(), vol 5711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04595-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-04595-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04594-3
Online ISBN: 978-3-642-04595-0
eBook Packages: Computer ScienceComputer Science (R0)