An Approach to Mine Frequent Item Sets Considering Negative Item Values

Closed item sets are frequent itemsets that uniquely determines the exact frequency of frequent item sets. Closed Item sets reduces the massive output to a smaller magnitude without redundancy. In this paper, we present PSS-MCI, an efficient candidate generate based approach for mining all closed itemsets. It enumerates closed item sets using hash tree, candidate generation, super-set and sub-set checking. It uses partitioned based strategy to avoid unnecessary computation for the itemsets which are not useful. Using an efficient algorithm, it determines all closed item sets from a single scan over the database. However, several unnecessary item sets are being hashed in the buckets. To overcome the limitations, heuristics are enclosed with algorithm PSS-MCI. Empirical evaluation and results show that the PSS-MCI outperforms all candidate generate and other approaches. Further, PSS-MCI explores all closed item sets.

Download Full-text

The Research of Improved Apriori Algorithm

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.263-266.2179 ◽

2012 ◽

Vol 263-266 ◽

pp. 2179-2184 ◽

Cited By ~ 4

Author(s):

Zhen Yun Liao ◽

Xiu Fen Fu ◽

Ya Guang Wang

Keyword(s):

Association Rule ◽

Association Rule Mining ◽

Apriori Algorithm ◽

Rule Mining ◽

Frequent Item ◽

Mining Algorithm ◽

The Times ◽

Frequent Item Sets ◽

Candidate Item ◽

Improved Algorithm

The first step of the association rule mining algorithm Apriori generate a lot of candidate item sets which are not frequent item sets, and all of these item sets cost a lot of system spending. To solve this problem，this paper presents an improved algorithm based on Apriori algorithm to improve the Apriori pruning step. Using this method, the large number of useless candidate item sets can be reduced effectively and it can also reduce the times of judge whether the item sets are frequent item sets. Experimental results show that the improved algorithm has better efficiency than classic Apriori algorithm.

Download Full-text

Significant Frequent Item Sets Via Pattern Spectrum Filtering

Fuzzy Technology - Studies in Fuzziness and Soft Computing ◽

10.1007/978-3-319-26986-3_4 ◽

2015 ◽

pp. 73-84

Author(s):

Christian Borgelt ◽

David Picado-Muiño

Keyword(s):

Pattern Spectrum ◽

Frequent Item ◽

Frequent Item Sets

Download Full-text

Security and Verification of Server Data Using Frequent Itemset Mining in Ecommerce

International Journal of Synthetic Emotions ◽

10.4018/ijse.2017010103 ◽

2017 ◽

Vol 8 (1) ◽

pp. 31-43

Author(s):

Zuber Shaikh ◽

Antara Mohadikar ◽

Rachana Nayak ◽

Rohith Padamadan

Keyword(s):

Data Mining ◽

Frequent Itemsets ◽

Frequent Itemset ◽

Graphical Password ◽

Itemset Mining ◽

Frequent Item ◽

Data Mining Algorithms ◽

Shoulder Surfing ◽

Mining Algorithms ◽

Frequent Item Sets

Frequent itemsets refer to a set of data values (e.g., product items) whose number of co-occurrences exceeds a given threshold. The challenge is that the design of proofs and verification objects has to be customized for different data mining algorithms. Intended method will implement a basic idea of completeness verification and authentication approach in which the client will uses a set of frequent item sets as the evidence, and checks whether the server has missed any frequent item set as evidence in its returned result. It will help client detect untrusted server and system will become much more efficiency by reducing time. In authentication process CaRP is both a captcha and a graphical password scheme. CaRP addresses a number of security problems altogether, such as online guessing attacks, relay attacks, and, if combined with dual-view technologies, shoulder-surfing attacks.

Download Full-text

AFARTICA

Journal of Database Management ◽

10.4018/jdm.2019070104 ◽

2019 ◽

Vol 30 (3) ◽

pp. 71-93

Author(s):

Saubhik Paladhi ◽

Sankhadeep Chatterjee ◽

Takaaki Goto ◽

Soumya Sen

Keyword(s):

Threshold Value ◽

Search Space ◽

Apriori Algorithm ◽

The Novel ◽

Novel Technique ◽

Frequent Item ◽

Artificial Cell ◽

Typical Item ◽

Support Threshold ◽

Frequent Item Sets

Frequent item-set mining has been exhaustively studied in the last decade. Several successful approaches have been made to identify the maximal frequent item-sets from a set of typical item-sets. The present work has introduced a novel pruning mechanism which has proved itself to be significant time efficient. The novel technique is based on the Artificial Cell Division (ACD) algorithm which has been found to be highly successful in solving tasks that involve a multi-way search of the search space. The necessity conditions of the ACD process have been modified accordingly to tackle the pruning procedure. The proposed algorithm has been compared with the apriori algorithm implemented in WEKA. Accurate experimental evaluation has been conducted and the experimental results have proved the superiority of AFARTICA over apriori algorithm. The results have also indicated that the proposed algorithm can lead to better performance when the support threshold value is more for the same set of item-sets.

Download Full-text