Finding minimal rare itemsets in a depth-first manner
نویسندگان
چکیده
Rare itemsets are an important sort of patterns that have a wide range of practical applications. Although mining rare patterns poses specific algorithmic problems, it is yet insufficiently studied. In a previous work, we proposed a levelwise approach for rare itemset mining. Here, we examine the benefits of depth-first methods for that task as such methods are known to outperform the levelwise ones in many practical cases.
منابع مشابه
Efficient Vertical Mining of Minimal Rare Itemsets
Rare itemsets are important sort of patterns that have a wide range of practical applications, in particular, in analysis of biomedical data. Although mining rare patterns poses specific algorithmic problems, it is yet insufficiently studied. In a previous work, we proposed a levelwise approach for rare itemset mining that traverses the search space bottomup and proceeds in two steps: (1) movin...
متن کاملOn Minimal Infrequent Itemset Mining
A new algorithm for minimal infrequent itemset mining is presented. Potential applications of finding infrequent itemsets include statistical disclosure risk assessment, bioinformatics, and fraud detection. This is the first algorithm designed specifically for finding these rare itemsets. Many itemset properties used implicitly in the algorithm are proved. The problem is shown to be NP-complete...
متن کاملThe Takeoff Towards Optimal Sorting Networks
A complete set of filters Fn for the optimal-depth n-input sorting network problem is such that if there exists an n-input sorting network of depth d then there exists one of the form C ⊕ C′ for some C ∈ Fn. Previous work on the topic presents a method for finding complete set of filters Rn,1 and Rn,2 that consists only of networks of depths one and two respectively, whose outputs are minimal a...
متن کاملAn Efficient Hybrid Algorithm for Mining Frequent Closures and Generators
The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, these two tasks are rarely combined. Most of the existing solutions apply levelwise breadth-first traversal, though depth-first traversal, depending on data characteristics, is often superior. Hence, we address here a hybrid algorithm th...
متن کاملFinding Minimal Rare Itemsets and Rare Association Rules
Rare association rules correspond to rare, or infrequent, itemsets, as opposed to frequent ones that are targeted by conventional pattern miners. Rare rules re ect regularities of local, rather than global, scope that can nevertheless provide valuable insights to an expert, especially in areas such as genetics and medical diagnosis where some speci c deviations/illnesses occur only in a small n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012