Cart (Loading....) | Create Account
Close category search window
 

Distributed Frequent Closed Itemsets Mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chun Liu ; Sch. of Autom. Sci. & Electr. Eng., Beijing Univ. of Aeronaut. & Astronaut., Beijing ; Zheng Zheng ; Kai-Yuan Cai ; Zhang, S.

As many large organizations have multiple data sources and the scale of dataset becomes larger and larger, it is inevitable to carry out data mining in the distributed environment. In this paper, we address the problem of mining global frequent closed itemsets in distributed environment. A novel algorithm is proposed to obtain global frequent closed itemsets with exact frequency and it is shown that the algorithm can determine all the global frequent closed itemsets. A new data structure is developed to maintain the closed itemsets. Then an efficient implementation is provided based on the structure. Experimental results show that the proposed algorithm is effective.

Published in:

Signal-Image Technologies and Internet-Based System, 2007. SITIS '07. Third International IEEE Conference on

Date of Conference:

16-18 Dec. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.