Enhanced mining association rule algorithm with reduced time & space complexity

Punit Mundra, Amit K. Maurya, Sanjay Singh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we have proposed a technique to improve the performance of existing mining association rule algorithm which significantly reduces the time and space complexity of independent of datasets. There are many data mining algorithms for finding association rules our contribution can be used in almost all of the algorithms independent of its variety. In this paper we are concentrating more on Apriori algorithm which is a type of candidate generation algorithm also a fundamental block of all the mining algorithms, rectifying its major limitation of consuming ample amount of time in generating the candidates.

Original languageEnglish
Title of host publication2012 Annual IEEE India Conference, INDICON 2012
Pages1105-1110
Number of pages6
DOIs
Publication statusPublished - 01-12-2012
Event2012 Annual IEEE India Conference, INDICON 2012 - Kochi, Kerala, India
Duration: 07-12-201209-12-2012

Conference

Conference2012 Annual IEEE India Conference, INDICON 2012
CountryIndia
CityKochi, Kerala
Period07-12-1209-12-12

Fingerprint

Association rules
Data mining
Association rule mining

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems and Management
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Mundra, P., Maurya, A. K., & Singh, S. (2012). Enhanced mining association rule algorithm with reduced time & space complexity. In 2012 Annual IEEE India Conference, INDICON 2012 (pp. 1105-1110). [6420782] https://doi.org/10.1109/INDCON.2012.6420782
Mundra, Punit ; Maurya, Amit K. ; Singh, Sanjay. / Enhanced mining association rule algorithm with reduced time & space complexity. 2012 Annual IEEE India Conference, INDICON 2012. 2012. pp. 1105-1110
@inproceedings{8f939bc08fc04dd8aa58b41dd88c6126,
title = "Enhanced mining association rule algorithm with reduced time & space complexity",
abstract = "In this paper, we have proposed a technique to improve the performance of existing mining association rule algorithm which significantly reduces the time and space complexity of independent of datasets. There are many data mining algorithms for finding association rules our contribution can be used in almost all of the algorithms independent of its variety. In this paper we are concentrating more on Apriori algorithm which is a type of candidate generation algorithm also a fundamental block of all the mining algorithms, rectifying its major limitation of consuming ample amount of time in generating the candidates.",
author = "Punit Mundra and Maurya, {Amit K.} and Sanjay Singh",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/INDCON.2012.6420782",
language = "English",
isbn = "9781467322720",
pages = "1105--1110",
booktitle = "2012 Annual IEEE India Conference, INDICON 2012",

}

Mundra, P, Maurya, AK & Singh, S 2012, Enhanced mining association rule algorithm with reduced time & space complexity. in 2012 Annual IEEE India Conference, INDICON 2012., 6420782, pp. 1105-1110, 2012 Annual IEEE India Conference, INDICON 2012, Kochi, Kerala, India, 07-12-12. https://doi.org/10.1109/INDCON.2012.6420782

Enhanced mining association rule algorithm with reduced time & space complexity. / Mundra, Punit; Maurya, Amit K.; Singh, Sanjay.

2012 Annual IEEE India Conference, INDICON 2012. 2012. p. 1105-1110 6420782.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Enhanced mining association rule algorithm with reduced time & space complexity

AU - Mundra, Punit

AU - Maurya, Amit K.

AU - Singh, Sanjay

PY - 2012/12/1

Y1 - 2012/12/1

N2 - In this paper, we have proposed a technique to improve the performance of existing mining association rule algorithm which significantly reduces the time and space complexity of independent of datasets. There are many data mining algorithms for finding association rules our contribution can be used in almost all of the algorithms independent of its variety. In this paper we are concentrating more on Apriori algorithm which is a type of candidate generation algorithm also a fundamental block of all the mining algorithms, rectifying its major limitation of consuming ample amount of time in generating the candidates.

AB - In this paper, we have proposed a technique to improve the performance of existing mining association rule algorithm which significantly reduces the time and space complexity of independent of datasets. There are many data mining algorithms for finding association rules our contribution can be used in almost all of the algorithms independent of its variety. In this paper we are concentrating more on Apriori algorithm which is a type of candidate generation algorithm also a fundamental block of all the mining algorithms, rectifying its major limitation of consuming ample amount of time in generating the candidates.

UR - http://www.scopus.com/inward/record.url?scp=84874155184&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874155184&partnerID=8YFLogxK

U2 - 10.1109/INDCON.2012.6420782

DO - 10.1109/INDCON.2012.6420782

M3 - Conference contribution

SN - 9781467322720

SP - 1105

EP - 1110

BT - 2012 Annual IEEE India Conference, INDICON 2012

ER -

Mundra P, Maurya AK, Singh S. Enhanced mining association rule algorithm with reduced time & space complexity. In 2012 Annual IEEE India Conference, INDICON 2012. 2012. p. 1105-1110. 6420782 https://doi.org/10.1109/INDCON.2012.6420782