Sciweavers

2137 search results - page 91 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
BMCBI
2005
80views more  BMCBI 2005»
13 years 10 months ago
Sample phenotype clusters in high-density oligonucleotide microarray data sets are revealed using Isomap, a nonlinear algorithm
Background: Life processes are determined by the organism's genetic profile and multiple environmental variables. However the interaction between these factors is inherently ...
Kevin Dawson, Raymond L. Rodriguez, Wasyl Malyj
CVPR
2012
IEEE
12 years 25 days ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
MST
2010
98views more  MST 2010»
13 years 8 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
BMCBI
2011
13 years 2 months ago
RAG: An Update to the RNA-As-Graphs Resource
Background: In 2004, we presented a web resource for stimulating the search for novel RNAs, RNA-As-Graphs (RAG), which classified, catalogued, and predicted RNA secondary structur...
Joseph A. Izzo, Namhee Kim, Shereef Elmetwaly, Tam...
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 5 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal