Sciweavers

312 search results - page 35 / 63
» On distance and similarity in fold space
Sort
View
CHI
1999
ACM
15 years 1 months ago
Learning and Performing by Exploration: Label Quality Measured by Latent Semantic Analysis
Models of learning and performing by exploration assume that the semantic distance between task descriptions and screen labels controls in part the usersÕ search strategies. Neve...
Rodolfo Soto
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
15 years 3 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
77
Voted
ICML
2009
IEEE
15 years 10 months ago
Partial order embedding with multiple kernels
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
Brian McFee, Gert R. G. Lanckriet
ICPR
2006
IEEE
15 years 10 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus
85
Voted
ICDM
2008
IEEE
155views Data Mining» more  ICDM 2008»
15 years 4 months ago
Organic Pie Charts
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
Fabian Mörchen