Reduced Overestimated Utility and Pruning Candidates using Incremental Mining
نویسندگان
چکیده
منابع مشابه
Incremental Reduced Error Pruning
This paper outlines some problems that may occur with Reduced Error Pruning in relational learning algorithms, most notably efficiency. Thereafter a new method, Incremental Reduced Error Pruning, is proposed that attempts to address all of these problems. Experiments show that in many noisy domains this method is much more efficient than alternative algorithms, along with a slight gain in accur...
متن کاملPruning and Exclusion Criteria for Unordered Incremental Reduced Error Pruning
Incremental reduced error pruning is a technique that has been extensively used for efficient induction of ordered rule sets (decision lists). Several criteria have been developed regarding how to prune rules and whether or not to exclude generated rules. A version of incremental reduced error pruning for unordered rule sets is presented, and the appropriateness of previously proposed criteria ...
متن کاملUtility of Ranking Warehouse Candidates in Workshop Locations Using UTAStar
Although the importance of locating in manufacturing and service companies is not a new issue, one of significance applications is to determine the appropriate location for warehouses in manufacturing workshops warehouses to the maintenance of materials or products. In any organizations, Finding the suitable site for warehouses establishments to increase customer service and efficiency is one o...
متن کاملFHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning
High utility itemset mining is a challenging task in frequent pattern mining, which has wide applications. The state-of-the-art algorithm is HUI-Miner. It adopts a vertical representation and performs a depth-first search to discover patterns and calculate their utility without performing costly database scans. Although, this approach is effective, mining high-utility itemsets remains computati...
متن کاملMaximizing the Area under the ROC Curve using Incremental Reduced Error Pruning
The use of incremental reduced error pruning for maximizing the area under the ROC curve (AUC) instead of accuracy is investigated. A commonly used accuracy-based exclusion criterion is shown to include rules that result in concave ROC curves as well as to exclude rules that result in convex ROC curves. A previously proposed exclusion criterion for unordered rule sets, based on the lift, is on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i48/107990