Sciweavers

4009 search results - page 205 / 802
» Clustering on Complex Graphs
Sort
View
BMCBI
2006
90views more  BMCBI 2006»
15 years 4 months ago
Dissecting trait heterogeneity: a comparison of three clustering methods applied to genotypic data
Background: Trait heterogeneity, which exists when a trait has been defined with insufficient specificity such that it is actually two or more distinct traits, has been implicated...
Tricia A. Thornton-Wells, Jason H. Moore, Jonathan...
CIKM
2007
Springer
15 years 10 months ago
A dual-view approach to interactive network visualization
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
Galileo Namata, Brian Staats, Lise Getoor, Ben Shn...
SIROCCO
2008
15 years 5 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
EJC
2006
15 years 4 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer
144
Voted
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 9 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar