Sciweavers

101 search results - page 1 / 21
» Efficiently Mining Frequent Patterns from Dense Datasets Usi...
Sort
View
AUSAI
2003
Springer
13 years 9 months ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
HICSS
2006
IEEE
138views Biometrics» more  HICSS 2006»
13 years 10 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
ADC
2003
Springer
182views Database» more  ADC 2003»
13 years 9 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
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 6 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
DKE
2006
126views more  DKE 2006»
13 years 4 months ago
FRACTURE mining: Mining frequently and concurrently mutating structures from historical XML documents
In the past few years, the fast proliferation of available XML documents has stimulated a great deal of interest in discovering hidden and nontrivial knowledge from XML repositori...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...