Sciweavers

7913 search results - page 7 / 1583
» Information Collection on a Graph
Sort
View
IV
2009
IEEE
191views Visualization» more  IV 2009»
14 years 2 months ago
An Heuristic for the Construction of Intersection Graphs
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
Paolo Simonetto, David Auber
JMMA
2010
162views more  JMMA 2010»
13 years 2 months ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
ICML
2004
IEEE
14 years 8 months ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley
WAIM
2010
Springer
13 years 5 months ago
A Model for Automatic Generation of Multi-partite Graphs from Arbitrary Data
In this paper we propose a generic model to generate basic multi-partite graphs obtained by associations found in arbitrary data. The interest of such a model is to be the formal ...
Ricardo A. Baeza-Yates, Nieves R. Brisaboa, Josep-...
TCS
2010
13 years 5 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...