Sciweavers

318 search results - page 35 / 64
» Efficient Mining of Generalized Negative Association Rules
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 29 days 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
PODS
1998
ACM
134views Database» more  PODS 1998»
13 years 12 months ago
A New Framework For Itemset Generation
The problem of finding association rules in a large database of sales transactions has been widely studied in the literature, We discuss some of the weaknessesof the large itemset...
Charu C. Aggarwal, Philip S. Yu
HICSS
2006
IEEE
138views Biometrics» more  HICSS 2006»
14 years 1 months ago
An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics
Finding frequent patterns from databases has been the most time consuming process in data mining tasks, like association rule mining. Frequent pattern mining in real-time is of in...
Rajanish Dass, Ambuj Mahanti
BMCBI
2007
166views more  BMCBI 2007»
13 years 7 months ago
PathFinder: mining signal transduction pathway segments from protein-protein interaction networks
Background: A Signal transduction pathway is the chain of processes by which a cell converts an extracellular signal into a response. In most unicellular organisms, the number of ...
Gürkan Bebek, Jiong Yang
KDD
1997
ACM
154views Data Mining» more  KDD 1997»
13 years 11 months ago
Autonomous Discovery of Reliable Exception Rules
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
Einoshin Suzuki