{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T08:27:59Z","timestamp":1719822479922},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s11390-012-1239-7","type":"journal-article","created":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T13:10:03Z","timestamp":1337519403000},"page":"506-514","source":"Crossref","is-referenced-by-count":5,"title":["Spam Short Messages Detection via Mining Social Networks"],"prefix":"10.1007","volume":"27","author":[{"given":"Jian-Yun","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yu-Hang","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Zhao-Xiang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yun-Hong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xue-Mei","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Zhen-Jiang","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"1239_CR1","unstructured":"Hidalgo J M G, Bringas G C, Sanz E P, Garcia F C. Content based SMS spam filtering. In Proc. the 2006 ACM Symposium on Document Engineering, Amsterdam, Netherlands, Oct. 10-13, 2006, pp.107\u2013114."},{"key":"1239_CR2","unstructured":"http:\/\/www.isc.org.cn\/zxzx\/xhdt\/listinfo-1532.html ."},{"issue":"4","key":"1239_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/MC.2005.132","volume":"38","author":"PO Boykin","year":"2005","unstructured":"Boykin P O, Roychowdhury V P. Leveraging social networks to fight spam. Computer, April 2005, 38(4): 61\u201368.","journal-title":"Computer"},{"key":"1239_CR4","doi-asserted-by":"crossref","unstructured":"Yoo S, Yang Y, Lin F, Moon I. Mining social networks for personalized email prioritization. In Proc. the 15th ACM SIGKDD, Paris, France, June 28-July 1, 2009, pp.967\u2013976.","DOI":"10.1145\/1557019.1557124"},{"key":"1239_CR5","unstructured":"Gomes L\u00a0H, Almeida R B, Bettencourt L\u00a0M A, Almeida V, Almeida J\u00a0M. Comparative graph theoretical characterization of networks of spam and legitimate email. In Proc. Conf. Email and Anti-Spam, California, CA, USA, July 21-22, 2005."},{"issue":"23","key":"1239_CR6","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman M E J. Modularity and community structure in networks. Proceedings of National Academy of Sciences of U.S.A., May 2006, 103(23): 8577\u20138582.","journal-title":"Proceedings of National Academy of Sciences of U.S.A."},{"key":"1239_CR7","unstructured":"Goldberg A V. Finding a maximum density subgraph. Technical Report, Uni. California, Berkeley, 1984. http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/1984\/CSD-84-171.pdf ."},{"issue":"2","key":"1239_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.jda.2005.03.002","volume":"4","author":"F Grandoni","year":"2006","unstructured":"Grandoni F. A note on the complexity of minimum dominating set. J. Discrete Algorithms, June 2006, 4(2): 209\u2013214.","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"1239_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J. Paths, trees, and flowers. Canadian Journal of Mathematics, 1965, 17(3): 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"1239_CR10","unstructured":"Knuth D. Dancing links. Millennial Perspectives in Computer Science, Nov. 2000: 187\u2013214."},{"key":"1239_CR11","unstructured":"Almeida V, Bestavros A, Crovella M, de Oliveira A. Characterizing reference locality in the WWW. In Proc. the 4th Int. Conf. Parallel and Distributed Information Systems, Miami Beach, USA, Dec. 18-20, 1996, pp.92\u2013103."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1239-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1239-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1239-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T22:45:12Z","timestamp":1561761912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1239-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["1239"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1239-7","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}