Sciweavers

1016 search results - page 56 / 204
» Generalized distances between rankings
Sort
View
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 1 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
PR
2011
14 years 7 months ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
Silvia García-Díez, François ...
106
Voted
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
15 years 10 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
CIKM
2009
Springer
15 years 7 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
133
Voted
WWW
2003
ACM
16 years 1 months ago
A Context-Based Information Agent for Supporting Intelligent Distance Learning Environments
The large amount of information now available on the Web can play a prominent role in building a cooperative intelligent distance learning environment. We propose a system to prov...
Mohammed Abdel Razek, Claude Frasson, Marc Kaltenb...