Sciweavers

851 search results - page 114 / 171
» On the Complexity of Mining Association Rules
Sort
View
MIE
2008
150views Healthcare» more  MIE 2008»
13 years 10 months ago
Mining for Adverse Drug Events with Formal Concept Analysis
: The pharmacovigilance databases consist of several case reports involving drugs and adverse events (AEs). Some methods are applied consistently to highlight all signals, i.e. all...
Alexander Estacio-Moreno, Yannick Toussaint, C&eac...
DAWAK
2005
Springer
14 years 2 months ago
Processing Sequential Patterns in Relational Databases
Database integration of data mining has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind specia...
Xuequn Shang, Kai-Uwe Sattler
CIKM
2001
Springer
14 years 10 days ago
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...
Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 1 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
14 years 1 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov