Sciweavers

136 search results - page 4 / 28
» Graph Nodes Clustering Based on the Commute-Time Kernel
Sort
View
APVIS
2008
13 years 7 months ago
Energy-Based Hierarchical Edge Clustering of Graphs
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
Hong Zhou, Xiaoru Yuan, Weiwei Cui, Huamin Qu, Bao...
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
14 years 22 days ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt
ICML
2005
IEEE
14 years 7 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
SAC
2009
ACM
14 years 1 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
BMCBI
2008
145views more  BMCBI 2008»
13 years 6 months ago
Directed acyclic graph kernels for structural RNA analysis
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
Kengo Sato, Toutai Mituyama, Kiyoshi Asai, Yasubum...