Li Long-chang
Wenzhou University

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Frequent Itemsets Mining Based on Concept Lattice and Sliding Window Zhang Chang-sheng; Ruan Jing; Huang Hai-long; Li Long-chang; Yang Bing-ru
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 8: August 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In this paper, a frequent itemsets mining algorithm of data stream based on concept lattice and sliding window is presented. This algorithm mines frequent concepts for new inflowing basic window in batches in a sliding window and generates concept lattice Hasse diagram. With introduction into small support degreeand error factorto do the pruning operations for non-frequent concept node, each connection point in the Hasse diagram contains the information of frequent itemsets and support degree. As the generation of Hasse diagram in the new basic windows, we integrate concept lattice vertically with the generated Hasse diagram and sliding window, and ultimately output all frequent itemsets through scanning all the graph nodes of Hasse diagram graph. The experimental results show that the proposed algorithm has a good performance. DOI: http://dx.doi.org/10.11591/telkomnika.v11i8.3140 
An Algorithm on Generating Lattice Based on Layered Concept Lattice Zhang Chang-sheng; Ruan Jing; Huang Hai-long; Li Long-chang; Yang Bing-ru
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 8: August 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Concept lattice is an effective tool for data analysis and rule extraction, a bottleneck factor on impacting the applications of concept lattice is how to generate lattice efficiently. In this paper, an algorithm LCLG on generating lattice in batch processing based on layered concept lattice is developed, this algorithm is based on layered concept lattice, the lattice is generated downward layer by layer through concept nodes and provisional nodes in current layer; the concept nodes are found parent-child relationships upward layer by layer, then the Hasse diagram of inter-layer connection is generated; in the generated process of the lattice nodes in each layer, we do the pruning operations dynamically according to relevant properties, and delete some unnecessary nodes, such that the generating speed is improved greatly; the experimental results demonstrate that the proposed algorithm has good performance. DOI: http://dx.doi.org/10.11591/telkomnika.v11i8.3063