Rare Itemset Research Articles

Privacy preserving rare itemset mining

In recent years, rare pattern mining has shown great vitality in some real-world fields, such as disease diagnosis, criminal behavior analysis, anomaly detection in networks, and so on. When data organizations publish or share information publicly, shared data can be at risk of leakage as data mining techniques may discover sensitive knowledge and information. To keep competitors from obtaining hidden information after processing the database, privacy-preserving data mining (PPDM) has been proposed and studied widely. However, most of the techniques in PPDM are applied to frequent pattern mining and cannot deal with the privacy protection problems in rare pattern mining, such as network vulnerability detection and abnormal medical data. To address this limitation, we introduce a privacy-preserving technique for rare pattern mining. In this paper, two novel algorithms named Longest Transaction-Minimum Item Number (LT-MIN) and Longest Transaction-Maximum Item Number (LT-MAX) are proposed to hide sensitive rare itemsets and return the sanitized database. These two algorithms succeed in hiding target itemsets while minimizing the side effects on the original database. What's more, they employ a projection mechanism to reduce the time spent scanning the database. Besides using the traditional evaluation criteria in PPDM, we also propose two additional similarity measures to evaluate the performance from the perspective of the itemsets and the structural integrity of the database. The experimental results indicate that the proposed algorithms can hide sensitive rare itemsets successfully and efficiently, and the evaluation methods used can become the evaluation criteria for privacy-preserving rare itemset mining (PPRIM).

Context-based irregular activity detection in event logs for forensic investigations: An itemset mining approach

Event logs are a powerful source of digital evidence as they contain detailed information about activities performed on a computer. Forensic investigation of the event logs is a challenging and time-consuming task due to their large volume and continuous generation. A significant amount of time, effort, and knowledge is required to interpret their contents, discovering irregular events that are potentially pertinent to the investigation. As the number of digital investigations increases, so too must resources available to investigators. This requires new techniques to make the process easier and faster, reducing the burden on human investigators as well as being resource efficient. In this paper, a novel solution is presented to examine event logs and automatically identify irregular activities during forensic analysis. The proposed solution utilises a rare itemset mining approach to establish relationships among event entries, based on their contents. Following on, identified event relationships are ordered based on their temporal order to represent the timeline or sequence of activity. The solution is also capable of prioritising identified activities by calculating their degree of irregularity. The empirical analysis is performed on 15 live machines, and the results are discussed in terms of accuracy and performance metrics.

Seyrek Öğe Seti Madenciliği Kullanılarak Otomotiv Sektöründe Dişli Üretimi Duruşlarında Anomali Tespiti

Downtimes in manufacturing significantly influence productivity, and their analysis is necessary for successful and flexible production. Although some classification and regression studies have been performed on the machine downtime in the manufacturing area, the rare itemset mining (RIM) technique has never been implemented in the existing downtime studies until now. Besides, anomaly detection for gear manufacturing downtime in the automotive sector using RIM is yet to be explored. To bridge this gap, this study proposes the application of the RIM method for detecting anomalies in gear manufacturing downtime of earth moving machinery for the first time. In this study, the Rare Pattern Growth (RP-Growth) algorithm was executed on a real-world dataset consisting of downtimes in gear manufacturing of earth moving machinery to discover rare itemsets that indicate anomalies in downtimes. In the experiments, the rare itemsets (anomalies) in the downtime data were detected using different minimum support (minsup) and minimum rare support (minraresup) threshold values. The obtained results were also evaluated in terms of the number of itemsets, execution time, and maximum memory usage. The experimental results show that the proposed approach, called Anomaly Detection with Rare Itemset Mining (ADRIM), is an effective method for detecting anomalies in machine downtimes and can be successfully used in the manufacturing area, especially in the automotive sector.

ERIM: An ensemble of rare itemset mining and its application in the automotive industry

AbstractDiscovering previously unknown anomalies that are rare and dramatically differ from the majority of the data is a critical need for the automotive industry. Rare itemset mining (RIM), one of the pattern‐based methods, has been used for anomaly detection due to providing successful analysis results. However, several aspects still need to be explored, such as improving the mining process by identifying more targeted, valuable and reliable rare itemsets. Motivated by this fact, this study proposes a novel approach, named ensemble of rare itemset mining (ERIM), which investigates weak rare itemsets (WRIs) using different algorithms and aggregates these rules to obtain strong rare itemsets (SRIs). This study also combines four different RIM algorithms (Apriori Rare, Apriori Inverse, CORI and RP‐Growth) as base learners for the first time. The proposed ERIM approach is a general methodology that can be applied to any field, but, in this study, it was used in the automotive industry as a case study. In the experiments, ERIM was applied to a real‐world gear manufacturing dataset to discover anomalies in machine downtimes. The experimental results were evaluated in terms of the number of itemsets and the length of itemsets by giving some samples, as well. The results showed that the proposed ERIM approach gives more reliable common knowledge by jointly considering the relation between WRIs discovered by the base learners. The findings indicated that the proposed ERIM technique was successful in detecting anomalies whose support values are below 7.12. Furthermore, it is clear from the experimental results that the ERIM discovered the highest number of SRIs, 1403, each of which is a 3‐itemset. Finally, the results showed that our method performed 43.37% better on average than state‐of‐the‐art methods on the same dataset.

