loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: R. Uday Kiran and P. Krishna Reddy

Affiliation: International Institute of Information Technology-Hyderabad, India

Keyword(s): Data mining, Rare knowledge patterns, Rare association rules, Frequent patterns.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Data Mining in Electronic Commerce ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Symbolic Systems

Abstract: In this paper we have proposed an improved approach to extract rare association rules. The association rules which involve rare items are called rare association rules. Mining rare association rules is difficult with single minimum support (minsup) based approaches like Apriori and FP-growth as they suffer from “rare item problem” dilemma. At high minsup, frequent patterns involving rare items will be missed and at low minsup, the number of frequent patterns explodes. To address “rare item problem”, efforts have been made in the literature by extending the “multiple minimum support” framework to both Apriori and FP-growth approaches. The approaches proposed by extending “multiple minimum support” framework to Apriori require multiple scans on the dataset and generate huge number of candidate patterns. The approach proposed by extending the “multiple minimum support” framework to FP-growth is relatively efficient than Apriori based approaches, but suffers from performance problems. In this paper, we have proposed an improved multiple minimum support based FP-growth approach by exploiting the notions such as “least minimum support” and “infrequent leaf node pruning”. Experimental results on both synthetic and real world datasets show that the proposed approach improves the performance over existing approaches. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.138.175.10

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Uday Kiran, R. and Krishna Reddy, P. (2009). AN IMPROVED FREQUENT PATTERN-GROWTH APPROACH TO DISCOVER RARE ASSOCIATION RULES. In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (IC3K 2009) - KDIR; ISBN 978-989-674-011-5; ISSN 2184-3228, SciTePress, pages 43-52. DOI: 10.5220/0002299600430052

@conference{kdir09,
author={R. {Uday Kiran}. and P. {Krishna Reddy}.},
title={AN IMPROVED FREQUENT PATTERN-GROWTH APPROACH TO DISCOVER RARE ASSOCIATION RULES},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (IC3K 2009) - KDIR},
year={2009},
pages={43-52},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002299600430052},
isbn={978-989-674-011-5},
issn={2184-3228},
}

TY - CONF

JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (IC3K 2009) - KDIR
TI - AN IMPROVED FREQUENT PATTERN-GROWTH APPROACH TO DISCOVER RARE ASSOCIATION RULES
SN - 978-989-674-011-5
IS - 2184-3228
AU - Uday Kiran, R.
AU - Krishna Reddy, P.
PY - 2009
SP - 43
EP - 52
DO - 10.5220/0002299600430052
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic