AN EFFICIENT ALGORITHM FOR MINING HIGH UTILITY RARE ITEMSETS OVER UNCERTAIN DATABASES
Journal Title: International Journal of Computer Engineering & Technology (IJCET) - Year 2019, Vol 10, Issue 2
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
- EP ID EP46539
- DOI 10.34218/IJCET.10.2.2019.012
- Views 204
- Downloads 0
FORESTALLING GROWTH RATE IN TYPE II DIABETIC PATIENTS USING DATA MINING AND ARTIFICIAL NEURAL NETWORKS: AN INTENSE SURVEY
The race for urbanization and thirst for high living status leads to unhealthy life. As the result a rapid growth in number of diabetic patients in urban areas approaching to its deadline. In this situation it become a...
BREAST CANCER DETECTION USING ANN NETWORK AND PERFORMANCE ANALYSIS WITH SVM
According to the World Health Organization (WHO) breast cancer is the major reason of death among women and its impact on women is 2.1 million per year. Only in 2018 approximately 15% (62700) of women are died due to b...
AN APPROACH FOR PREDICATION OF COMPLICATIONS WOMEN FIGHTS DURING MATERNAL PERIOD
Pregnancy and motherhood are natural processes in the lives of women. One of the great feelings for every woman is begin a Mother, but maternal period is very much susceptible for health issues. Some old illnesses may...
GPU BASED TOOLBOX FOR FUZZY LOGIC SYSTEM USING WHALE OPTIMIZATION ALGORITHM
Fuzzy Logic System (FLS) is an efficient method to solve engineering problems. However, the training of a Fuzzy Logic System is a time-consuming task. Optimization Algorithm can be used to optimize the rule base of any...
MULTIPLE KERNEL FUZZY CLUSTERING FOR UNCERTAIN DATA CLASSIFICATION
Traditional1call tree classifiers work1with information whose values1area unitcelebrated and precise. We1have a tendency to extend1such classifiers to handle information1with unsureinfo. Worth uncertainty1arises in sev...