In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm consists of two phases. First, we scan the database once to find the frequent items. For each frequent item found, the ICMiner converts the original transaction database into a set of domain attributes, called a dataset....

In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent intertransaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, calle...

In the research, it is aimed to measure the impact of outsourcing, which appears as a case of extremely critical within today's rapidly changing environmental conditions and brutal competitive conditions on the transaction costs of organizations and resources dependencies, on the businesses operating in Konya Organized Industrial Zone, in Turkey and to detect the relationship between these conc...

A transaction-based recommender system (TBRS) aims to predict the next item by modeling dependencies in transactional data. Generally, two kinds of considered are intra-transaction dependence and inter-transaction dependence. Most existing TBRSs recommend only within current transaction while ignoring with recent transactions that may also affect item. However, as not all relevant items, ones s...

Existing algorithms for high-utility itemsets mining are column enumeration based, adopting an Apriorilike candidate set generation-and-test approach, and thus are inadequate in datasets with high dimensions or long patterns. To solve the problem, this paper proposed a hybrid model and a row enumerationbased algorithm, i.e., Inter-transaction, to discover high-utility itemsets from two directio...

Understanding the runtime behavior and dependencies between components in complex transaction-based enterprise systems enables the system administrators to identify performance bottlenecks, allocate resources, and detect failures. This paper introduces a novel method for extracting dependency information between system components at runtime by using delay injection on individual links and Fast ...

This paper presents an approach to improving database performance by combining parallelism of multiple independent transactions and parallelism of multiple sub-transactions within a transaction. An experimental prototype has been built that supports this combination of inter-and intra-transaction parallelism based on the framework of multi-level transaction management. A performance study for a...