Sciweavers

2137 search results - page 18 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
VLDB
2007
ACM
134views Database» more  VLDB 2007»
14 years 1 months ago
Challenges and Experience in Prototyping a Multi-Modal Stream Analytic and Monitoring Application on System S
In this paper, we describe the challenges of prototyping a reference application on System S, a distributed stream processing middleware under development at IBM Research. With a ...
Kun-Lung Wu, Philip S. Yu, Bugra Gedik, Kirsten Hi...
CIB
2005
125views more  CIB 2005»
13 years 7 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 8 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
BMCBI
2004
113views more  BMCBI 2004»
13 years 7 months ago
Influence of microarrays experiments missing values on the stability of gene groups by hierarchical clustering
Background: Microarray technologies produced large amount of data. The hierarchical clustering is commonly used to identify clusters of co-expressed genes. However, microarray dat...
Alexandre G. de Brevern, Serge A. Hazout, Alain Ma...
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
13 years 11 months ago
A More Effective Linear Kernelization for Cluster Editing
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
Jiong Guo