{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:08:04Z","timestamp":1774940884047,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540259992","type":"print"},{"value":"9783540320630","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427995_21","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T19:27:06Z","timestamp":1279049226000},"page":"256-268","source":"Crossref","is-referenced-by-count":60,"title":["Modeling and Multiway Analysis of Chatroom Tensors"],"prefix":"10.1007","author":[{"given":"Evrim","family":"Acar","sequence":"first","affiliation":[]},{"given":"Seyit A.","family":"\u00c7amtepe","sequence":"additional","affiliation":[]},{"given":"Mukkai S.","family":"Krishnamoorthy","sequence":"additional","affiliation":[]},{"given":"B\u00fclent","family":"Yener","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Matrix Computations","author":"G. Golub","year":"1996","unstructured":"Golub, G., Loan, C.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"L. Tucker","year":"1966","unstructured":"Tucker, L.: Some mathematical notes on three mode factor analysis. Psychometrika\u00a031, 279\u2013311 (1966)","journal-title":"Psychometrika"},{"key":"21_CR3","first-page":"1","volume":"16","author":"R. Harshman","year":"1970","unstructured":"Harshman, R.: Foundations of the parafac procedure: Model and conditions for an explanatory multi-mode factor analysis. UCLA WPP\u00a016, 1\u201384 (1970)","journal-title":"UCLA WPP"},{"key":"21_CR4","unstructured":"Kalt, C.: Internet Relay Chat. RFC 2810, 2811, 2812, 2813 (2000)"},{"key":"21_CR5","unstructured":"Krebs, V.: An introduction to social network analysis (2004), http:\/\/www.orgnet.com\/sna.html (accessed February 2004)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44853-5_10","volume-title":"Intelligence and Security Informatics","author":"M. Magdon-Ismail","year":"2003","unstructured":"Magdon-Ismail, M., Goldberg, M., Siebecker, D., Wallace, W.: Locating hidden groups in communication networks using hidden markov models. In: Chen, H., Miranda, R., Zeng, D.D., Demchak, C.C., Schroeder, J., Madhusudan, T. (eds.) ISI 2003. LNCS, vol.\u00a02665, pp. 126\u2013137. Springer, Heidelberg (2003)"},{"key":"21_CR7","unstructured":"Goldberg, M., Horn, P., Magdon-Ismail, M., Riposo, J., Siebecker, D., Wallace, W., Yener, B.: Statistical modeling of social groups on communication networks. In: First conference of the North American Association for Computational Social and Organizational Science, NAACSOS 2003 (2003)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-25952-7_19","volume-title":"Intelligence and Security Informatics","author":"S. Camtepe","year":"2004","unstructured":"Camtepe, S., Krishnamoorthy, M., Yener, B.: A tool for internet chatroom surveillance. In: Chen, H., Moore, R., Zeng, D.D., Leavitt, J. (eds.) ISI 2004. LNCS, vol.\u00a03073, pp. 252\u2013265. Springer, Heidelberg (2004)"},{"key":"21_CR9","unstructured":"Camtepe, S., Goldberg, M., Magdon-Ismail, M., Krishnamoorty, M.: Detecting conversing groups of chatters: A model, algorithms, and tests. In: IADIS International Conference on Applied Computing (2005)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/IV.2003.1217994","volume-title":"Seventh International Conference on Information Visualization (IV 2003)","author":"P. Mutton","year":"2003","unstructured":"Mutton, P., Golbeck, J.: Visualization of semantic metadata and ontologies. In: Seventh International Conference on Information Visualization (IV 2003), pp. 300\u2013305. IEEE, Los Alamitos (2003)"},{"key":"21_CR11","unstructured":"Mutton, P.: Piespy social network bot (2001), http:\/\/www.jibble.org\/piespy (accessed January 2005)"},{"key":"21_CR12","first-page":"9","volume-title":"ACM SIGCHI","author":"F. Viegas","year":"1999","unstructured":"Viegas, F., Donath, J.: Chat circles. In: ACM SIGCHI, pp. 9\u201316. ACM, New York (1999)"},{"key":"21_CR13","volume-title":"Three-mode Principal Component Analysis: Theory and Applications","author":"P. Kroonenberg","year":"1983","unstructured":"Kroonenberg, P.: Three-mode Principal Component Analysis: Theory and Applications. DSWO Press, Leiden (1983)"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0024-3795(97)81516-9","volume":"269","author":"D. Leibovici","year":"1998","unstructured":"Leibovici, D., Sabatier, R.: A singular value decomposition of a k-ways array for a principal component analysis of multi-way data, the pta-k. Linear Algebra and its Applications\u00a0269, 307\u2013329 (1998)","journal-title":"Linear Algebra and its Applications"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L. Lathauwer","year":"2000","unstructured":"Lathauwer, L., Moor, B., Van de walle, J.: On the best rank-1 and rank-(r1,r2,.,rn) approximation of higher-order tensors. SIAM J. Matrix Analysis and Applications\u00a021, 1324\u20131342 (2000)","journal-title":"SIAM J. Matrix Analysis and Applications"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1137\/S0895479899352045","volume":"23","author":"T. Zhang","year":"2001","unstructured":"Zhang, T., Golub, G.: Rank-one approximation to higher order tensors. SIAM J. Matrix Analysis and Applications\u00a023, 534\u2013550 (2001)","journal-title":"SIAM J. Matrix Analysis and Applications"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1137\/S0895479800368354","volume":"23","author":"T. Kolda","year":"2001","unstructured":"Kolda, T.: Orthogonal tensor decompositions. SIAM J. Matrix Analysis and Applications\u00a023, 243\u2013255 (2001)","journal-title":"SIAM J. Matrix Analysis and Applications"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1137\/S0895479801387413","volume":"22","author":"E. Kofidis","year":"2002","unstructured":"Kofidis, E., Regalia, P.: On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Analysis and Applications\u00a022, 863\u2013884 (2002)","journal-title":"SIAM J. Matrix Analysis and Applications"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0895479801394465","volume":"24","author":"T. Kolda","year":"2003","unstructured":"Kolda, T.: A counter example to the possibility of an extension of the eckart-young low-rank approximation theorem for the orthogonal rank tensor decomposition. SIAM J. Matrix Analysis and Applications\u00a024, 762\u2013767 (2003)","journal-title":"SIAM J. Matrix Analysis and Applications"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Kolda, T., Bader, B.: Matlab tensor classes for fast algorithm prototyping. Technical Report SAND2004-5187, Sandia National Laboratories (2004)","DOI":"10.2172\/974874"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Andersson, C., Bro, R.: The N-way Toolbox for MATLAB. Chemometrics and Intelligent Laboratory Systems (2000)","DOI":"10.1016\/S0169-7439(00)00071-X"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.2307\/2528964","volume":"28","author":"D. Andrews","year":"1972","unstructured":"Andrews, D.: Plots of high-dimensional data. Biometrics\u00a028, 125\u2013136 (1972)","journal-title":"Biometrics"},{"key":"21_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-0450-1","volume-title":"Pattern Recognition with Fuzzy Objective Function Algoritms","author":"J. Bezdek","year":"1981","unstructured":"Bezdek, J.: Pattern Recognition with Fuzzy Objective Function Algoritms. Plenum Press, New York (1981)"}],"container-title":["Lecture Notes in Computer Science","Intelligence and Security Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427995_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:56:44Z","timestamp":1605625004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427995_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259992","9783540320630"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11427995_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}