{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:00Z","timestamp":1750307160678,"version":"3.41.0"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>We propose SCENT, an innovative, scalable spectral analysis framework for internet scale monitoring of multirelational social media data, encoded in the form of tensor streams. In particular, a significant challenge is to detect key changes in the social media data, which could reflect important events in the real world, sufficiently quickly. Social media data have three challenging characteristics. First, data sizes are enormous; recent technological advances allow hundreds of millions of users to create and share content within online social networks. Second, social data are often multifaceted (i.e., have many dimensions of potential interest, from the textual content to user metadata). Finally, the data is dynamic; structural changes can occur at multiple time scales and be localized to a subset of users. Consequently, a framework for extracting useful information from social media data needs to scale with data volume, and also with the number and diversity of the facets of the data. In SCENT, we focus on the computational cost of structural change detection in tensor streams. We extend compressed sensing (CS) to tensor data. We show that, through the use of randomized tensor ensembles, SCENT is able to encode the observed tensor streams in the form of compact descriptors. We show that the descriptors allow very fast detection of significant spectral changes in the tensor stream, which also reduce data collection, storage, and processing costs. Experiments over synthetic and real data show that SCENT is faster (17.7x--159x for change detection) and more accurate (above 0.9 F-score) than baseline methods.<\/jats:p>","DOI":"10.1145\/2037676.2037686","type":"journal-article","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T13:32:01Z","timestamp":1320759121000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["SCENT"],"prefix":"10.1145","volume":"7S","author":[{"given":"Yu-Ru","family":"Lin","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, AZ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. Sel\u00e7cuk","family":"Candan","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hari","family":"Sundaram","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lexing","family":"Xie","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,11,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872826"},{"volume-title":"Proceedings of the SIAM International Conference on Data Mining. SIAM, 56","author":"Aggarwal C.","key":"e_1_2_1_2_1","unstructured":"Aggarwal , C. and Yu , P . 2005. Online analysis of community evolution in data streams . In Proceedings of the SIAM International Conference on Data Mining. SIAM, 56 . Aggarwal, C. and Yu, P. 2005. Online analysis of community evolution in data streams. In Proceedings of the SIAM International Conference on Data Mining. SIAM, 56."},{"volume-title":"Proceedings of the SIAM International Conference on Data Mining.","author":"Aggarwal C.","key":"e_1_2_1_3_1","unstructured":"Aggarwal , C. , Zie , Y. , and Yu , P . 2010. On clustering graph streams . In Proceedings of the SIAM International Conference on Data Mining. Aggarwal, C., Zie, Y., and Yu, P. 2010. On clustering graph streams. In Proceedings of the SIAM International Conference on Data Mining."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.290954"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1127777.1127801"},{"volume-title":"Proceeedings of the 3rd International AAAI Conference on Weblogs and Social Media (Poster).","author":"Balasubramanyan R.","key":"e_1_2_1_6_1","unstructured":"Balasubramanyan , R. , Lin , F. , Cohen , W. , Hurst , M. , and Smith , N . 2009. From episodes to sagas: Understanding the news by identifying temporally related story sequences . In Proceeedings of the 3rd International AAAI Conference on Weblogs and Social Media (Poster). Balasubramanyan, R., Lin, F., Cohen, W., Hurst, M., and Smith, N. 2009. From episodes to sagas: Understanding the news by identifying temporally related story sequences. In Proceeedings of the 3rd International AAAI Conference on Weblogs and Social Media (Poster)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(02)00736-7"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143859"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860495"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/23\/3\/008"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914731"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0134-5"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183628"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562764.1562789"},{"volume-title":"Proceedings of the International Conference. on Intelligent Systems.","author":"Dasgupta D.","key":"e_1_2_1_21_1","unstructured":"Dasgupta , D. and Forrest , S . 1996. Novelty detection in time series data using ideas from immunology . In Proceedings of the International Conference. on Intelligent Systems. Dasgupta, D. and Forrest, S. 1996. Novelty detection in time series data using ideas from immunology. In Proceedings of the International Conference. on Intelligent Systems."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347107"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.08.023"},{"volume-title":"Matrix Computation","author":"Golub G.","key":"e_1_2_1_25_1","unstructured":"Golub , G. and Van Loan , C. 1996. Matrix Computation . Johns Hopkins University Press . Golub, G. and Van Loan, C. 1996. Matrix Computation. Johns Hopkins University Press."},{"key":"e_1_2_1_26_1","first-page":"1","article-title":"Foundations of the parafac procedure: Models and conditions for an \u201cexplanatory\u201d multi-modal factor analysis","volume":"16","author":"Harshman R.","year":"1970","unstructured":"Harshman , R. 1970 . Foundations of the parafac procedure: Models and conditions for an \u201cexplanatory\u201d multi-modal factor analysis . UCLA Working Papers in Phonetics 16 , 1 , 84. Harshman, R. 1970. Foundations of the parafac procedure: Models and conditions for an \u201cexplanatory\u201d multi-modal factor analysis. UCLA Working Papers in Phonetics 16, 1, 84.","journal-title":"UCLA Working Papers in Phonetics"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914732"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.89"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009044"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557077"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367590"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557080"},{"volume-title":"Proceedings of the AAAI Fall Symposium on Using Uncertainty within Computation. 121--128","author":"Rusmevichientong P.","key":"e_1_2_1_38_1","unstructured":"Rusmevichientong , P. , Pennock , D. , Lawrence , S. , and Giles , C . 2001. Methods for sampling pages uniformly from the world wide web . In Proceedings of the AAAI Fall Symposium on Using Uncertainty within Computation. 121--128 . Rusmevichientong, P., Pennock, D., Lawrence, S., and Giles, C. 2001. Methods for sampling pages uniformly from the world wide web. In Proceedings of the AAAI Fall Symposium on Using Uncertainty within Computation. 121--128."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150445"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956778"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150450"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.290953"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2037676.2037686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2037676.2037686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:28Z","timestamp":1750240468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2037676.2037686"}},"subtitle":["Scalable compressed monitoring of evolving multirelational social networks"],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1145\/2037676.2037686"],"URL":"https:\/\/doi.org\/10.1145\/2037676.2037686","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"2010-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}