Sciweavers

691 search results - page 3 / 139
» Non-negative graph embedding
Sort
View
TKDE
2011
280views more  TKDE 2011»
13 years 8 days ago
Locally Consistent Concept Factorization for Document Clustering
—Previous studies have demonstrated that document clustering performance can be improved significantly in lower dimensional linear subspaces. Recently, matrix factorization base...
Deng Cai, Xiaofei He, Jiawei Han
SDM
2009
SIAM
152views Data Mining» more  SDM 2009»
14 years 2 months ago
Non-negative Matrix Factorization, Convexity and Isometry.
In this paper we explore avenues for improving the reliability of dimensionality reduction methods such as Non-Negative Matrix Factorization (NMF) as interpretive exploratory data...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...

Presentation
391views
15 years 4 months ago
Geometry of Graphs
Geometry of Graphs. Talk on celebrated LLR Paper, (November 2006)
Sujit Gujar
CORR
2012
Springer
195views Education» more  CORR 2012»
12 years 1 months ago
Multiple-Source Shortest Paths in Embedded Graphs
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
Sergio Cabello, Erin W. Chambers, Jeff Erickson
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
11 years 7 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri