ICIEMS 2015

International Conference on Information Engineering, Management and Security 2015

 


ICIEMS 2015 Kokula Krishna Hari K
Publication Meta Value
Short Title ICIEMS 2015
Publisher ASDF, India
ISBN 13 978-81-929742-7-9
ISBN 10 81-929742-7-8
Language English
Type Hard Bound - Printed Book
Copyrights ICIEMS Organizers / DCRC, London, UK
Editor-in-Chief Kokula Krishna Hari K
Conference Dates 13 - 14, August 2015
Venue Country IITM-RP, Chennai, India
Submitted Papers 410
Acceptance Rate 4.11%
Website www.iciems.in

Paper 020


Mining Rare Itemset Based On Fp-Growth Algorithm

Mining Rare Itemset Based On Fp-Growth Algorithm

A Jalpa A Varsur1, Nikul G Virpariya2

1Student, M.E.(CSE), 2Assistant Professor, CSE Department, Gardi Vidyapith, Gujarat, India

Abstract

Frequent weighted itemset represent correlation frequently holding in data in which items may weight differently.However,in some contexts,e.g., when the need is to minimize a certain cost function,discovering rare data correlations is more interesting than mining frequent ones. Now a days, some uninteresting items are consider as important.which are appear very less in the database.It is known as Rare or infrequent item.Finding infrequent itemset is useful in many recent field like medical,web,cloud,market basket analysis etc,. for i.e.,in market basket analysis some set of items such as milk and bread customer buy frequently compared to milk and bread gold chain and ring are infrequent items.This paper takes the issue of discovering rare itemset in transaction dataset.

Author's Profile

A Jalpa A Varsur : Profile

Nikul G Virpariya : Profile

Cite this Article as Follows

A Jalpa A Varsur, Nikul G Virpariya. "Mining Rare Itemset Based On Fp-Growth Algorithm." International Conference on Information Engineering, Management and Security (2015): 121-128. Print.