Sciweavers

4009 search results - page 141 / 802
» Clustering on Complex Graphs
Sort
View
128
Voted
ICML
2007
IEEE
16 years 4 months ago
Spectral clustering and transductive learning with multiple views
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
Dengyong Zhou, Christopher J. C. Burges
132
Voted
GD
1998
Springer
15 years 8 months ago
A Framework for Drawing Planar Graphs with Curves and Polylines
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
Michael T. Goodrich, Christopher G. Wagner
153
Voted
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 4 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...
136
Voted
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
15 years 3 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
IEEECIT
2009
IEEE
15 years 10 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi