AN EFFICIENT ALGORITHM FOR MINING HIGH UTILITY RARE ITEMSETS OVER UNCERTAIN DATABASES

Abstract

In modern era, due to the broad applications of uncertain data, mining itemsets over uncertain databases has paying much more attention. Association Rule Mining (ARM) is a well known and most popular technique of Data Mining. It identifies itemsets from the dataset which appears frequently and generates association rules. This is the procedure which is followed by the traditional ARM it does not consider the utility of an itemsets. In real-world applications such as retail marketing, medical diagnosis, client segmentation etc., utility of itemsets is varied on various constraints such as based on cost, profit or revenue. Utility Mining intend to discover itemsets with their utilities by considering profit, quantity, cost or other user preferences.[22]High-utility itemset mining (HUIM) has thus emerged as an important research topic in data mining. But most HUIM algorithms only handle precise data, even though big data collected in reallife applications using experimental measurements or noisy sensors is often uncertain. High-Utility Rare Itemset (HURI) mining finds itemsets from a database which have their utility no less than a given minimum utility threshold and have their support less than a given frequency threshold. Identifying high-utility rare itemsets from a database can help in better business decision making by highlighting the rare itemsets which give high profits so that they can be marketed more to earn good profit. Koh and Rountree (2005) proposed a modified apriori inverse algorithm to generate rare itemsets of user interest. In this paper we propose an efficient algorithm named Mining High Utility Rare Itemsts over Uncertain Database (HURIU) .This novel approach uses the concept of apriori inverse over uncertain databases. This paper will also give the new version or extension of the algorithm HURI proposed by Jyothi et al. The implementation of an algorithm for the analysis is done on JDK 6.1 and referred the sample dataset presented by Lan Y.et al,2015[15] for uncertain database.

Authors and Affiliations

S. ZANZOTE NINORIA AND S. S. THAKUR

Keywords

Related Articles

THE MECHANISMS OF ADAPTING THE PEDAGOGICAL CONTENT TO THE LEARNER'S PROFILE IN A DYNAMIC CEHL ENVIRONMENT

Building quality educational resources with new technologies requires offering learners and teachers a simple computing environment that would be adapted and would allow it to use its pedagogy in respondent contents of...

TIME TO MODIFY OPERATING SOFTWARE (OS), DATABASES (DB) AND TCP/IP PROTOCOLS FOR DATA TRASH ELIMINATION, BASED ON USER DEFINED SHELF LIFE OF DATA.

Exponentially growing data, big data, dark data and data trash are throwing excellent opportunities in the world. But associated costs and risks are also significant. “Big Garbage in, Big Garbage out” seems new phrase...

ACR: APPLICATION AWARE CACHE REPLACEMENT FOR SHARED CACHES IN MULTI-CORE SYSTEMS

Modern multi-core systems allow concurrent execution of different applications on a single chip. Such multicores handle the large bandwidth requirement from the processing cores by employing multiple levels of caches w...

AN APPROACH FOR PREDICTION OF CROP YIELD USING MACHINE LEARNING AND BIG DATA TECHNIQUES

Agriculture is the primary source of livelihood which forms the backbone of our country. Current challenges of water shortages, uncontrolled cost due to demand-supply, and weather uncertainty necessitate farmers to be...

DIABETES CLASSIFICATION AND PREDICTION USING ARTIFICIAL NEURAL NETWORK

The classification of data is an important field of data mining comes under supervised learning. In this approach classifier is trained on the pre-categorized data thereafter tested on unseen part called test data to e...

Download PDF file
  • EP ID EP46539
  • DOI 10.34218/IJCET.10.2.2019.012
  • Views 193
  • Downloads 0

How To Cite

S. ZANZOTE NINORIA AND S. S. THAKUR (2019). AN EFFICIENT ALGORITHM FOR MINING HIGH UTILITY RARE ITEMSETS OVER UNCERTAIN DATABASES. International Journal of Computer Engineering & Technology (IJCET), 10(2), -. https://europub.co.uk/articles/-A-46539