Results 201 to 210 of about 659,665 (262)

Frequent Patterns that Compress

, 2006
Bathoorn, R.W., Koopman, A.C.M., Siebes, A.P.J.M.   +2 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On compressing frequent patterns

Data & Knowledge Engineering, 2007
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness measure @d (called @d-cluster), and select a representative pattern for each cluster. The problem of finding a minimum set of representative patterns is shown NP-Hard.
Dong Xin, Jiawei Han 0001, Xifeng Yan, Hong Cheng 0001   +3 more
openaire   +2 more sources

Mining frequent patterns with the pattern tree

New Generation Computing, 2005
Mining frequent patterns with a frequent pattern tree (FP-tree in short) avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves much better performance and efficiency than Apriori-like algorithms. However, the database still needs to be scanned twice to get the FP-tree.
Hao Huang, Xindong Wu 0001, Richard Relue   +2 more
openaire   +2 more sources

Frequent Offenders and Patterns of Injury

Clinics in Liver Disease, 2020
Given the liver's role in drug metabolism, it is uniquely sensitive to potential drug-induced liver injury (DILI) despite inherent protective mechanisms. In this article, we focus on the most common causes of DILI and their patterns of injury. Although not comprehensive, we attempt to cover several classes of commonly used drugs, and their associated ...
Jinyu, Zhang, Deepak, Venkat
openaire   +2 more sources

Maintenance of Frequent Patterns

2009
This chapter surveys the maintenance of frequent patterns in transaction datasets. It is written to be accessible to researchers familiar with the field of frequent pattern mining. The frequent pattern maintenance problem is summarized with a study on how the space of frequent patterns evolves in response to data updates.
Feng, Mengling, Li, Jinyan, Dong, Guozhu, Wong, Limsoon   +3 more
openaire   +2 more sources

From path tree to frequent patterns: a framework for mining frequent patterns

2002 IEEE International Conference on Data Mining, 2002. Proceedings., 2003
We propose a framework for mining frequent patterns from large transactional databases. The core of the framework is a coded prefix-path tree with two representations, namely, a memory-based prefix-path tree and a disk-based prefix-path tree. The disk-based prefix-path tree is simple in its data structure yet rich in information contained, and is small
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu   +3 more
openaire   +2 more sources

Generating Frequent Patterns with the Frequent Pattern List

2001
The generation of frequent patterns (or frequent itemsets) has been studied in various areas of data mining. Most of the studies take the Apriori-based generation-and-test approach, which is computationally costly in the generation of candidate frequent patterns.
Fan-Chen Tseng, Ching-Chi Hsu
openaire   +2 more sources

Mining Frequent Independent Patterns and Frequent Correlated Patterns Synchronously

2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, 2008
One of the main tasks of KDTCM (knowledge discovery in Traditional Chinese Medicine) is discovering novel paired or grouped drugs in Chinese Medical Formula (CMF) database, which are special combinations of two or more drugs. Correlation mining is much effective because of the large number of correlation relationships among various kinds of drugs ...
openaire   +2 more sources