Results 241 to 250 of about 4,248,745 (299)

Energy drinks consumption and biochemical changes in liver and kidney function: A comparative cross-sectional study among university students. [PDF]

J Public Health Res
Hindi I, Farounyeh Z, Suboh D, Dweikat T, Naghnaghia S, Mousa A, Nazzal Z.   +6 more
europepmc   +1 more source

Frequent Patterns that Compress

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

Mining Frequent Ordered Patterns

, 2005
Mining frequent patterns has been studied popularly in data mining research. All of previous studies assume that items in a pattern are unordered. However, the order existing between items must be considered in some applications. In this paper, we first give the formal model of ordered patterns and discuss the problem of mining frequent ordered ...
Zhi-Hong Deng 0001, Cong-Rui Ji, Ming Zhang 0004, Shi-Wei Tang   +3 more
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   +3 more sources

Mining frequent patterns and association rules using similarities [PDF]

Expert Systems With Applications, 2013
Most of the current algorithms for mining association rules assume that two object subdescriptions are similar when they are exactly equal, but in many real world problems some other similarity functions are used. Commonly these algorithms are divided in
José Francisco Martínez-Trinidad, Ansel Y. Rodríguez-González, Jesus Ariel Carrasco-Ochoa   +2 more
exaly   +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