Abstract This paper mainly studies the discount data of department store members. The researsh shows that total supply discounted goods and number reward points issued have most significant relationship with customer activation rate, increase rate coverage scale would inactive members invalid score may a stronger incentive effect on active members, but it has no obvious ineffective In addition,...

The rapid development of computer information technology has made various fault diagnosis and detection technologies emerge in an endless stream. As one the main transportation vehicles, efficiency railway signal equipment important practical significance for maintaining overall safe operation railways. On basis traditional FP-Growth algorithm, improve TF-IDF algorithm to realize weight discret...

Mining high utility itemsets from a transactional database refers to the discovery of itemsets with high utility like profits. Frequent itemset mining (FIM) is one of the most fundamental problems in data mining. In this work, we propose a novel strategy based on the analysis of item co-occurrences to reduce the number of join operations that need to be performed (FHM: Faster High-Utility Miner...

The credit derivatives market has experienced remarkable growth over the past decade. As such, there is a growing interest in tools for pricing of the most prominent credit derivative, the credit default swap (CDS). In this paper, we propose a heuristic algorithm for pricing of basket default swaps (BDS). For this purpose, genetic network programming (GNP), which is one of the recent evolutiona...

One of the most challenging tasks in association rule mining is that when a new incremental database added to an original database, some existing frequent itemsets may become infrequent and vice versa. As result, previous rules invalid emerge. We designed new, more efficient approach for using Fast Incremental Updating Frequent Pattern growth algorithm (FIUFP-Growth), Conditional tree (ICP-tree...

Purpose: Improve the accuracy and speed of the region-growth algorithm between two 2D images. Design/methodology/approach: The algorithm includes two parts: the selection of seeds points and propagation. Some improvements are made in each one. For the first part, the best-first strategy is used to assure the accuracy of seeds. The epipolar line constraint and continuity constraint reduce the do...

We propose a novel approach for mining recent frequent itemsets. The approach has three key contributions. First, it is a single-scan algorithm which utilizes the special property of suffix-trees to guarantee that all frequent itemsets are mined. During the phase of itemset growth it is unnecessary to traverse the suffix-trees which are the data structure for storing the summary information of ...