Sciweavers

133 search results - page 15 / 27
» The Extended Edit Distance Metric
Sort
View
IAAI
2003
13 years 8 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
ICPR
2008
IEEE
14 years 8 months ago
Geodesic K-means clustering
We introduce a class of geodesic distances and extend the K-means clustering algorithm to employ this distance metric. Empirically, we demonstrate that our geodesic K-means algori...
Arian Maleki, Nima Asgharbeygi
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
14 years 8 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
ICDM
2009
IEEE
154views Data Mining» more  ICDM 2009»
13 years 5 months ago
GSML: A Unified Framework for Sparse Metric Learning
There has been significant recent interest in sparse metric learning (SML) in which we simultaneously learn both a good distance metric and a low-dimensional representation. Unfor...
Kaizhu Huang, Yiming Ying, Colin Campbell
ALT
2003
Springer
13 years 11 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini