617 search results - page 56 / 124 » Patterns for decoupling data structures and algorithms |
GRC
2008
IEEE
13 years 8 months ago
2008
IEEE
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
ICDM
2002
IEEE
14 years 17 days ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
PRL
2006
13 years 7 months ago
2006
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...