By Topic

An Algorithm of Mining Frequent Itemsets in Pervasive Computing

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

5 Author(s)
Shaohua Teng ; Guangdong Univ. of Technol., Guangzhou ; Jiangyu Su ; Wei Zhang ; Xiufen Fu
more authors

Based on DHP (direct hashing and pruning) algorithm, this paper presents a kind of transaction-marked DHP algorithm (TMDHP for short) to mining frequent itemsets in pervasive computing. Each element of the itemsets and the transaction's ID will be stored together in the hash-table. Using this method just need to access database once and avoids producing a deal of candidate itemsets. The experiments showed that the performance of the algorithm is better than the conventional apriori algorithm and the DHP algorithm, and has a big advantage for application in pervasive computing.

Published in:

Pervasive Computing and Applications, 2008. ICPCA 2008. Third International Conference on  (Volume:2 )

Date of Conference:

6-8 Oct. 2008