2009
DOI: 10.1007/s11634-009-0039-6
|View full text |Cite
|
Sign up to set email alerts
|

An update algorithm for restricted random walk clustering for dynamic data sets

Abstract: Clustering, Dynamic clustering, Random walks, 60J20, 62H30,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0
1

Year Published

2011
2011
2014
2014

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 33 publications
(30 reference statements)
0
3
0
1
Order By: Relevance
“…a balance is achieved between temporal noise and concept drift (Chakrabarti et al 2006). Incremental methods can be further divided in iterative approximation schemes (Sun et al 2007;Yang and Liu 2006;Lin et al 2008) and graph modification oriented reclusterings (Falkowski et al 2007;Franke and Geyer-Schulz 2009).…”
Section: Incremental Applicationmentioning
confidence: 99%
See 1 more Smart Citation
“…a balance is achieved between temporal noise and concept drift (Chakrabarti et al 2006). Incremental methods can be further divided in iterative approximation schemes (Sun et al 2007;Yang and Liu 2006;Lin et al 2008) and graph modification oriented reclusterings (Falkowski et al 2007;Franke and Geyer-Schulz 2009).…”
Section: Incremental Applicationmentioning
confidence: 99%
“…For example, the DenGraph framework (Falkowski et al 2007), which uses a notion of subgraph density equivalent to the concept of (μ, )-cores (Xu et al 2007), translates each modification taking place on the graph into some update operation (or no operation in some cases) on the graph cores and their associated communities. A more sophisticated scheme is presented by Franke and Geyer-Schulz (2009) based on an incremental version of a restricted random walk clustering scheme, which takes into account only the changes that have taken place on the graph since the last clustering.…”
Section: Incremental Applicationmentioning
confidence: 99%
“…Processing a network with about 5 million nodes and 40 million edges takes less than 10 seconds on standard desktop computers. Another algorithm we developed is optimized for the processing of huge dynamic datasets [72]. The algorithm is based on restricted random walks that are incrementally updated.…”
Section: Social Intelligencementioning
confidence: 99%
“…συν., 2007) µεταϕράζει κάθε µεταβολή στο γράϕο σε µια πράξη ανανέωσης (update operation) στους (µ, ϸ)-πυρήνες του γράϕου και τις κοινότητες που σχηµατίζονται γύρω από αυτούς. Στην εργασία (Franke & Geyer-Schulz, 2009) υλοποιείται µια επαυξητική εκδοχή του αλγορίθµου πεπερασµένων τυχαίων περιπάτων (Restricted Random Walks, RRW) που λαµβάνει υπόψη µόνο τις µεταβολές που έλαβαν χώρα µεταξύ του παρόντος και του προηγούµενου στιγµιότυπου γράϕου. (Tyler, Wilkinson, & Huberman, 2003) στα πλαίσια της µεθόδου GN (Girvan & Newman, 2002).…”
Section: ανίχνευση κοινοτήτων σε εξελισσόµενους γράϕουςunclassified