Sciweavers

691 search results - page 99 / 139
» Non-negative graph embedding
Sort
View
102
Voted
EJC
2007
15 years 3 months ago
Link complexes of subspace arrangements
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
Axel Hultman
112
Voted
ICMS
2010
15 years 1 months ago
TADD: A Computational Framework for Data Analysis Using Discrete Morse Theory
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
Jan Reininghaus, David Günther, Ingrid Hotz, ...
BMCBI
2011
14 years 6 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
COMPGEOM
2011
ACM
14 years 6 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
SIGECOM
2011
ACM
311views ECommerce» more  SIGECOM 2011»
14 years 5 months ago
The role of social networks in online shopping: information passing, price of trust, and consumer choice
While social interactions are critical to understanding consumer behavior, the relationship between social and commerce networks has not been explored on a large scale. We analyze...
Stephen Guo, Mengqiu Wang, Jure Leskovec