Sciweavers

1357 search results - page 163 / 272
» Compositionality in Graph Transformation
Sort
View
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
15 years 2 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara
MCS
2010
Springer
15 years 5 months ago
Selecting Structural Base Classifiers for Graph-Based Multiple Classifier Systems
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
Wan-Jui Lee, Robert P. W. Duin, Horst Bunke
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 3 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 4 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
SOFTVIS
2003
ACM
15 years 9 months ago
A New Approach for Visualizing UML Class Diagrams
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...
Carsten Gutwenger, Michael Jünger, Karsten Kl...