Sciweavers

1132 search results - page 137 / 227
» Similarity Graphs
Sort
View
CVPR
2012
IEEE
13 years 10 days ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
WWW
2003
ACM
15 years 10 months ago
?-Queries: enabling querying for semantic associations on the semantic web
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
Kemafor Anyanwu, Amit P. Sheth
RECOMB
2010
Springer
15 years 3 months ago
SubMAP: Aligning Metabolic Pathways with Subnetwork Mappings
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
Ferhat Ay, Tamer Kahveci
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 4 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
DIS
2006
Springer
15 years 1 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann