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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Design and Implementation of an Improved Routing Algorithm using Frequent Item Set Mining

by Sanjeev Bansal, Sovers Singh Bisht
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 96 - Number 1
Year of Publication: 2014
Authors: Sanjeev Bansal, Sovers Singh Bisht
10.5120/16756-6309

Sanjeev Bansal, Sovers Singh Bisht . Design and Implementation of an Improved Routing Algorithm using Frequent Item Set Mining. International Journal of Computer Applications. 96, 1 ( June 2014), 5-9. DOI=10.5120/16756-6309

@article{ 10.5120/16756-6309,
author = { Sanjeev Bansal, Sovers Singh Bisht },
title = { Design and Implementation of an Improved Routing Algorithm using Frequent Item Set Mining },
journal = { International Journal of Computer Applications },
issue_date = { June 2014 },
volume = { 96 },
number = { 1 },
month = { June },
year = { 2014 },
issn = { 0975-8887 },
pages = { 5-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume96/number1/16756-6309/ },
doi = { 10.5120/16756-6309 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:20:38.496020+05:30
%A Sanjeev Bansal
%A Sovers Singh Bisht
%T Design and Implementation of an Improved Routing Algorithm using Frequent Item Set Mining
%J International Journal of Computer Applications
%@ 0975-8887
%V 96
%N 1
%P 5-9
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents how routers can manage large amount of data packets as routers exchange information with each other to find the best possible route to a destination thus graphs represent a more general class of structures than sets, sequences, lattices and trees. Since on web heavy range of information is represented by a graph as in social networks so modelling a sophisticated network by statistical analysis requires efficiency in routing packets within an autonomous system hence this approach here focuses on how routers can upgrade their configuration to exactly route the frequently occuring data packets within a homogeneous network.

References
  1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94, pp. 487 {499. }
  2. Data Mining: Concepts and Techniques: Concepts and Techniques -Jiawei Han, Micheline Kamber, Jian Pei. 2012
  3. Improved algorithm for frequent itemset mining based on apriori and FPtree-Sujata Dandu,B. L. Deekshatulu & Preei Chandra Global Journals Inc. (USA) 2013
  4. An improved frequent pattern tree based association rule mining technique. ICISA-2011
  5. Data communication and networking –Behrouz A forouzan -2006.
  6. An improved association tree mining with FP tree using positive and negative integration-Rashmi & Nitin Shukla-JGRCS-2012
  7. An effective approach in data mining to reduce redundancies in large databases-Sovers Singh & Dr. Sanjeev Bansal-IJETAE-2012
  8. J. Han,J. Pei and Y. Yin," Mining frequent patterns without candidate generation", Proceedings of the ACM SIGMOND ,May 2000.
  9. Contrasting Correlations by an efficient double clique Condition Aixiang Li,Makoto Haraguchi,and Yoshiaki Okubo.
  10. J. Pei, J. Han and H. lu. Hmine: Hyper-structure mining of frequent patterns in large databases. ICDM 2001. pp441-448.
Index Terms

Computer Science
Information Sciences

Keywords

Frequent item set mining statistical modeling of networks routing table autonomous system and graph representation.

Powered by PhDFocusTM