Sciweavers

1016 search results - page 77 / 204
» Generalized distances between rankings
Sort
View
DMIN
2006
115views Data Mining» more  DMIN 2006»
15 years 2 months ago
Indexing Spatio-Temporal Trajectories with Orthogonal Polynomials
Abstract-- In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orth...
Elena Braynova
90
Voted
CLASSIFICATION
2008
73views more  CLASSIFICATION 2008»
15 years 1 months ago
Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms
: In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the ama...
Alberto Fernández, Sergio Gómez
WWW
2009
ACM
16 years 1 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
WWW
2002
ACM
16 years 1 months ago
The structure of broad topics on the web
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
Soumen Chakrabarti, Mukul Joshi, Kunal Punera, Dav...
131
Voted
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 1 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein