Sciweavers

985 search results - page 77 / 197
» An Experiment with Distance Measures for Clustering
Sort
View
GBRPR
2009
Springer
15 years 4 months ago
Graph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
Salim Jouili, Salvatore Tabbone
AIR
2006
76views more  AIR 2006»
14 years 10 months ago
Evolved term-weighting schemes in Information Retrieval: an analysis of the solution space
Evolutionary computation techniques are increasingly being applied to problems within Information Retrieval (IR). Genetic programming (GP) has previously been used with some succe...
Ronan Cummins, Colm O'Riordan
EDBT
2006
ACM
116views Database» more  EDBT 2006»
15 years 10 months ago
VICO: Visualizing Connected Object Orderings
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
Stefan Brecheisen, Hans-Peter Kriegel, Matthias Sc...
PKDD
2010
Springer
141views Data Mining» more  PKDD 2010»
14 years 7 months ago
On Detecting Clustered Anomalies Using SCiForest
Detecting local clustered anomalies is an intricate problem for many existing anomaly detection methods. Distance-based and density-based methods are inherently restricted by their...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
CIKM
2006
Springer
15 years 1 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...