Sciweavers

617 search results - page 2 / 124
» Patterns for decoupling data structures and algorithms
Sort
View
IDEAL
2003
Springer
13 years 11 months ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
FLAIRS
2000
13 years 7 months ago
Discovering Structural Patterns in Telecommunications Data
With the increasing amount and complexity of data being collected, there is an urgent need to create automated techniques for mining the data. In particular, data being generated ...
Andi Baritchi, Diane J. Cook, Lawrence B. Holder
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
13 years 10 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
SIGCSE
1998
ACM
102views Education» more  SIGCSE 1998»
13 years 10 months ago
Design patterns for data structures
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
Dung Nguyen
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 years 7 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan