Results 251 to 260 of about 648,662 (306)

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

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   +1 more source

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   +1 more source

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

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   +1 more source

The Studies of Mining Frequent Patterns Based on Frequent Pattern Tree

2009
Mining frequent patterns is to discover the groups of items appearing always together excess of a user specified threshold. Many approaches have been proposed for mining frequent pattern. However, either the search space or memory space is huge, such that the performance for the previous approach degrades when the database is massive or the threshold ...
Show-Jane Yen, Yue-Shi Lee, Chiu-Kuang Wang, Jung-Wei Wu, Liang-Yuh Ouyang   +4 more
openaire   +1 more source

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   +1 more source

Frequent Pattern Mining Algorithms for Finding Associated Frequent Patterns for Data Streams: A Survey [PDF]

Procedia Computer Science, 2014
Pattern recognition is seen as a major challenge within the field of data mining and knowledge discovery. For thework in this paper, we have analyzed a range of widely used algorithms for finding frequent patterns with thepurpose of discovering how these
Muhammad Awais Azam, Usman Naeem, Mustansar Ali Ghazanfar   +2 more
exaly   +1 more source

Discovering frequent pattern pairs

Intelligent Data Analysis, 2013
Cubes and association rules discover frequent patterns in a data set, most of which are not significant. Thus previous research has introduced search constraints and statistical metrics to discover significant patterns and reduce processing time. We introduce cube pairs (comparing cube groups based on a parametric statistical test) and rule pairs ...
Carlos Ordonez 0001, Zhibo Chen 0002
openaire   +1 more source

Approximate mining of frequent patterns on streams [PDF]

Intelligent Data Analysis, 2007
Many critical applications, like intrusion detection or stock market analysis, require a nearly immediate result based on a continuous and infinite stream of data. In most cases finding an exact solution is not compatible with limited availability of resources and real time constraints, but an approximation of the exact result is enough for most ...
SILVESTRI, Claudio, ORLANDO, Salvatore
openaire   +5 more sources