Sciweavers

4009 search results - page 167 / 802
» Clustering on Complex Graphs
Sort
View
COLING
2010
14 years 11 months ago
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
Katja Filippova
BMCBI
2011
14 years 11 months ago
A novel approach to the clustering of microarray data via nonparametric density estimation
Background: Cluster analysis is a crucial tool in several biological and medical studies dealing with microarray data. Such studies pose challenging statistical problems due to di...
Riccardo De Bin, Davide Risso
IPPS
2008
IEEE
15 years 10 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 4 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
Bageshri Karkare, Uday P. Khedker
SIGKDD
2010
126views more  SIGKDD 2010»
14 years 10 months ago
MultiClust 2010: discovering, summarizing and using multiple clusterings
Traditional clustering focuses on finding a single best clustering solution from data. However, given a single data set, one could interpret it in different ways. This is particul...
Xiaoli Z. Fern, Ian Davidson, Jennifer G. Dy