Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

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

Print
PDF
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 96 - Number 1
Year of Publication: 2014
Authors:
Sanjeev Bansal
Sovers Singh Bisht
10.5120/16756-6309

Sanjeev Bansal and Sovers Singh Bisht. Article: Design and Implementation of an Improved Routing Algorithm using Frequent Item Set Mining. International Journal of Computer Applications 96(1):5-9, June 2014. Full text available. BibTeX

@article{key:article,
	author = {Sanjeev Bansal and Sovers Singh Bisht},
	title = {Article: Design and Implementation of an Improved Routing Algorithm using Frequent Item Set Mining},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {96},
	number = {1},
	pages = {5-9},
	month = {June},
	note = {Full text available}
}

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

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