Sciweavers

911 search results - page 35 / 183
» On the Distance of Databases
Sort
View
TSMC
2010
13 years 2 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
14 years 19 days ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
ADC
2003
Springer
123views Database» more  ADC 2003»
14 years 24 days ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
VLDB
1998
ACM
192views Database» more  VLDB 1998»
13 years 11 months ago
Algorithms for Mining Distance-Based Outliers in Large Datasets
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...
Edwin M. Knorr, Raymond T. Ng