Cardiovascular disease detection from high utility rare rule mining

We propose a method to search rare cardiovascular disease symptom rules from historical health examination records according to its hazard ratio utility and further detect the disease given new medical record data. Further, we aim to assist both medical experts and patients by alerting the current symptoms and preparing the early treatments. In general, the proposed method first deals with the uncertainty of age and other continuous features using a fuzzy set. Next, we define the hazard ratio utility of each item set to assist the mining process. Based on the utility, we discover the rare cardiovascular disease patterns employing High Utility Rare Itemset Mining. At last, we add a prediction step to check the given health record data whether diagnosed cardiovascular. Subsequently, we can obtain rare symptoms of cardiovascular disease, which are later applied to detect the new related record data. The rare symptoms that are confirmed by their utility risk for cardiovascular disease can assist the medical experts' decision better than the common symptoms as it is often hard to be recognized at a glance. The proposed method evaluated on a public cardiovascular dataset. The experimental results showed that the generated rare cardiovascular disease patterns successfully applied to detect the cardiovascular given the symptoms data.

Dynamic Support Range based Rare Pattern Mining over Data Streams

Rare itemset mining is a relatively recent topic of study in data mining. In certain application domains, such as online banking transaction analysis, sensor data analysis, and stock market analysis, rare patterns are patterns with low support and high confidence that are extremely interesting when compared to frequent patterns. Numerous applications generate large amounts of continuous data streams. We require efficient algorithms capable of processing data streams in order to analyze them and find unique patterns. The strategies developed for static databases cannot be used to data streams. As a result, we require algorithms created expressly for data stream processing in order to extract critical unique patterns. Rare pattern mining is still in its infancy, with only a few ways available. To address this is developed the Dynamic Support Range-based Hybrid-Eclat Algorithm (DSRHEA), an Eclat-based technique for mining unique patterns from a data stream using bit-set vertical mining with two item-based optimizations. The detected patterns are kept in a prefix-based rare pattern tree that uses double hashing to maintain the unusual pattern in the data stream. Testing showed that the proposed method did well in terms of how long it took to run ,how many rare patterns it made and accuracy.

Rare Itemsets Selector with Association Rules for Revenue Analysis by Association Rare Itemset Rule Mining Approach

Background: Knowledge discovering rare itemsets mining, and association rules are significant in a transactional dataset. Be that as it may, rare association rules are now and again more intriguing than frequent association rules since rare rules indicate an unforeseen or obscure association. The utilization of rare itemsets mining with item selector is unavoidable and has turned into an emerging field of research; therefore, this subject has numerous challenges. Objective: To perform the revenue examination of the marketing sector by rare itemsets selector by threshold and time series-based prediction technique. Methods: This paper gives the revenue examination of marketing sector by rare itemsets selector by threshold and time series-based prediction technique. A new algorithm for locating the rare itemsets by Association Rare itemset Rule Mining (ARIRM) to produced rules then utility itemsets discover by the threshold. When the rare patterns are analyzed, the ARIMA model used to anticipate the revenue. Based on the investigation of rare showcasing data with rules of the mining space, this methodology uses a tree structure to learn the rare items. Results: The test results in the "K" transactions with high revenues discovered utilizing the proposed model contrasted with other existing procedures; this forecast procedure is helpful for upcoming transactions. Conclusion: Based on the investigation of rare showcasing data with rules of the mining space, this methodology uses a tree structure to learn the rare items.

FRI-miner: fuzzy rare itemset mining

Data mining is a widely used technology for various real-life applications of data analytics and is important to discover valuable association rules in transaction databases. Interesting itemset mining plays an important role in many real-life applications, such as market, e-commerce, finance, and medical treatment. To date, various data mining algorithms based on frequent patterns have been widely studied, but there are a few algorithms that focus on mining infrequent or rare patterns. In some cases, infrequent or rare itemsets and rare association rules also play an important role in real-life applications. In this paper, we introduce a novel fuzzy-based rare itemset mining algorithm called FRI-Miner, which discovers valuable and interesting fuzzy rare itemsets in a quantitative database by applying fuzzy theory with linguistic meaning. Additionally, FRI-Miner utilizes the fuzzy-list structure to store important information and applies several pruning strategies to reduce the search space. The experimental results show that the proposed FRI-Miner algorithm can discover fewer and more interesting itemsets by considering the quantitative value in reality. Moreover, it significantly outperforms state-of-the-art algorithms in terms of effectiveness (w.r.t. different types of derived patterns) and efficiency (w.r.t. running time and memory usage).

