Sciweavers

1477 search results - page 24 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
15 years 3 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
GG
2008
Springer
14 years 10 months ago
Model-Driven Development of Model Transformations
The model-driven development of model transformations requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, t...
Pieter Van Gorp
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 4 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
14 years 11 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
HAIS
2010
Springer
15 years 2 months ago
Graph-Based Model-Selection Framework for Large Ensembles
The intuition behind ensembles is that different prediciton models compensate each other’s errors if one combines them in an appropriate way. In case of large ensembles a lot of...
Krisztian Buza, Alexandros Nanopoulos, Lars Schmid...