Sciweavers

185 search results - page 21 / 37
» Graph clustering with network structure indices
Sort
View
CSE
2009
IEEE
14 years 2 months ago
Real World Routing Using Virtual World Information
—In this paper, we propose to leverage social graphs from Online Social Networks (OSN) to improve the forwarding efficiency of mobile networks, more particularly Delay Tolerant ...
Pan Hui, Nishanth R. Sastry
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 10 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
14 years 2 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
DMS
2010
189views Multimedia» more  DMS 2010»
13 years 5 months ago
Visualizing the Commonalities Between Hierarchically Structured Data Queries
Abstract--In this paper we present an information visualization approach for visualizing the intersection between multiple feature hierarchies. In cases where a dataset has multipl...
Chad Jones, Ryan Armstrong, Kwan-Liu Ma
ICANN
2010
Springer
13 years 8 months ago
Visualising Clusters in Self-Organising Maps with Minimum Spanning Trees
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
Rudolf Mayer, Andreas Rauber