Modern Applications and Challenges for Rare Itemset Mining

Data mining is the process of extracting useful unknown knowledge from large datasets. Frequent itemset mining is the fundamental task of data mining that aims at discovering interesting itemsets that frequently appear together in a dataset. However, mining infrequent (rare) itemsets may be more interesting in many real-life applications such as predicting telecommunication equipment failures, genetics, medical diagnosis, or anomaly detection. In this paper, we survey up-to-date methods of rare itemset mining. The main goal of this survey is to provide a comprehensive overview of the state-of-the-art algorithms of rare itemset mining and its applications. The main contributions of this survey can be summarized as follows. In the first part, we define the task of rare itemset mining by explaining key concepts and terminology, motivation examples, and comparisons with underlying concepts. Then, we highlight the state-of-art methods for rare itemsets mining. Furthermore, we present variations of the task of rare itemset mining to discuss limitations of traditional rare itemset mining algorithms. After that, we highlight the fundamental applications of rare itemset mining. In the last, we point out research opportunities and challenges for rare itemset mining for future research.

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

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.

A survey of itemset mining

Itemset mining is an important subfield of data mining, which consists of discovering interesting and useful patterns in transaction databases. The traditional task of frequent itemset mining is to discover groups of items (itemsets) that appear frequently together in transactions made by customers. Although itemset mining was designed for market basket analysis, it can be viewed more generally as the task of discovering groups of attribute values frequently cooccurring in databases. Because of its numerous applications in domains such as bioinformatics, text mining, product recommendation, e‐learning, and web click stream analysis, itemset mining has become a popular research area. This study provides an up‐to‐date survey that can serve both as an introduction and as a guide to recent advances and opportunities in the field. The problem of frequent itemset mining and its applications are described. Moreover, main approaches and strategies to solve itemset mining problems are presented, as well as their characteristics are provided. Limitations of traditional frequent itemset mining approaches are also highlighted, and extensions of the task of itemset mining are presented such as high‐utility itemset mining, rare itemset mining, fuzzy itemset mining, and uncertain itemset mining. This study also discusses research opportunities and the relationship to other popular pattern mining problems, such as sequential pattern mining, episode mining, subgraph mining, and association rule mining. Main open‐source libraries of itemset mining implementations are also briefly presented.WIREs Data Mining Knowl Discov2017, 7:e1207. doi: 10.1002/widm.1207This article is categorized under:Algorithmic Development > Association RulesTechnologies > Association Rules

Rare Association Rule Mining: A Systematic Review

One of the indispensable tasks of data mining is the extraction of significant and meaningful association rules. Whereas the extraction of frequent patterns using association rule mining is an imperative field of research, the idea of generating patterns that do not appear frequently in a database has grabbed the attention of researchers in recent years. The infrequent items or more commonly known as the rare items represent unknown or unpredictable associations and are therefore more interesting than the frequent ones. This study aims to provide a broad systematic review of the area of rare association rule mining. In this paper, a methodical analysis of the rare itemset and rare rule generation techniques in static and dynamic environment is presented. This paper also attempts to feature the current status and future perspectives of rare association rule mining along with some major research challenges.

Mining Rare Itemsets from Weblog Data

Weblog is unstructured data and therefore mining relevant information from weblog is a very challenging task. Present study proposes a Rare Itemset Mining from Weblog Data (RIMWD) algorithm to extract rare itemset. Most of the algorithms follow a bottom-up strategy, but those strategies are only suitable for discovering frequent itemsets. In contrast RIMWD algorithm is a top–down breadth-first level-wise algorithm to identify all the rare itemsets and their subsets. RIMWD adopts power set lattice strategy and it is the top and bottom levels of the lattice that contains full set and empty set respectively. The proposed RIMWD algorithm was compared with the state-of-the-art algorithms for generating rare itemset.

Forecasting Unusual Infection of Patient used by Irregular Weighted Point Set

