CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

An Efficient Tree based algorithm for Association Rule Mining

by Akash Shrivastava, Kuntal Barua
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 117 - Number 11
Year of Publication: 2015
Authors: Akash Shrivastava, Kuntal Barua
10.5120/20601-3188

Akash Shrivastava, Kuntal Barua . An Efficient Tree based algorithm for Association Rule Mining. International Journal of Computer Applications. 117, 11 ( May 2015), 31-32. DOI=10.5120/20601-3188

@article{ 10.5120/20601-3188,
author = { Akash Shrivastava, Kuntal Barua },
title = { An Efficient Tree based algorithm for Association Rule Mining },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 117 },
number = { 11 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 31-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume117/number11/20601-3188/ },
doi = { 10.5120/20601-3188 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:59:09.094380+05:30
%A Akash Shrivastava
%A Kuntal Barua
%T An Efficient Tree based algorithm for Association Rule Mining
%J International Journal of Computer Applications
%@ 0975-8887
%V 117
%N 11
%P 31-32
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data mining is a process by which the from raw data information and important patterns are estimated. That involves the intermediate processes to find the data patterns from the input datasets. These processes are pre- processing, algorithm implementation and the testing of developed model. algorithm are used find the data pattern from the data, that may in form of associative, any data structure based or weight based. The proposed work is an effort in order to develop an association rule mining algorithm using the decision tree. Where the decision tree is used first to find the decision rules and according to rules new associate rules are extracted from the data.

References
  1. P. Rajendran, M. Madheswaran,Hybrid Medical Image Classification Using Association Rule Mining with Decision Tree Algorithm, JOURNAL OF COMPUTING, VOLUME 2, ISSUE 1, JANUARY 2010, ISSN 2151-9617
  2. A. Martin, M. Manjula and Dr. PrasannaVenkatesan,A Business Intelligence Model to Predict Bankruptcy using Financial Domain Ontology with Association Rule Mining Algorithm,IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 2, May 2011 ISSN (Online): 1694-0814
  3. Murat Kantarcioglu, Robert Nix, and Jaideep Vaidya, An Efficient Approximate forPrivacy-Preserving Association Rule Mining,PAKDD 2009, LNAI 5476, pp. 515–524, 2009. c
  4. MetanatHooshSada,Hamman W. Samuel,Sonal Patel,Osmar R. Zaïane,Fastest Association Rule Mining Algorithm Predictor(FARM-AP),C3S2E-11 2011, May 16-18, Montreal [QC, CANADA]Editors: Abran, Desai, MudurCopyright 2011 ACM 978-1-4503-0626-3/11/05
  5. Ruihai Dong, Markus Schaal, Michael P. O'Mahony, Kevin McCarthy, and Barry Smyth,THE REVIEWER'S ASSISTANT: RECOMMENDING TOPICS TO WRITERS BYASSOCIATION RULE MINING AND CASE-BASE REASONING, Downloaded 2013-12-12T03:37:02Z
Index Terms

Computer Science
Information Sciences

Keywords

Apriori Algorithm Association Rule Mining Cart Algorithm

Powered by PhDFocusTM