Sciweavers

Share
732 search results - page 1 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
LWA
2004
12 years 3 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
ADC
2003
Springer
182views Database» more  ADC 2003»
12 years 7 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
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
12 years 3 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
ADMA
2008
Springer
147views Data Mining» more  ADMA 2008»
12 years 8 months ago
Mining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Ro...
ICDE
2002
IEEE
92views Database» more  ICDE 2002»
13 years 3 months ago
Efficient Indexing Structures for Mining Frequent Patterns
Bin Lan, Beng Chin Ooi, Kian-Lee Tan
books