Mining association rule is a key issue in data mining. In any case, the standard models ignore the distinction among the exchanges, and the weighted association rule mining does not transform on databases with just binary attributes. Paper propose a novel continuous examples and execute a tree (FPtree) structure, which is an increased prefix-tree structure for securing compacted, discriminating data about examples, and make a fit FP-tree- based mining system, FP enhanced capacity algorithm is used, for mining the complete game plan of examples by illustration incessant development. Here in this paper handles the motivation behind making remarkable and weighted itemsets, i.e. rare weighted item set mining issue. The two novel brightness measures are proposed for figuring the infrequent weighted itemset mining issue. Also, the algorithm are handled which perform IWI which is more insignificant IWI mining. Moreover we utilized the rare itemset for choice based structure. The general issue of the start of reliable definite rules is troublesome for the grounds that hypothetically no inciting technique with no other person can promise the rightness of influenced theories. In this way this framework expects the disorder with the uncommon signs. Usage study demonstrates that proposed algorithm upgrades the structure which is successful and versatile for mining both long and short diagnostics rules. Structure upgrades aftereffects of foreseeing rare diseases of patient.

High Utility Rare Itemset Mining (HURI): An approach for extracting high-utility rare item sets

i-manager's Journal on Future Engineering and Technology, i-manager's Journal on Software Engineering, i-manager's Journal on Electrical Engineering, i-manager's Journal on Electronics Engineering, i-manager's Journal of Educational Technology, i-manager's Journal on Educational Psychology, i-manager's Journal on School Educational Technology, i-manager's Journal on English Language Teaching, i-manager's Journal on Mechanical Engineering, i-manager's Journal on Civil Engineering, i-manager's Journal on Embedded Systems, i-manager's Journal on Information Technology, i-manager's Journal on Structural Engineering, i-manager's Journal on Communication Engineering and Systems, i-manager's Journal on Wireless Communication Networks, i-manager's Journal on Instrumentation and Control Engineering, i-manager's Journal on Circuits and Systems, i-manager's Journal on Digital Signal Processing, i-manager's Journal on Power Systems Engineering, i-manager's Journal on Computer Science, i-manager's Journal on Material Science, i-manager's Journal on Cloud Computing, i-manager's Journal on Image Processing, i-manager's Journal on Mobile Applications and Technologies, i-manager's Journal on Pattern Recognition, i-manager's Journal on Mathematics, i-manager's Journal on Management, i-manager's Journal on Nursing, i-manager's Journal on Physical Sciences, i-manager's Journal on Chemical Sciences, i-manager's Journal on Economics & Commerce , i-manager's Journal on Humanities & Social Sciences, i-manager's Journal on Life Sciences , i-manager's Journal on Construction Management, i-manager's Oyla , ,India best Journal Publication Website,World Best Plication SIte,Free atrticle published website,Journal Publised,Published Journal,Research Paper Published,indian research paper publications,how to published your article/research paper in india for free,journal’s instructions for authors

Mining Rare Itemset with Automated Support Thresholds

Problem statement: Frequent itemset mining is an important task in data mining to discover the hidden, interesting associations between items in the database based on the user-specified support and confidence thresholds. Approach: In order to find important associations, an appropriate support threshold has to be specified. The support threshold plays a key role in deciding the interesting itemsets. The rare itemsets may not found if a high threshold is set. Some uninteresting itemsets may appear if a low threshold is set. Results: This study proposes an approach to obtain the frequent itemsets involving rare items by setting the support thresholds automatically. Experimental results show that this approach produces rare and frequent itemsets in sparse and dense datasets. According to T20I6D100K, 97.76% of the FIs are generators wherein Mushrooms 1.38% of the FIs are the generators. Conclusion: The proposed algorithm produces both frequent and rare itemsets in an effective way. In future, computational efforts can still be reduced by implementing the algorithm as parallel algorithm.

Overview of Itemset Utility Mining and its Applications

An emerging topic in the field of data mining is Utility Mining. The main objective of Utility Mining is to identify the itemsets with highest utilities, by considering profit, quantity, cost or other user preferences. Mining High Utility itemsets from a transaction database is to find itemsets that have utility above a user-specified threshold. Itemset Utility Mining is an extension of Frequent Itemset mining, which discovers itemsets that occur frequently. In many real-life applications, high-utility itemsets consist of rare items. Rare itemsets provide useful information in different decision-making domains such as business transactions, medical, security, fraudulent transactions, retail communities. For example, in a supermarket, customers purchase microwave ovens or frying pans rarely as compared to bread, washing powder, soap. But the former transactions yield more profit for the supermarket. Similarly, the high-profit rare itemsets are found to be very useful in many application areas. For example, in medical application, the rare combination of symptoms can provide useful insights for doctors [21]. A retail business may be interested in identifying its most valuable customers i.e. who contribute a major fraction of overall company profit[10]. Several researches about itemset utility mining were proposed. In this paper, a literature survey of various algorithms for high utility rare itemset mining has been presented.

A Conceptual Approach to Temporal Rare Item set Utility Mining

A Conceptual Approach to Temporal Rare Item set Utility Mining