In this paper, for noetherian commutative ring with a unit A such that every finitely generated A-module is free, and for a certain A-regular sequence f1, · · · , fp, we define Kos(A; f1, · · · , fp) the category of Koszul cubes associated to f1, · · · , fp which has a natural Waldhausen categorical structure. We also give a new algorithm of resolution process of modules by Koszul cubes. By the...

Vertical mining methods are very effective for mining frequent patterns and usually outperform horizontal mining methods. However, the vertical methods become ineffective since the intersection time starts to be costly when the cardinality of tidset (tid-list or diffset) is very large or there are a very large number of transactions. In this paper, we propose a novel vertical algorithm called P...

Mining association rule is an important matter in data mining, in which mining maximum frequent patterns is a key problem. Many of the previous algorithms mine maximum frequent patterns by producing candidate patterns firstly, then pruning. But the cost of producing candidate patterns is very high, especially when there exists long patterns. In this paper, the structure of a FP-tree is improved...

In recent years, graph representations have been used extensively for modelling complicated structural information, such as circuits, images, molecular structures, biological networks, weblogs, XML documents and so on. As a result, frequent subgraph mining has become an important subfield of graph mining. This paper presents a novel Frequent Pattern Graph Mining algorithm, FP-GraphMiner, that c...

ion level fp-rate fn-rate fp-rate treshold Figure 3.2: The generalization steps when mining fp-safe patterns with Algorithm 1. Blue dots represent maximal patterns, gray dots are infrequent (too generic) patterns, white dots are frequent, but not maximal patterns. Arrows depict the generalization DAG of the seed patterns, where solid ones show the actual search tree and dashed ones the edges th...

Frequent itemset mining in uncertain transaction databases semantically and computationally di ers from traditional techniques applied on standard (certain) transaction databases. Uncertain transaction databases consist of sets of existentially uncertain items. The uncertainty of items in transactions makes traditional techniques inapplicable. In this paper, we tackle the problem of nding proba...

Frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied on standard (certain) transaction databases. Uncertain transaction databases consist of sets of existentially uncertain items. The uncertainty of items in transactions makes traditional techniques inapplicable. In this paper, we tackle the problem of finding pr...

Femoropopliteal (FP) artery-in stent restenosis (ISR) is a daunting management problem that we continue to face. FP artery-ISR rates after primary stent implantation are relatively high. Although repeat FP artery-ISR and the need for additional interventions remain all too common, little consensus exists regarding the best treatment algorithm. In this article, we review the limitations of the c...