Sciweavers

381 search results - page 1 / 77
» Approximate Matching of Hierarchical Data Using pq-Grams
Sort
View
VLDB
2005
ACM
104views Database» more  VLDB 2005»
13 years 9 months ago
Approximate Matching of Hierarchical Data Using pq-Grams
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
Nikolaus Augsten, Michael H. Böhlen, Johann G...
NN
2006
Springer
113views Neural Networks» more  NN 2006»
13 years 4 months ago
Large-scale data exploration with the hierarchically growing hyperbolic SOM
We introduce the Hierarchically Growing Hyperbolic Self-Organizing Map (H2 SOM) featuring two extensions of the HSOM (hyperbolic SOM): (i) a hierarchically growing variant that al...
Jörg Ontrup, Helge Ritter
ALGORITHMICA
2008
71views more  ALGORITHMICA 2008»
13 years 3 months ago
Improved Approximate String Matching Using Compressed Suffix Data Structures
Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong
DAGSTUHL
2010
13 years 5 months ago
On Curved Simplicial Elements and Best Quadratic Spline Approximation for Hierarchical Data Representation
We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over two- or three-dimensional ...
Bernd Hamann
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 4 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo