Relevant Tiws Pattern Mining With Reduced Search Space
نویسندگان
چکیده
منابع مشابه
Fast Discovery of Relevant Subgroups using a Reduced Search Space
We consider a modified version of the local pattern discovery task of subgroup discovery, where subgroups dominated by other subgroups are discarded. The advantage of this modified task, known as relevant subgroup discovery, is that it avoids redundancy in the outcome. Although it was considered in many applications, so far no efficient and exact algorithm for this task has been proposed. One p...
متن کاملA Search Space Reduced Algorithm for Mining Frequent Patterns
Mining frequent patterns is to discover the groups of items appearing always together excess of a user specified threshold. Many approaches have been proposed for mining frequent patterns by applying the FP-tree structure to improve the efficiency of the FP-Growth algorithm which needs to recursively construct sub-trees. Although these approaches do not need to recursively construct many sub-tr...
متن کاملConstraining the Search Space in Temporal Pattern Mining
Agents in dynamic environments have to deal with complex situations including various temporal interrelations of actions and events. Discovering frequent patterns in such scenes can be useful in order to create prediction rules which can be used to predict future activities or situations. We present the algorithm MiTemP which learns frequent patterns based on a time intervalbased relational rep...
متن کاملSoftware Design Pattern & Mining Approach – A Novel Query Search Analysis to Identify Relevant Information
Design pattern is a reusable module to improve the problem and defines solution among all those methods techniques & algorithms to choose the best one then applies for our requirement. When designing a system or end product usually need to control how an object is used and prevent users from making copies of it or creating new instances. Design pattern are used in object oriented programming la...
متن کاملGraph Pattern Mining, Search and OLAP
The existing studies are mostly focused on the multiple graphs scenario. With some modifications, the mining methodology can be extended to the single graph scenario [30]. Washio and Motoda [56] conducted a survey on graph-based data mining. Holder et al. [21] proposed SUBDUE to do subgraph pattern discovery based on minimum description length and background knowledge. The most popular graph pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Computer Engineering
سال: 2013
ISSN: 2278-8727,2278-0661
DOI: 10.9790/0661-0964752