Sciweavers

4542 search results - page 224 / 909
» Design patterns for data structures
Sort
View
CSMR
2004
IEEE
15 years 10 months ago
Using History Information to Improve Design Flaws Detection
1 As systems evolve and their structure decays, maintainers need accurate and automatic identification of the design problems. Current approaches for automatic detection of design...
Daniel Ratiu, Stéphane Ducasse, Tudor G&ici...
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
16 years 11 days ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
AI
2003
Springer
15 years 11 months ago
Efficient Mining of Indirect Associations Using HI-Mine
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
ESOA
2006
15 years 10 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
GRC
2008
IEEE
15 years 7 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li