{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T13:54:50Z","timestamp":1649166890279},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s11634-009-0039-6","type":"journal-article","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:22:20Z","timestamp":1245230540000},"page":"63-92","source":"Crossref","is-referenced-by-count":8,"title":["An update algorithm for restricted random walk clustering for dynamic data sets"],"prefix":"10.1007","volume":"3","author":[{"given":"Markus","family":"Franke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Geyer-Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,18]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/B978-012722442-8\/50016-1","volume-title":"VLDB 2003, Proceedings of 29th international conference on very large data bases","author":"CC Aggarwal","year":"2003","unstructured":"Aggarwal CC, Han J, Wang J, Yu PS (2003) A framework for clustering evolving data streams. In: Freytag JC, Lockemann PC, Abiteboul S, Carey MJ, Selinger PG, Heuer A (eds) VLDB 2003, Proceedings of 29th international conference on very large data bases. Morgan Kaufmann, San Francisco, pp 81\u201392"},{"issue":"11","key":"39_CR2","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1109\/32.9055","volume":"14","author":"J Banerjee","year":"1988","unstructured":"Banerjee J, Kim W, Kim SJ, Garza JF (1988) Clustering a DAG for CAD databases. IEEE Trans Softw Eng 14(11): 1684\u20131699","journal-title":"IEEE Trans Softw Eng"},{"issue":"2","key":"39_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/507515.507519","volume":"3","author":"D Barbar\u00e1","year":"2002","unstructured":"Barbar\u00e1 D (2002) Requirements for clustering data streams. SIGKDD Explor Newsl 3(2): 23\u201327","journal-title":"SIGKDD Explor Newsl"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Basagni S (1999) Distributed clustering for ad hoc networks. In: Proceedings of the fourth international symposium on parallel architectures, algorithms, and networks (ISPAN \u201999). IEEE Press, Piscataway, pp 310\u2013315","DOI":"10.1109\/ISPAN.1999.778957"},{"key":"39_CR5","volume-title":"Automatische Klassifikation","author":"H Bock","year":"1974","unstructured":"Bock H (1974) Automatische Klassifikation. Vandenhoeck & Ruprecht, G\u00f6ttingen"},{"key":"39_CR6","first-page":"344","volume-title":"ECCOP\u201996\u2014Object-Oriented Programming, 10th European Conference","author":"F Bullat","year":"1996","unstructured":"Bullat F, Schneider M (1996) Dynamic clustering in object databases exploiting effective use of relationships between objects. In: Cointe P (eds) ECCOP\u201996\u2014Object-Oriented Programming, 10th European Conference. Springer, Heidelberg, pp 344\u2013365"},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/42005.42019","volume-title":"SIGIR \u201987: Proceedings of the 10th annual international ACM SIGIR conference on research and development in information retrieval","author":"F Can","year":"1987","unstructured":"Can F, Ozkarahan EA (1987) A dynamic cluster maintenance system for information retrieval. In: Yu CT, Rijsbergen CJV (eds) SIGIR \u201987: Proceedings of the 10th annual international ACM SIGIR conference on research and development in information retrieval. ACM Press, New York, pp 123\u2013131"},{"issue":"3","key":"39_CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0306-4573(89)90045-9","volume":"25","author":"F Can","year":"1989","unstructured":"Can F, Ozkarahan EA (1989) Dynamic cluster maintenance. Inf Process Manag 25(3): 275\u2013291","journal-title":"Inf Process Manag"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti D, Kumar R, Tomkins A (2006) Evolutionary clustering. In: Proceedings of the 2006 ACM SIGKDD. ACM Press, New York","DOI":"10.1145\/1150402.1150467"},{"key":"39_CR10","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1145\/258533.258657","volume-title":"STOC \u201997: Proceedings of the twenty-ninth annual ACM symposium on theory of computing","author":"M Charikar","year":"1997","unstructured":"Charikar M, Chekuri C, Feder T, Motwani R (1997) Incremental clustering and dynamic information retrieval. In: Leighton FT, Shor P (eds) STOC \u201997: Proceedings of the twenty-ninth annual ACM symposium on theory of computing. ACM Press, New York, pp 626\u2013635"},{"key":"39_CR11","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/780542.780548","volume-title":"STOC \u201903: Proceedings of the thirty-fifth annual ACM symposium on theory of computing","author":"M Charikar","year":"2003","unstructured":"Charikar M, O\u2019Callaghan L, Panigrahy R (2003) Better streaming algorithms for clustering problems. In: Larmore LL, Goemans MX (eds) STOC \u201903: Proceedings of the thirty-fifth annual ACM symposium on theory of computing. ACM Press, New York, pp 30\u201339"},{"issue":"1","key":"39_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-8655(94)90097-3","volume":"15","author":"BB Chaudhuri","year":"1994","unstructured":"Chaudhuri BB (1994) Dynamic clustering for time incremental data. Pattern Recognit Lett 15(1): 27\u201334","journal-title":"Pattern Recognit Lett"},{"key":"39_CR13","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1002\/rsa.20157","volume":"30","author":"A Czumaj","year":"2007","unstructured":"Czumaj A, Sohler C (2007) Sublinear-time approximation algorithms for clustering via random sampling. Random Struct Algorithms 30: 226\u2013256","journal-title":"Random Struct Algorithms"},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/3-540-44677-X_5","volume-title":"Objects and databases, international symposium, proceedings","author":"J Darmont","year":"2001","unstructured":"Darmont J, Fromantin C, R\u00e9gnier S, Gruenwald L, Schneider M (2001) Dynamic clustering in object-oriented databases: an advocacy for simplicity. In: Dittrich KR, Guerrini G, Merlo I, Oliva M, Rodr\u00edguez E (eds) Objects and databases, international symposium, proceedings. Springer, Heidelberg, pp 71\u201385"},{"key":"39_CR15","volume-title":"Pattern classification. 2","author":"RO Duda","year":"2001","unstructured":"Duda RO, Hart PE, Stork DG (2001) Pattern classification. 2. Wiley-Interscience, New York"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Frahling G, Sohler C (2006) A fast k-means implementation using coresets. In: Proceedings of 22nd ACM symposium on computational geometry (SoCG), pp 135\u2013143","DOI":"10.1145\/1137856.1137879"},{"key":"39_CR17","unstructured":"Franke M (2007) An update algorithm for restricted random walk clusters. PhD thesis, Universit\u00e4t Karlsruhe (TH), Karlsruhe"},{"key":"39_CR18","first-page":"232","volume-title":"Research and advanced technology for digital libraries\u20148th European conference, ECDL 2004","author":"M Franke","year":"2004","unstructured":"Franke M, Geyer-Schulz A (2004) Automated indexing with restricted random walks on large document sets. In: Heery R, Lyon L (eds) Research and advanced technology for digital libraries\u20148th European conference, ECDL 2004. Springer, Heidelberg, pp 232\u2013243"},{"key":"39_CR19","first-page":"107","volume-title":"Web personalization, recommender systems and intelligent user interfaces","author":"M Franke","year":"2005","unstructured":"Franke M, Geyer-Schulz A (2005) Using restricted random walks for library recommendations. In: Uchyigit G (eds) Web personalization, recommender systems and intelligent user interfaces. INSTICC Press, Set\u00fabal, pp 107\u2013115"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Franke M, Geyer-Schulz A (2007) A method for analyzing the asymptotic behavior of the walk process in restricted random walk cluster algorithm. In: Advances in data analysis. Proceedings of the 30th annual conference of the german classification society (GfKl). Springer. Studies in Classification, Data Analysis, and Knowledge Organization, Heidelberg, pp 51\u201358","DOI":"10.1007\/978-3-540-70981-7_6"},{"issue":"2","key":"39_CR21","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1142\/S0218001407005442","volume":"21","author":"M Franke","year":"2007","unstructured":"Franke M, Geyer-Schulz A (2007) Using restricted random walks for library recommendations and knowledge space exploration. Int J Pattern Recognit Artif Intell 21(2): 355\u2013373","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Franke M, Thede A (2005) Clustering of large document sets with restricted random walks on usage histories. In: Weihs C, Gaul W (eds) Classification\u2014the ubiquitous challenge: Proceedings of the 28th annual conference of the german classification society (GfKl). Studies in Classification, Data Analysis, and Knowledge Organization, Springer, pp 402\u2013409","DOI":"10.1007\/3-540-28084-7_46"},{"key":"39_CR23","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/978-3-540-78502-6_15","volume-title":"Multi-media services in intelligent environments","author":"M Franke","year":"2008","unstructured":"Franke M, Geyer-Schulz A, Neumann AW (2008) Recommender services in scientific digital libraries. In: Tsihrintzis GA, Jain L (eds) Multi-media services in intelligent environments. Springer, Heidelberg, pp 377\u2013417"},{"issue":"1","key":"39_CR24","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s00454-003-2925-6","volume":"30","author":"J Gao","year":"2003","unstructured":"Gao J, Guibas LJ, Hershberger J, Zhang L, Zhu A (2003) Discrete mobile centers. Discret Computat Geom 30(1): 45\u201365","journal-title":"Discret Computat Geom"},{"issue":"3","key":"39_CR25","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01200845","volume":"1","author":"M Gerla","year":"1995","unstructured":"Gerla M, Tsai JTC (1995) Multicluster, mobile, multimedia radio network. J Wirel Netw 1(3): 255\u2013265","journal-title":"J Wirel Netw"},{"key":"39_CR26","volume-title":"Proceedings of the fourth SIAM international conference on data mining","author":"C Gupta","year":"2004","unstructured":"Gupta C, Grossman RL (2004) GenIc: a single-pass generalized incremental algorithm for clustering. In: Berry MW, Dayal U, Kamath C, Skillicorn DB (eds) Proceedings of the fourth SIAM international conference on data mining. SIAM, Philadelphia"},{"key":"39_CR27","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-45294-X_3","volume-title":"FST TCS 2001: foundations of software technology and theoretical computer science","author":"D Harel","year":"2001","unstructured":"Harel D, Koren Y (2001) On clustering using random walks. In: Hariharan R, Mukund M, Vinay V (eds) FST TCS 2001: foundations of software technology and theoretical computer science. Springer, Heidelberg, pp 18\u201341"},{"issue":"3","key":"39_CR28","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/68012.68013","volume":"14","author":"SE Hudson","year":"1989","unstructured":"Hudson SE, King R (1989) Cactis: a self-adaptive, concurrent implementation of an object-oriented database management system. ACM Trans Database Syst 14(3): 291\u2013321","journal-title":"ACM Trans Database Syst"},{"issue":"2","key":"39_CR29","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/263876.263885","volume":"27","author":"P Krishna","year":"1997","unstructured":"Krishna P, Vaidya NH, Chatterjee M, Pradhan DK (1997) A cluster-based approach for routing in dynamic networks. SIGCOMM Comput Commun Rev 27(2): 49\u201364","journal-title":"SIGCOMM Comput Commun Rev"},{"key":"39_CR30","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1145\/191839.191924","volume-title":"Proceedings of the 1994 ACM SIGMOD international conference on management of data","author":"WJ McIver Jr","year":"1994","unstructured":"McIver WJ Jr, King R (1994) Self-adaptive, on-line reclustering of complex object data. In: Snodgrass RT, Winslett M (eds) Proceedings of the 1994 ACM SIGMOD international conference on management of data. ACM Press, New York, pp 407\u2013418"},{"key":"39_CR31","doi-asserted-by":"crossref","unstructured":"O\u2019Callaghan L, Mishra N, Meyerson A, Guha S, Motwani R (2002) Streaming-data algorithms for high-quality clustering. In: Proceedings of the 18th international conference on data engineering. IEEE Press, Piscataway, pp 685\u2013694","DOI":"10.1109\/ICDE.2002.994785"},{"key":"39_CR32","volume-title":"The design of dynamic data structures. LNCS, vol 156","author":"MH Overmars","year":"1983","unstructured":"Overmars MH (1983) The design of dynamic data structures. LNCS, vol 156. Springer, Berlin"},{"issue":"336","key":"39_CR33","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for the evaluation of clustering algorithms. J Am Stat Assoc 66(336): 846\u2013850","journal-title":"J Am Stat Assoc"},{"key":"39_CR34","unstructured":"Richa AW, Obraczka K, Sen A (2001) Application-oriented self-organizing hierarchical clustering in dynamic networks: a position paper. In: Proceedings of 1st ACM Workshop on principles of mobile computing (POMC). ACM Press, New York, pp 57\u201365"},{"issue":"4","key":"39_CR35","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/320289.320291","volume":"3","author":"G Salton","year":"1978","unstructured":"Salton G, Wong A (1978) Generation and search of clustered files. ACM Trans Database Syst 3(4): 321\u2013346","journal-title":"ACM Trans Database Syst"},{"issue":"6","key":"39_CR36","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1016\/S0031-3203(02)00111-5","volume":"36","author":"J Sch\u00f6ll","year":"2003","unstructured":"Sch\u00f6ll J, Sch\u00f6ll-Paschinger E (2003) Classification by restricted random walks. Patt Recognit 36(6): 1279\u20131290","journal-title":"Patt Recognit"},{"issue":"2","key":"39_CR37","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan RE (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2): 146\u2013160","journal-title":"SIAM J Comput"},{"issue":"2","key":"39_CR38","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/MIC.2009.44","volume":"13","author":"M Trier","year":"2009","unstructured":"Trier M, Bobrik A (2009) Social search. IEEE Internet Comput 13(2): 51\u201359","journal-title":"IEEE Internet Comput"},{"issue":"301","key":"39_CR39","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward","year":"1963","unstructured":"Ward JH (1963) Hierarchical grouping to optimize an objective function. J Am Stat Assoc 58(301): 236\u2013244","journal-title":"J Am Stat Assoc"},{"key":"39_CR40","volume-title":"Market segmentation. International series in quantitative marketing","author":"M Wedel","year":"2001","unstructured":"Wedel M, Kamakura W (2001) Market segmentation. International series in quantitative marketing. Kluwer Academic Publishers, Boston"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-009-0039-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11634-009-0039-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-009-0039-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:46:31Z","timestamp":1559414791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11634-009-0039-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s11634-009-0039-6","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}