Sciweavers

217 search results - page 24 / 44
» Searching in metric spaces with user-defined and approximate...
Sort
View
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
13 years 9 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...
BMCBI
2008
200views more  BMCBI 2008»
13 years 7 months ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
SCCC
2003
IEEE
14 years 28 days ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 7 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
14 years 11 days ago
A contractivity approach for probabilistic bisimulations of diffusion processes
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...
Alessandro Abate