Sciweavers

404 search results - page 55 / 81
» Correlation search in graph databases
Sort
View
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
14 years 1 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
CVPR
2004
IEEE
14 years 10 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
14 years 3 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta
NAR
2011
205views Computer Vision» more  NAR 2011»
12 years 11 months ago
The BRENDA Tissue Ontology (BTO): the first all-integrating ontology of all organisms for enzyme sources
BTO, the BRENDA Tissue Ontology (http://www .BTO.brenda-enzymes.org) represents a comprehensive structured encyclopedia of tissue terms. The project started in 2003 to create a co...
Marion Gremse, Antje Chang, Ida Schomburg, Andreas...
KDD
2009
ACM
237views Data Mining» more  KDD 2009»
14 years 9 months ago
Exploring social tagging graph for web object classification
This paper studies web object classification problem with the novel exploration of social tags. Automatically classifying web objects into manageable semantic categories has long ...
Zhijun Yin, Rui Li, Qiaozhu Mei, Jiawei Han