{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:18:22Z","timestamp":1737436702808,"version":"3.33.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T00:00:00Z","timestamp":1188000000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s10618-007-0081-y","type":"journal-article","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T18:50:04Z","timestamp":1187981404000},"page":"67-107","source":"Crossref","is-referenced-by-count":4,"title":["A dynamic bibliometric model for identifying online communities"],"prefix":"10.1007","volume":"16","author":[{"given":"Xin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ata","family":"Kab\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,25]]},"reference":[{"key":"81_CR1","volume-title":"Modeling the internet and the web: probabilistic methods and algorithms","author":"P Baldi","year":"2003","unstructured":"Baldi P, Frasconi P and Smyth P (2003). Modeling the internet and the web: probabilistic methods and algorithms. Wiley, San Francisco, CA, USA"},{"key":"81_CR2","doi-asserted-by":"crossref","unstructured":"Bingham E, Gionis A, Haiminen N, Hiisil\u00e4 H, Mannila H, Terzi E (2006) Segmentation and dimensionality reduction. In: Ghosh J, Lambert D, Skillicorn DB, Srivastava J (eds) Proceedings of the 6th SIAM international conference on data mining, April 20\u201322, 2006, Bethesda, MD, USA, SIAM","DOI":"10.1137\/1.9781611972764.33"},{"issue":"1\u20137","key":"81_CR3","first-page":"107","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S and Page L (1998). The anatomy of a large-scale hypertextual web search engine. Comp Netw 30(1\u20137): 107\u2013117","journal-title":"Comp Netw"},{"issue":"4","key":"81_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1023\/A:1024992613384","volume":"7","author":"IV Cadez","year":"2003","unstructured":"Cadez IV, Heckerman D, Meek C, Smyth P and White S (2003). Model-based clustering and visualization of navigation patterns on a web site. Data Min Knowl Discov 7(4): 399\u2013424","journal-title":"Data Min Knowl Discov"},{"issue":"4","key":"81_CR5","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1198\/106186001317243403","volume":"10","author":"G Celeux","year":"2001","unstructured":"Celeux G, Chr\u00e9tien S, Forbes F and Mkhadri A (2001). A component-wise EM algorithm for mixtures. J Comput Graph Stat 10(4): 697\u2013712","journal-title":"J Comput Graph Stat"},{"key":"81_CR6","unstructured":"Choudhury T, Basu S (2004) Modeling conversational dynamics as a mixed-memory markov process. In: Advances in neural information processing systems 17 (NIPS 2004), Vancouver, British Columbia, Canada"},{"key":"81_CR7","unstructured":"Cohn D, Chang H (2000) Learning to probabilistically identify authoritative documents. In: Langley P (ed) Proceedings of the 17th international conference on machine learning (ICML 2000), Stanford University, Standord, CA, USA, Morgan Kaufmann, pp 167\u2013174"},{"issue":"1","key":"81_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF03325089","volume":"1","author":"R Cooley","year":"1999","unstructured":"Cooley R, Mobasher B and Srivastava J (1999). Data preparation for mining world wide web browsing patterns. Knowl Inf Syst 1(1): 5\u201332","journal-title":"Knowl Inf Syst"},{"key":"81_CR9","doi-asserted-by":"crossref","unstructured":"Danon L, D\u00edaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech Theory Exp P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"issue":"1","key":"81_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM and Rubin DB (1977). Maximum likelihood from incomplete data via the EM algorithm. J Roy Stat Soc B 39(1): 1\u201338","journal-title":"J Roy Stat Soc B"},{"issue":"3","key":"81_CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"GW Flake","year":"2002","unstructured":"Flake GW, Lawrence S, Giles CL and Coetzee F (2002). Self-organization and identification of web communities. IEEE Comp 35(3): 66\u201371","journal-title":"IEEE Comp"},{"issue":"2","key":"81_CR12","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1162\/089976699300016755","volume":"11","author":"ID Guedalia","year":"1999","unstructured":"Guedalia ID, London M and Werman M (1999). An on-line agglomerative clustering method for nonstationary data. Neural Comput 11(2): 521\u2013540","journal-title":"Neural Comput"},{"key":"81_CR13","unstructured":"He X, Ding CHQ, Zha H, Simon HD (2001) Automatic topic identification using webpage clustering. In: Cercone N, Lin TY, Wu X (eds) Proceedings of the 2001 IEEE international conference on data mining, San Jose, California, USA, IEEE computer society, pp 195\u2013202"},{"key":"81_CR14","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK and Dubes RC (1988). Algorithms for clustering data. Prentice-Hall, Inc., Upper Saddle River, NJ, USA"},{"issue":"1","key":"81_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10994-007-5008-8","volume":"68","author":"A Kab\u00e1n","year":"2007","unstructured":"Kab\u00e1n A (2007). Predictive modelling of heterogeneous sequence collections by topographic ordering of histories. Mach Learn 68(1): 63\u201395","journal-title":"Mach Learn"},{"key":"81_CR16","doi-asserted-by":"crossref","unstructured":"Kab\u00e1n A, Wang X (2004) Context based identification of user communities from internet chat. In: Proceedings of IEEE International Joint Conference Neural Networks (IJCNN 2004), IEEE computer society, pp 3287\u20133292","DOI":"10.1109\/IJCNN.2004.1381206"},{"key":"81_CR17","doi-asserted-by":"crossref","unstructured":"Kab\u00e1n A, Wang X (2006) Deconvolutive clustering of markov states. In: Scheffer T, Fuernkranz J, Spiliopoulou M (eds) 17th European conference on machine learning (ECML2006), Vol 4212 LNAI, Springer-Verlag, pp 246\u2013257","DOI":"10.1007\/11871842_26"},{"issue":"5","key":"81_CR18","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999). Authoritative sources in a hyperlinked environment. J ACM 46(5): 604\u2013632","journal-title":"J ACM"},{"issue":"4","key":"81_CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/A:1024940629314","volume":"7","author":"JM Kleinberg","year":"2003","unstructured":"Kleinberg JM (2003). Bursty and hierarchical structure in streams. Data Min Knowl Discov 7(4): 373\u2013397","journal-title":"Data Min Knowl Discov"},{"key":"81_CR20","unstructured":"Kleinberg JM (2006) Temporal dynamics of on-line information streams. In: Garofalakis M, Gehrke J, Rastogi R (eds) Data stream management: processing high-speed data streams. Springer"},{"key":"81_CR21","volume-title":"The EM algorithm and extensions","author":"T Krishnan","year":"1997","unstructured":"Krishnan T and McLachlan GJ (1997). The EM algorithm and extensions. John Wiley and Sons, New York, NY, USA"},{"key":"81_CR22","volume-title":"Foundations of statistical natural language processing","author":"CD Manning","year":"1999","unstructured":"Manning CD and Sch\u00fctze H (1999). Foundations of statistical natural language processing. MIT Press, Cambridge, MA, USA"},{"key":"81_CR23","unstructured":"Neal RM, Hinton GE (1999) A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Learning in graphical models. MIT Press, Cambridge, MA, USA, pp 355\u2013368"},{"key":"81_CR24","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ (2004). Detecting community structure in networks. Euro Phys J B 38: 321\u2013330","journal-title":"Euro Phys J B"},{"key":"81_CR25","unstructured":"Ng AY, Zheng AX, Jordan MI (2001) Link analysis, eigenvectors and stability. In: Nebel B (ed) Proceedings of the 17th international joint conference on artificial intelligence, IJCAI 2001, Seattle, Washington, USA, Morgan Kaufmann, pp 903\u2013910"},{"key":"81_CR26","doi-asserted-by":"crossref","unstructured":"Rabiner LR (1989) A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257\u2013286","DOI":"10.1109\/5.18626"},{"issue":"3","key":"81_CR27","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1111\/j.2517-6161.1985.tb01383.x","volume":"47","author":"A Raftery","year":"1985","unstructured":"Raftery A (1985). A model for high-order markov chains. Roy Stat Soc B 47(3): 528\u2013539","journal-title":"Roy Stat Soc B"},{"issue":"3","key":"81_CR28","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1214\/ss\/1042727943","volume":"17","author":"A Raftery","year":"2002","unstructured":"Raftery A and Berchtold A (2002). The mixture transition distribution model for high-order markov chains and non-gaussian time series. Stat Sci 17(3): 328\u2013356","journal-title":"Stat Sci"},{"key":"81_CR29","volume-title":"Pattern recognition and neural networks","author":"BD Ripley","year":"1995","unstructured":"Ripley BD and Hjort NL (1995). Pattern recognition and neural networks. Cambridge University Press, New York, NY, USA"},{"issue":"1","key":"81_CR30","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1007649326333","volume":"37","author":"LK Saul","year":"1999","unstructured":"Saul LK and Jordan MI (1999). Mixed memory markov models: decomposing complex stochastic processes as mixtures of simpler ones. Mach Learn 37(1): 75\u201387","journal-title":"Mach Learn"},{"key":"81_CR31","unstructured":"Saul LK, Pereira F (1997) Aggregate and mixed-order markov models for statistical language processing. CoRR, cmp-lg\/9706007"},{"issue":"8","key":"81_CR32","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1016\/0893-6080(94)90003-5","volume":"7","author":"N Ueda","year":"1994","unstructured":"Ueda N and Nakano R (1994). A new competitive learning approach based on an equidistortion principle for designing optimal vector quantizers. Neural Netw 7(8): 1211\u20131227","journal-title":"Neural Netw"},{"key":"81_CR33","doi-asserted-by":"crossref","unstructured":"Wang X, Kab\u00e1n A (2006) State aggregation in higher-order markov chains for finding online communities. In: Corchado E et\u00a0al (ed) 7th international conference on intelligent data engineering and automated learning (IDEAL06), LNCS, vol 4224 Springer-Verlag, pp 1023\u20131030","DOI":"10.1007\/11875581_122"},{"key":"81_CR34","doi-asserted-by":"crossref","unstructured":"Wasserman S, Faust K, Iacobucci D (1994) Social network analysis: methods and applications (Structural Analysis in the Social Sciences). Cambridge University Press","DOI":"10.1017\/CBO9780511815478"},{"key":"81_CR35","unstructured":"Ypma A, Heskes T (2002) Automatic categorization of web pages and user clustering with mixtures of hidden markov models. In: Za\u00efane OR, Srivastava J, Spiliopoulou M, Masand BM (eds) WEBKDD, Lecture notes in computer science, vol 2703 Springer, pp 35\u201349"},{"issue":"1","key":"81_CR36","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s11063-004-2793-y","volume":"21","author":"D Zhang","year":"2005","unstructured":"Zhang D, Chen S and Tan K (2005). Improving the robustness of \u2018online agglomerative clustering method\u2019 based on kernel-induce distance measures. Neural Process Lett 21(1): 45\u201351","journal-title":"Neural Process Lett"},{"key":"81_CR37","unstructured":"Zhong S (2005) Efficient online spherical k-means clustering. In: Proceedings of the IEEE international joint conference neural networks (IJCNN 2005), IEEE computer society, pp 3180\u20133185"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-007-0081-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-007-0081-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-007-0081-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T16:57:06Z","timestamp":1737392226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-007-0081-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,25]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["81"],"URL":"https:\/\/doi.org\/10.1007\/s10618-007-0081-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2007,8,25]]}}}