Ordering policy estimation for high utility item-sets considering negative item values in large databases

2022 ◽  
Vol 14 (1) ◽  
pp. 0-0
Keyword(s):  
Data Mining ◽  
Real World ◽  
Defective Items ◽  
Utility Mining ◽  
Mining Algorithm ◽  
Negative Item ◽  
Ordering Policy ◽  
Large Databases ◽  
Real World Applications ◽  
High Utility

Utility mining with negative item values has recently received interest in the data mining field due to its practical considerations. Previously, the values of utility item-sets have been taken into consideration as positive. However, in real-world applications an item-set may be related to negative item values. This paper presents a method for redesigning the ordering policy by including high utility item-sets with negative items. Initially, utility mining algorithm is used to find high utility item-sets. Then, ordering policy is estimated for high utility items considering defective and non-defective items. A numerical example is illustrated to validate the results

scholarly journals Effective Application of Improved Profit-Mining Algorithm for the Interday Trading Model

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Yu-Lung Hsieh ◽  
Don-Lin Yang ◽  
Jungpin Wu
Keyword(s):  
Financial Markets ◽  
Real World ◽  
Traditional Approach ◽  
Rule Mining ◽  
Mining Algorithm ◽  
Large Databases ◽  
Real World Applications ◽  
Trading Model ◽  
Mining Algorithms ◽  
Infant Stage

Many real world applications of association rule mining from large databases help users make better decisions. However, they do not work well in financial markets at this time. In addition to a high profit, an investor also looks for a low risk trading with a better rate of winning. The traditional approach of using minimum confidence and support thresholds needs to be changed. Based on an interday model of trading, we proposed effective profit-mining algorithms which provide investors with profit rules including information about profit, risk, and winning rate. Since profit-mining in the financial market is still in its infant stage, it is important to detail the inner working of mining algorithms and illustrate the best way to apply them. In this paper we go into details of our improved profit-mining algorithm and showcase effective applications with experiments using real world trading data. The results show that our approach is practical and effective with good performance for various datasets.

A FUZZY DATA MINING ALGORITHM FOR INCREMENTAL MINING OF QUANTITATIVE SEQUENTIAL PATTERNS

2005 ◽  
Vol 13 (06) ◽  
pp. 633-652 ◽  
Author(s):  
R. B. V. SUBRAMANYAM ◽  
A. GOSWAMI
Keyword(s):  
Data Mining ◽  
Real World ◽  
Uncertain Data ◽  
Sequential Patterns ◽  
Data Mining Algorithm ◽  
Fuzzy Data ◽  
Incremental Mining ◽  
Data Mining Algorithms ◽  
Mining Algorithm ◽  
Real World Applications

In real world applications, the databases are constantly added with a large number of transactions and hence maintaining latest sequential patterns valid on the updated database is crucial. Existing data mining algorithms can incrementally mine the sequential patterns from databases with binary values. Temporal transactions with quantitative values are commonly seen in real world applications. In addition, several methods have been proposed for representing uncertain data in a database. In this paper, a fuzzy data mining algorithm for incremental mining of sequential patterns from quantitative databases is proposed. Proposed algorithm called IQSP algorithm uses the fuzzy grid notion to generate fuzzy sequential patterns validated on the updated database containing the transactions in the original database and in the incremental database. It uses the information about sequential patterns that are already mined from original database and avoids start-from-scratch process. Also, it minimizes the number of candidates to check as well as number of scans to original database by identifying the potential sequences in incremental database.

Maintenance of Association Rules Using Pre-Large Itemsets

2011 ◽  
pp. 44-60 ◽  
Author(s):  
Tzung-Pei Hong ◽  
Ching-Yao Wang
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Real World ◽  
Incremental Mining ◽  
Maintenance Costs ◽  
The Past ◽  
Mining Algorithm ◽  
Real World Applications ◽  
Novel Algorithm

Developing an efficient mining algorithm that can incrementally maintain discovered information as a database grows is quite important in the field of data mining. In the past, we proposed an incremental mining algorithm for maintenance of association rules as new transactions were inserted. Deletion of records in databases is, however, commonly seen in real-world applications. In this chapter, we first review the maintenance of association rules from data insertion and then attempt to extend it to solve the data deletion issue. The concept of pre-large itemsets is used to reduce the need for rescanning the original database and to save maintenance costs. A novel algorithm is proposed to maintain discovered association rules for deletion of records. The proposed algorithm doesn’t need to rescan the original database until a number of records have been deleted. If the database is large, then the number of deleted records allowed will be large too. Therefore, as the database grows, our proposed approach becomes increasingly efficient. This characteristic is especially useful for real-world applications.

scholarly journals An Incremental High-Utility Mining Algorithm with Transaction Insertion

