Sciweavers

82 search results - page 3 / 17
» Modularity-Driven Clustering of Dynamic Graphs
Sort
View
ASUNAM
2009
IEEE
13 years 10 months ago
Mining the Dynamics of Music Preferences from a Social Networking Site
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
Nico Schlitter, Tanja Falkowski
DICS
2006
13 years 8 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules: A Programmer's Perspective
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...
Sebastian Gerlach, Basile Schaeli, Roger D. Hersch
IJCV
2007
208views more  IJCV 2007»
13 years 5 months ago
Binet-Cauchy Kernels on Dynamical Systems and its Application to the Analysis of Dynamic Scenes
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
S. V. N. Vishwanathan, Alexander J. Smola, Ren&eac...
WEBI
2007
Springer
13 years 11 months ago
DENGRAPH: A Density-based Community Detection Algorithm
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...
Tanja Falkowski, Anja Barth, Myra Spiliopoulou
DIS
2009
Springer
13 years 11 months ago
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
Min-Soo Kim 0002, Jiawei Han