UGC Approved Journal no 63975(19)

ISSN: 2349-5162 | ESTD Year : 2014
Call for Paper
Volume 11 | Issue 4 | April 2024

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 4 Issue 4
May-2017
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR1704067


Registration ID:
170268

Page Number

278-280

Share This Article


Jetir RMS

Title

Lattice structure with CHARM-L to improve efficiency of generating frequently closed item sets

Abstract

Efficient algorithms for mining frequent item-sets are crucial for mining association rules as well as for many other data mining tasks. It is well known that countTable is one of the most important facility to employ subsets property for compressing the transaction database to new lower representation of occurrences items. One of the biggest problem in this technique is the cost of candi-date generation and test processing which are the two most important steps to find association rules. In this paper, we have developed this method to avoid the costly candidate-generation-and-test processing completely. Moreover, the proposed methods also compress crucial information about all itemsets, maximal length frequent itemsets, minimal length frequent itemsets, avoid expensive, and repeated database scans. The proposed named CountTableFI andBinaryCountTableF are presented, the algorithm has significant difference from the Apriori and all other algorithms extended from Apriori. The idea behind this algorithm is in the representation of the transactions,where, we represent all transactions in binary number and decimal number, so it is simple and fast to use subset and identical set properties. A comprehensive performance study shows that our techniques are efficient and scalable comparing with other methods.

Key Words

Association rule mining, Frequent, Apriori,Count table, Efficient

Cite This Article

"Lattice structure with CHARM-L to improve efficiency of generating frequently closed item sets", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.4, Issue 4, page no.278-280, April-2017, Available :http://www.jetir.org/papers/JETIR1704067.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"Lattice structure with CHARM-L to improve efficiency of generating frequently closed item sets", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.4, Issue 4, page no. pp278-280, April-2017, Available at : http://www.jetir.org/papers/JETIR1704067.pdf

Publication Details

Published Paper ID: JETIR1704067
Registration ID: 170268
Published In: Volume 4 | Issue 4 | Year May-2017
DOI (Digital Object Identifier):
Page No: 278-280
Country: Ahmedabad, Gujarat, India .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

0003144

Print This Page

Current Call For Paper

Jetir RMS