2015 ◽  
Vol 2015 ◽  
pp. 1-15 ◽  
Author(s):  
Jerry Chun-Wei Lin ◽  
Wensheng Gan ◽  
Tzung-Pei Hong ◽  
Binbin Zhang
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Incremental Algorithm ◽  
Rule Mining ◽  
Utility Mining ◽  
Real World Applications ◽  
Enumeration Tree ◽  
Speed Up ◽  
High Utility ◽  
Very Large Database

Association-rule mining is commonly used to discover useful and meaningful patterns from a very large database. It only considers the occurrence frequencies of items to reveal the relationships among itemsets. Traditional association-rule mining is, however, not suitable in real-world applications since the purchased items from a customer may have various factors, such as profit or quantity. High-utility mining was designed to solve the limitations of association-rule mining by considering both the quantity and profit measures. Most algorithms of high-utility mining are designed to handle the static database. Fewer researches handle the dynamic high-utility mining with transaction insertion, thus requiring the computations of database rescan and combination explosion of pattern-growth mechanism. In this paper, an efficient incremental algorithm with transaction insertion is designed to reduce computations without candidate generation based on the utility-list structures. The enumeration tree and the relationships between 2-itemsets are also adopted in the proposed algorithm to speed up the computations. Several experiments are conducted to show the performance of the proposed algorithm in terms of runtime, memory consumption, and number of generated patterns.

PROVIDING TIMELY UPDATED SEQUENTIAL PATTERNS IN DECISION MAKING

2010 ◽  
Vol 09 (06) ◽  
pp. 873-888 ◽  
Author(s):  
TZUNG-PEI HONG ◽  
CHING-YAO WANG ◽  
CHUN-WEI LIN
Keyword(s):  
Decision Making ◽  
Real Time ◽  
Real World ◽  
Experimental Results ◽  
Sequential Patterns ◽  
The Past ◽  
Large Databases ◽  
Real World Applications ◽  
Critical Task ◽  
Maintenance Process

Mining knowledge from large databases has become a critical task for organizations. Managers commonly use the obtained sequential patterns to make decisions. In the past, databases were usually assumed to be static. In real-world applications, however, transactions may be updated. In this paper, a maintenance algorithm for rapidly updating sequential patterns for real-time decision making is proposed. The proposed algorithm utilizes previously discovered large sequences in the maintenance process, thus greatly reducing the number of database rescans and improving performance. Experimental results verify the performance of the proposed approach. The proposed algorithm provides real-time knowledge that can be used for decision making.

scholarly journals HIGH UTILITY ITEM INTERVAL SEQUENTIAL PATTERN MINING ALGORITHM

2020 ◽  
Vol 36 (1) ◽  
pp. 1-15
Author(s):  
Tran Huy Duong ◽  
Nguyen Truong Thang ◽  
Vu Duc Thi ◽  
Tran The Anh
Keyword(s):  
Data Mining ◽  
Pattern Mining ◽  
Sequential Pattern Mining ◽  
Sequential Pattern ◽  
Sequential Patterns ◽  
Sequence Database ◽  
Mining Algorithm ◽  
Pattern Growth ◽  
High Utility ◽  
Growth Approach

High utility sequential pattern mining is a popular topic in data mining with the main purpose is to extract sequential patterns with high utility in the sequence database. Many recent works have proposed methods to solve this problem. However, most of them does not consider item intervals of sequential patterns which can lead to the extraction of sequential patterns with too long item interval, thus making little sense. In this paper, we propose a High Utility Item Interval Sequential Pattern (HUISP) algorithm to solve this problem. Our algorithm uses pattern growth approach and some techniques to increase algorithm's performance.

Incremental Updates of Discovered Multi-Level Association Rules

1997 ◽  
Vol 06 (02) ◽  
pp. 273-290 ◽  
Author(s):  
David W. Cheung ◽  
Vincent T. Ng ◽  
Benjamin W. Tam
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Efficient Algorithm ◽  
Cost Effective ◽  
Incremental Algorithm ◽  
Superior Performance ◽  
Performance Study ◽  
Mining Algorithm ◽  
Large Databases ◽  
Multi Level

Update of the single- and multi-level association rules discovered in large databases is inherently costly. The straight forward approach of re-running the discovery algorithm on the entire updated database to re-discover the association rules is not cost-effective. An incremental algorithm FUP have been proposed for the update of discovered single-level association rules. In this study, we have shown that the incremental technique in FUP can be generalized to other data mining systems. An efficient algorithm MLUp has been proposed for the updating of discovered multi-level association rules. Our performance study shows that MLUp has a superior performance over the representative mining algorithm such as ML-T2 in updating discovered multi-level association rules.

Sign in / Sign up

Export Citation Format

Share Document