Objective Approach for Fast Algorithms in Mining Association Rules

Authors(4) :-Bikani Varalakshmi, K Anbazhagan, Dr. S. Senthil Kumar, Dr. S. Sreenatha Reddy

The growing interest in info storage has created the information size to be exponentially exaggerated, hampering the method {of info|of data|of knowledge} discovery from these large volumes of high-dimensional and heterogeneous information. In recent years, several economical algorithms for mining info associations ar planned, facing up time and main memory desires. still, this mining technique should become arduous once the quantity of things and records is awfully high. throughout this paper, the goal is not to propose new economical algorithms but a novel info structure that may be used by a variety of existing algorithms while not modifying its original schema0. Thus, our aim is to hurry up the association rule mining technique regardless the formula wont to this end, sanctioning the performance of economical implementations to be accumulated. The structure simplifies, reorganizes, and quickens the {data} access by sorting data by implies that of a shuffling strategy supported the acting distance, that come back through similar values to be nearer, associate degreed considering every Associate in Nursing inverted index mapping and a run length cryptography compression. inside the experimental study, we've got an inclination to explore the bounds of the algorithms’ performance by employing a wide range of data sets that comprise either thousands or variant every things and records. The results demonstrate the utility of the projected arrangement in enhancing the algorithms’ runtime orders of magnitude, and significantly reducing each the auxiliary and conjointly the most memory desires.

Authors and Affiliations

Bikani Varalakshmi
PG Scholar, Department of Computer Science and Engineering, Guru Nanak Institute of Technology, Ibrahimpatnam, Telangana, India
K Anbazhagan
Department of Computer Science and Engineering, Guru Nanak Institute of Technology, Ibrahimpatnam, Telangana, India
Dr. S. Senthil Kumar
Associate Professor, Department of Computer Science and Engineering, Guru Nanak Institute of Technology, Ibrahimpatnam, Telangana, India
Dr. S. Sreenatha Reddy
Principal, Guru Nanak Institute of Technology, Ibrahimpatnam, Telangana, India

Mining, ARM, FP-Growth Algorithmic, LSC, ELM

  1. R. Agrawal and R. Srikant, “Fast algorithms for mining association  rules in  large databases,” in Proc. 20th Int. Conf. Very Large Data Bases (VLDB), Santiago, Chile, 1994, pp. 487–499.
  2. J. Han, J. Pei, Y. Yin, and R. Mao, “Mining frequent patterns without       candidategeneration: A frequent-pattern tree approach,” Data Min.Knowl.  Disc., vol. 8,no.1, pp. 53–87, 2004.
  3. J. Demšar, “Statistical comparisons of classifiers over multiple data sets,”  J.Mach. Learn. Res., vol. 7, pp. 1–30, Jan. 2006.
  4. S. García and F. Herrera, “An extension on statistical comparisons of          Classifiers over multiple data sets for all pairwise comparisons,”  J.Mach.Learn. Res,vol. 9, pp. 2677–2694, Dec. 2008.
  5. M. Hall et al., “The WEKA data mining software: An update,” SIGKDD  Explor., vol. 11, no. 1, pp. 10–18, 2009.

Publication Details

Published in : Volume 3 | Issue 6 | September-October 2017
Date of Publication : 2017-10-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 01-04
Manuscript Number : IJSRSET17362
Publisher : Technoscience Academy

Print ISSN : 2395-1990, Online ISSN : 2394-4099

Cite This Article :

Bikani Varalakshmi, K Anbazhagan, Dr. S. Senthil Kumar, Dr. S. Sreenatha Reddy, " Objective Approach for Fast Algorithms in Mining Association Rules, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 3, Issue 6, pp.01-04, September-October.2017
URL : http://ijsrset.com/IJSRSET17362

Follow Us

Contact Us