Sciweavers

338 search results - page 13 / 68
» A clustering method based on path similarities of XML data
Sort
View
107
Voted
ICCV
2007
IEEE
15 years 6 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
88
Voted
ICDM
2005
IEEE
138views Data Mining» more  ICDM 2005»
15 years 6 months ago
Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values
Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points which are not sampled will not have t...
Hung-Leng Chen, Kun-Ta Chuang, Ming-Syan Chen
IDEAS
2006
IEEE
146views Database» more  IDEAS 2006»
15 years 6 months ago
Trajectory Similarity Search in Spatial Networks
In several applications, data objects are assumed to move on predefined spatial networks such as road segments, railways, invisible air routes. Moving objects may exhibit similar...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
77
Voted
ACL
1993
15 years 1 months ago
Contextual Word Similarity and Estimation from Sparse Data
In recent years there is much interest in word cooccurrence relations, such as n-grams, verb-object combinations, or cooccurrence within a limited context. This paper discusses ho...
Ido Dagan, Shaul Marcus, Shaul Markovitch
97
Voted
ICTAI
2005
IEEE
15 years 6 months ago
Cellular Ants: Combining Ant-Based Clustering with Cellular Automata
This paper proposes a novel data clustering algorithm, coined ‘cellular ants’, which combines principles of cellular automata and ant colony optimization algorithms to group s...
Andrew Vande Moere, Justin James Clayden